A prime number is a positive integer which is divisible only by 1 and itself. For example: 2, 3, 5, 7, 11, 13
Program:
#include <stdio.h>
int main()
{
int n, i, check = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
for(i = 2; i <= n/2; ++i)
{
// condition for non-prime number
if(n%i == 0)
{
check = 1;
break;
}
}
if (n == 1)
{
printf("1 is neither a prime nor a composite number ");
}
else
{
if (check == 0)
printf("%d is a prime number.", n);
else
printf("%d is not a prime number.", n);
}
return 0;
}
Output:
Enter a positive integer: 29 29 is a prime number.Flowchart:
No comments:
Post a Comment
Feel free to ask us any question regarding this post