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
At 07:57 PM 11/19/2001 -0800, you wrote:
>> Spike Jones (hey, Spike!) wrote
>>
>> >Lets have a Bay Area GIMPS party!
>> >Same place as before? Ill have the prime rib. {8-] spike
>>
>> [EMAIL PROTECTED] wrote: I'm game (well-seasoned venison, in fact :),
>> ...little PrimeFest before the years' end?
>>
>> If not, Spike and I (and anyone else who cares to join us)
>> will have to party without you, and where's the fun in that?
>>
>> -Ernst
>
>There are others in neighborhood. As I recall last time
>was kind of an inconvenient time for a lot of em, dont
>recall the circumstances. Ernst my wife spoke at length
>about what a nice man you are. So now I sleep with one
>eye open.
>
>{8^D
>
>GIMPSers! Where are you? Lets party! spike
>
>
>_________________________________________________________________________
>Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
>Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
>
>
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
