第六章第十题（使用isPrime方法）(Use the isPrime Method)

第六章第十题（使用isPrime方法）(Use the isPrime Method)

• 6.10（使用isPrime方法）程序清单6-7提供了测试某个数字是否是素数的方法isPrime（int number）。使用这个方法求小于10000的素数的个数。
  6.10(Use the isPrime Method) Listing 6.7, PrimeNumberMethod.java, provides the isPrime(int number) method for testing whether a number is prime. Use this method to find the number of prime numbers less than 10000.
• 参考代码：

package chapter06;

public class Code_10 {
    public static void main(String[] args) {
        int primeCount = 0;
        for(int i = 2;i < 10000;i++)
            if(isPrime(i))
                primeCount++;
        System.out.printf("The number of prime numbers less than 10000 is %d",primeCount);
    }
    public static boolean isPrime(int number) {
        for (int divisor = 2; divisor <= number / 2; divisor++) {
            if (number % divisor == 0)
                return false;
        }
        return true;
    }
}

• 结果显示：

The number of prime numbers less than 10000 is 1229
Process finished with exit code 0