Brian Beesley writes: >I've posted on my ftp server a file which may be of interest to >anyone developing or verifying the operation of LL testing programs. Mlucas users please note: my code treats the initial residue (4) as "iteration one," rather than the more-common zero. (I guess that makes it obvious I'm a Fortran guy, eh? :) Thus, to compare to, e.g. Brian's 400-iteration residue for a given exponent, you'd need to specify 401 iterations using the Mlucas timing test feature. (I'd actually prefer Brian use 10-iteration residues, since then Mlucas would literally "go to eleven," but I realize ten iterations is too few for a decent QA test.) Also, Mlucas requires the exponent to be prime (actually a strong probable pseudoprime), whereas most of the exponents in Brian's QA file are composite. Brian, any chance you could flag the prime exponents in the file? (you could write a small code to do this automatically.) Cheers, Ernst _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
