判断一个数字是否为质数
方法简单高效!!!
public class IsPrime {
public static void main(String[] args) {
int[] test = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 33, 61, 75, 101};
for (int i : test) {
System.out.println(i + ":" + isPrime(i));
}
}
public static boolean isPrime(int num) {
if (num <= 1) return false;
for (int i = 2; i * i <= num; i++) {
if (num % i == 0) return false;
}
return true;
}
}
// 输出如下所示
1:false
2:true
3:true
4:false
5:true
6:false
7:true
8:false
9:false
10:false
11:true
12:false
13:true
14:false
15:false
33:false
61:true
75:false
101:true