Jeremy Blosser wrote:
>So for each squaring, we have x left shifts and adds, where x is no larger
>that p.
Hi, Jeremy:
A couple years ago I discussed the same issue with an old schoolfriend of
mine, who is a specialist in microelectronics. He said, sure, with a giant
binary shifter (perhaps imp
Mersenne Digest Sunday, February 13 2000 Volume 01 : Number 693
--
Date: Thu, 10 Feb 2000 23:33:21 -0500
From: Pierre Abbat <[EMAIL PROTECTED]>
Subject: Re: Mersenne: "How Many Angels, How Many Pins?" Or PrimeNet
Please make this go away. Stop sending me this stuff
_
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Hi,
I'm running Prime95 on a machine with a PII-400 doing LL tests. The
machine finished up an exponent in the 9,000,000 range (512K) and started
doing an LL test on an exponent around 828. I expected the iteration
times to speed up (384K or 448K, not sure which for the lower exponent),
but
