> There are a lot of alternatives based on the range you want. Some popular ranges would be y<2^31 y<2^32 y<2^63 y<2^64
----- Original Message ----- From: John Randall <[EMAIL PROTECTED]> Date: Thursday, October 30, 2008 7:54 Subject: Re: [Jprogramming] Miller-Rabin primality test To: Programming forum <[email protected]> > Roger Hui wrote: > > Thanks. I'll incorporate the ideas into the essay. > > > > Do you have a proof that potential witnesses are > > limited for y in a smaller range? > > There is a whole set of results in: > > Gerhard Jaeschke, On strong pseudoprimes to several bases, > Mathematics of > Computation 61 (1993), no. 204, pp. 915926. > > They are discussed in detail in > > P. Ribenboim, The new book of prime number records, 3rd edition, > Springer-Verlag, 1995. > > Unless you really want to get into it, the most useful summary is > > http://primes.utm.edu/prove/prove2_3.html > > There are a lot of alternatives based on the range you want. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
