Method powMod

output/java_guava/1.4.16/LongMath.java:1288–1297

Returns a^p mod m.

(long a, long p, long m)

     */

private long powMod(long a, long p, long m) {
 long res = 1;
 for (; p != 0; p >>= 1) {
   if ((p & 1) != 0) {
     res = mulMod(res, a, m);
   }
   a = squareMod(a, m);
 }
 return res;
}

    /**
     * Returns true if n is a strong probable prime relative to the specified base.