Quote:
Originally Posted by axn
Code:
gp > p=44497;
gp > N=2^p1;
gp > q=(N1)/p;
gp > r=N+1;
gp > #
timer = 1 (on)
gp > lift(Mod(3,N)^N);
time = 18,095 ms.
gp > lift(Mod(3,N)^q);
time = 18,032 ms.
gp > lift(Mod(3,N)^r);
time = 17,986 ms.
gp >
lift(Mod(3,N)^(N+1)) is, of course, 9, for primes.

Yes. All squarings. Pari maybe is not the best program to use to see the true differences.