/guava/android/guava/src/com/google/common/math/LongMath.java
short j = 0;
int j = 0;
return true; } long a = powMod(base, d, n); if (a == 1) { return true; } <extra_id_0> while (a != n - 1) { if (++j == r) { return false; } a = squareMod(a, n); }