判断是否为素数

#include <stdio.h> 
#include <math.h> 
 
bool isPrime(int number)
{ 
    int i;
    int k;
    k=(int)sqrt((double)number);
    for(i = 2; i <= k; i++)
        if(number%i==0) break;
    if(i>k)
             return true;
       else
             return false;
}
 
int main(int argc, char* argv[]) 
{ 
    int number = 0;
    printf("Please enter an integer：\n");
 
    scanf("%d", &number);
    if(isPrime(number))
    {
        printf("%d is a prime.\n", number);
    }
    else
    {
        printf("%d is not a prime.\n", number);
    }
}