第六章第二十九题（双素数）(Twin primes) - 编程练习题答案

// https://cn.fankuiba.com
public class Ans6_29_page203 {
    public static void main(String[] args) {
        for (int p = 3; p+2 < 1000; p++) {
            if (isPrime(p) && isPrime(p+2))
                System.out.println("("+p+","+(p+2)+")");
        }
    }

    public static boolean isPrime(double number) {
        boolean isPrime = true;
        for (int divisor = 2; divisor <= number / 2; divisor++) {
            if (number % divisor == 0) {
                isPrime = false;
                break;
            }
        }
        return isPrime;
    }
}