Check a number is prime or not
 Programming Logics
 06 Jul,2016
 0
The simplest primality test is trial division: Given an input number n, check whether any prime integer m from 2 to n/2 evenly divides n (the division leaves no remainder). int main(){
int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d",&n);
for(i=2; i<=n/2; ++i)
{
// condition for nonprime number
if(n%i==0)
{
flag=1;
break;
}
}
if (flag==0)
printf("%d is a prime number.",n);
else
printf("%d is not a prime number.",n);
return 0;
}
|