@GwtIncompatible // TODO
  @Beta
  public static boolean isPrime(long n) {
    if (n < 2) {
      checkNonNegative("n", n);
      return false;
    }
    if (n == 2 || n == 3 || n == 5 || n == 7 || n == 11 || n == 13) {
      return true;
    }

    if ((SIEVE_30 & (1 << (n % 30))) != 0) {
      return false;
    }
    if (n % 7 == 0 || n % 11 == 0 || n % 13 == 0) {
      return false;
    }
    if (n < 17 * 17) {
      return true;
    }

    for (long[] baseSet : millerRabinBaseSets) {
      if (n <= baseSet[0]) {
        for (int i = 1; i < baseSet.length; i++) {
          if (!MillerRabinTester.test(baseSet[i], n)) {
            return false;
          }
        }
        return true;
      }
    }
    throw new AssertionError();
  }
@GwtIncompatible 
  @Beta
  public static boolean isPrime(long n) {
    if (n < 2) {
      checkNonNegative("n", n);
      return false;
    }
    if (n == 2 || n == 3 || n == 5 || n == 7 || n == 11 || n == 13) {
      return true;
    }

    if ((SIEVE_30 & (1 << (n % 30))) != 0) {
      return false;
    }
    if (n % 7 == 0 || n % 11 == 0 || n % 13 == 0) {
      return false;
    }
    if (n < 17 * 17) {
      return true;
    }

    for (long[] baseSet : millerRabinBaseSets) {
      if (n <= baseSet[0]) {
        for (int i = 1; i < baseSet.length; i++) {
          if (!MillerRabinTester.test(baseSet[i], n)) {
            return false;
          }
        }
        return true;
      }
    }
    throw new AssertionError();
  }
@ GwtIncompatible // TODO @ Beta public static boolean isPrime ( long n ) { if ( n < 2 ) { checkNonNegative ( "n" , n ) ; return false ; } if ( n == 2 || n == 3 || n == 5 || n == 7 || n == 11 || n == 13 ) { return true ; } if ( ( SIEVE_30 & ( 1 << ( n % 30 ) ) ) != 0 ) { return false ; } if ( n % 7 == 0 || n % 11 == 0 || n % 13 == 0 ) { return false ; } if ( n < 17 * 17 ) { return true ; } for ( long [ ] baseSet : millerRabinBaseSets ) { if ( n <= baseSet [ 0 ] ) { for ( int i = 1 ; i < baseSet . length ; i ++ ) { if ( ! MillerRabinTester . test ( baseSet [ i ] , n ) ) { return false ; } } return true ; } } throw new AssertionError ( ) ; }
Returns {@code true} if {@code n} is a <a
href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater
than one</i> that cannot be factored into a product of <i>smaller</i> positive integers.
Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be
factored into smaller positive integers).

<p>To test larger numbers, use {@link BigInteger#isProbablePrime}.

@throws IllegalArgumentException if {@code n} is negative
@since 20.0
Returns { @code true } if { @code n } is a <a href = http : // mathworld . wolfram . com / PrimeNumber . html > prime number< / a > : an integer <i > greater than one< / i > that cannot be factored into a product of <i > smaller< / i > positive integers . Returns { @code false } if { @code n } is zero one or a composite number ( one which <i > can< / i > be factored into smaller positive integers ) .