package ma;
public class Primal {
/**
* @param args
*/
public static void main(String[] args) {
Primal p = new Primal();
int[] primals = {49919, 49921, 49927, 49937, 49939, 49943, 49957, 49991, 49993, 49999};
for(int i=0; i<primals.length;i ++) {
System.out.println(p.IsPrimal(primals[i]));
}
int[] numbers = {49920, 49923, 49929, 49933, 49931, 49941, 49953, 49997, 49996, 49998};
for(int i=0; i<numbers.length;i ++) {
System.out.println(p.IsPrimal(numbers[i]));
}
}
/**
* @author
* @param N 测试的整数
* @return 是否是素数
*/
public boolean IsPrimal( int N) {
int maxCheck = (int)Math.sqrt(N);
boolean result = true;
for (int i=2; i<=maxCheck; i++) {
if (N % i == 0) {
result = false;
break;
}
}
return result;
}
}
Java实例20 - 素数测试
最新推荐文章于 2022-12-27 05:45:00 发布