Java显示素数

素数：大于1的整数，正因子只有1和它本身

• 判断一个给定数是否是素数
• 针对number=2，3，4，5，6，···，测试它是否为素数
• 统计素数的个数
• 打印每个素数，每行打印10个

public static void printPrimeNumbers(int numberOfPrimes){
    final int NUMBER_OF_PER_LINE = 10;//Dispaly 10 per line
    int count = 0; //Count the number of prime numbers 
    int number = 2; //A number to be tested for prumeness

    //Repeatedly find prime numbers
    while (count < numberOfPrimes){
      //Print the prime number and increase the count
        if (isPrime(number)){
            count++;// Increase the count
            if(count % NUMBER_OF_PER_LINE == 0){
                 System.out.printf("%-5s\n", number);
            }else{
            System.out.printf("%-5s\n", number);
            }
        }
    //Check whether the next number is prime
    number++;
    }
}

/** Check whether number is prime */
public static boolean isPrime(int numbr) {
    for(int divisor = 2; divisor <= number / 2; divisor++){
        if(number % divisor == 0){
        return false; //Number is not a prime
        }
    }
return true;//Number is prime
}