判断素数

public boolean isprime(int num){

 

        int divisor;

        if(num<=1) return false;

        for(divisor=2;divisor*divisor<=num;divisor++){

             if(num%divisor==0){

                 return false;

             }

        }

        return true;

}