isPrime

int isprime(int number){
     int i;
     for(i=3; i<=sqrt(number); i=i+2)
     if(number%i == 0)return 0;
     if(number < 2 || (number > 3 && number%2 == 0)) return 0;
     return 1;
}