Recently I wrote:
> Well, if a Mnumber has been trial-factored to 2^63 (with no success,
> or else we wouldn't be considering P-1 now), then P-1 will not
> find any factors of 63 bits or less.
Tom Cage has reminded me that he and others have found factors with
P-1 that are smaller than the poste
Recently I've been translating Prime95's P-1 limit-choosing algorithm
into another language for a P-1 utility of mine. Let me offer some
further explanation. (George, please point out any errors!)
Inputs to the algorithm: exponent of the Mersenne number to be factored,
how far (as a power of
Brian J. Beesley wrote:
> Shouldn't make much difference
Of course.
By Daran's example (quoted here in reverse order),
7714127B1=4, B2=65
7786567B1=4, B2=64
one can easily see that the effect of differing FFT sizes (384K for
exponent 7714127, 448K for 7786567) on cho
- Original Message -
From: "Brian J. Beesley" <[EMAIL PROTECTED]>
To: "Richard Woods" <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]>
Sent: Saturday, July 13, 2002 10:15 PM
Subject: Re: Mersenne: Re: P-1 limits
> On Saturday 13 July 2002 10:04, Richard W
