Implement a function that determines whether a number is prime.
Program:
#include <stdio.h>
#include <math.h>
int Prime (int num) //prime = Prime number
{
int i = 0;
int k = 0;
k = sqrt (num);
for (i = 2; I <= K; i++)
{
if (num%i = = 0)
{
return 0;
}
}
return 1;
}
int Main ()
{
int num;
int ret;
printf ("Please enter a positive integer greater than 1:");
scanf ("%d", &num);
RET = prime (num);
if (ret = = 1)
{
printf ("%d is prime number \ n", num);
}
Else
{
printf ("%d is not a prime number \ n", num);
}
return 0;
}
Result one:
Please enter a positive integer greater than 1 :8
8 is not a prime number
Please press any key to continue ...
Result two:
Please enter a positive integer greater than 1 :
The prime number is
Please press any key to continue ...
This article is from the "Rock Owl" blog, please be sure to keep this source http://10742111.blog.51cto.com/10732111/1722383
C Language: Implement a function to determine whether a number is a prime.