/guava/guava/src/com/google/common/math/LongMath.java
if ( a == 1) {   return true; }
[Delete]
return res; } private boolean testWitness(long base, long n) { int r = Long.numberOfTrailingZeros(n - 1); long d = (n - 1) >> r; base %= n; <extra_id_0> return true; } long a = powMod(base, d, n); if (a == 1) { return true; }