不能被小于其平方根的质数整除的奇书为质数
package part521;
import java.util.*;
public class Test07 {
public static void main(String[] args) {
int count=0;
final int NUM = 10000;
int[] array = new int[NUM/2];
int size = 0;//统计质数的数量,下一个质数的下标位置
array[size++] = 2;//赋值第一个元素
boolean is;
for (int i = 3,n; i <=NUM ; i+=2,count++) {
n = (int)Math.sqrt(i); //10000的算术平方根
is = true; //设置boolean为true
for (int j = 0; array[j] <= n; j++) {
if (i%array[j]==0){
is = false;
break;
}
}if (is){
array[size++] = i;
}
}
for (int i = 0; i < size; i++) {
System.out.println(array[i]);
}
System.out.println("循环了" + count +"次");
}
}
其实还可以再外层循环再加入判断来继续减少循环次数如质数都是1+6n或者5+6n。(n % 6 != 1 && n % 6 != 5)