Wojciech Florek (WsF) asks: > The second question I should send directly to Chris Caldwell. > In his Prime > Pages the N-1 test of primality needs such a that a^(N-1)=1 mod N and > a^(N-1)/q is not 1 mod N (q is a factor of N-1). Methods for > determining > the number a are not presented. Are there any such methods?
The method used in practice is to choose successive integers >= 2 until one is found to work. Proof that a small value of a exists seems to require the ERH. Paul _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
