We will be discussing *the* latest algorithms at the party. That's the best way to get particulars out of Ernst.
--Luke At 12:17 AM 11/20/01 -0600, [EMAIL PROTECTED] wrote: >I am not interested in parties, ratings for highest contributions, number >assignments, or information on microprocesor speeds. > >I am writing a machine language program to find the next 'greater than >10,000,000 digits' mersenne prime. > >Anyone have any ideas for a algorithm, or approach that has not been >discussed lately? > >Thanks >Dan _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
