--- Forwarded message follows ---
From: Brian J. Beesley [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Date sent: Fri, 22 Jun 2001 18:46:43 -
Subject:Re: Mersenne: Factoring on a P4
Copies to: [EMAIL PROTECTED]
On 22 Jun 2001, at 13:42, Gordon Bower wrote:
After seeing a post on this list a few weeks ago I decided to branch
out and try a few ranges from Michael Hartley's page looking for
k*2^n-1 primes. I must say there is a bit of a thrill in actually
discovering a new prime every day I run the
Brian J. Beesley Wrote:
My strategy is:
(1) run Proth at medium priority in factoring only mode to eliminate
candidates with small factors;
For step 1 i use Newpgen. I think this is better configurable then proth in
how far or long you want to factor. Don't know which is the fastest of the
