public static long powMod2_32(int prime, int number) {
int answer2 = 1;
int p = prime;
for (int n = number; n > 0; n >>>= 1) {
if ((n & 1) != 0)
...