自己实践了一下素数的算法,很简单
public class Prime {
/**
*
* @Title: isPrime
* @Description: 判断是否为素数,是则返回true,否则返回false
* @param @param N
* @param @return 设定文件
* @return boolean 返回类型
* @throws
* @author 刘辰光
*/
public static boolean isPrime(int N){
if(N<2)
return false;
for(int i=2;i*i<=N;i++){
if(N%i==0)
return false;
}
return true;
}
public static void main(String[] args) {
System.out.println("9 is Prime "+isPrime(9));
System.out.println("17 is Prime "+isPrime(17));
System.out.println("245 is Prime "+isPrime(245));
System.out.println("1349 is Prime "+isPrime(1349));
System.out.println("13491 is Prime "+isPrime(13491));
}
}