Method isPrime

32. Java Programs/fibonacci_twist.java:30–40

(int n)

	}

	private static boolean isPrime(int n) {
	    if (n == 1) {
	        return false;
	    }
	    for (int i = 2; i * i <= n; i++) {
	        if (n % i == 0) {
	            return false;
	        }
	    }
	    return true;
	}
}