计算质数

Question

我研究欧拉问题已有一段时间了。我的程序显示质数，但我想按顺序查看它是哪个数。

public class Euler7 {
    public static void main(String[]args) {
        boolean prime = true;

        for(int count = 2; count <= 1000; count++){
            for(int count1 = 2; count1 <= Math.sqrt(count); count1++) {
                prime = true;
                if(count%count1==0) {
                    prime = false;
                    break;
                }
            }
            if(prime == true) {           
                System.out.println(count);
            }   
        }                 
    }
}

Answer 1

我的解法，2是第一个素数。

public class Euler7 {
    public static void main(String[] args) {
        boolean prime;
        int cnt = 0;

        for(int count = 2; count <= 1000; count++){
            prime = true;
            for(int count1 = 2; count1 <= Math.sqrt(count); count1++) {
                if(count%count1==0) {
                    prime = false;
                    break;
                }
            }
            if(prime){
                cnt++;
                System.out.println(cnt + "th prime number is " + count);
            }
        }
    }
}

计算质数

Counting prime numbers

java

primes