[seqfan] Re: successive powers of 2 modulo n

franktaw at netscape.net franktaw at netscape.net
Sat Jun 11 00:20:48 CEST 2011

No, you can't. If 2 is a primitive root of p, then all p-1 values do 

Franklin T. Adams-Watters

-----Original Message-----
From: Alonso Del Arte <alonso.delarte at gmail.com>

Even a very large prime is still finite. Let's say p is a titanic prime.
There are only (p – 1) possibilities for 2^n mod p. Using Fermat's 
theorem you can probably reduce this further still.

More information about the SeqFan mailing list