Oops. Minor typo:
Where I wrote:
> All we need to do is find a value "a" such that a^((p-1)/ q) is not
> equivalent to 1 modulo p for all of the primes q which divide p - 1.
> (Actually, this is stricter than necessary, as a different "a" could be
> chosen for each q, but never mind.)
>
> I claim that a=11 solves this problem. The values of 11^((p-1)/q) for
each
I meant:
"The values of 11^((p-1)/q) modulo p for each ..."
which should have been clear from the previous paragraph.
Paul
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
