Primes { public static boolean isPrime(int n) { for (int i = 2; i < n; i++) { if (n % i == 0) { return false; } } return true; }  static boolean isPrime(int n); static boolean isPrimeFast(int n); static boolean isPrimeWhile(int n); static boolean isPrime(long n);  }
@Test(enabled = false) public void testPrimeLong() { long n = Integer.MAX_VALUE; Assert.assertTrue(Primes.isPrime(n)); }
@Test public void testNonPrime() { Assert.assertFalse(Primes.isPrime(Integer.MAX_VALUE - 2)); }