I have written the simple source code to find whether the entered number is prime or not.
For this we have to know what is prime number.
Prime number is the number which is divisible by 1 and the number itself. Lets take an example. For example 2 is prime number and 4 is not prime number or it is composite number.
Don't miss
Friday, February 28, 2014
Popular Posts
-
Here is a solution of ioe engineering drawing tutorial 5 orthographics projection question no 7 -
In this page I have given the concept how to find the cube of the number entered using recursion. The main point to remember is :
-
1. A gas undergoes compression from an initial state of V₁ =0.1 m 3 , P₁ =200 KPa to a final state of V₂ =0.04 m 3 , P₂ =500 KPa. If the pre... -
In this program I have used array to enter the values and display the values in matrix form. I will elaborate how the program works on the b...
-
In this page I have written the program to find the numbers that are divisible by one number and not by another number. For more inform... -
In this programme I have given you the concept how to find the area of the circle using recursion function. I have used integer data types s...
-
In the last page I have written the program to find the transpose of the entered matrix. Now I have made a program that reads the number un... -
In this page I have given the concept to find the sum of the diagonal element of the entered desired matrix. For more information have a lo... -
Lets learn something new about string.In this page I have made a program to find the reverse order of the entered string without using sta... -
In this page I have kept the concept of checking whether a number is prime or composite using recursive function.However 1 is neither prime ...
0 comments :
Post a Comment