Continuation of John Cosgrave's 3*2^n+1 Fermat Factor search
- [BCC:d to some]
As some will no doubt have already seen, John Cosgrave has had to call a halt
to his huge push searching for Fermat divisors along the family 3*2^n+1, and
has offered his deeply-sieved candidates (n=5300000+) for others to test.
I have offered to host those candidates on the range server that I use for
other 'manual reservation' tasks, and would like to drum up support for the
continuation of the project. The range has yielded two huge primes already
(sitting at #20 and #30 in the top-5000 currently), and the size of the current
candidates would mean that the next one found would sit even higher still.
In order to make a reservation, first sign up at:
and drop me a mail indicating that you'd like reservation permission for the
3*2^n+1 Fermat Factor Search project. Once granted, then you can make the
Hopefully this will all be familiar to those who've participated in Yves' GFN
search, Les GeneFermiers, PIES, or Nuutti Kuosa's factorial search in recent
times, it's the same system.
I recommend a range of about 1000 for about 1 month's work on a fast machine.
Please don't reserve more than you can reasonably test in a few months. Obvious
abuse of the system will result in slapped wrists.
Upon completion of the range, or if you think you have bitten off more than you
can chew and want to return a chunk, just drop me another mail.
If Leonid and Payam could get in contact with me so that I can add a little bit
more to the webpage about how this range fits in with their efforts to find
Fermat divisors, I'd be most grateful.
() ASCII ribbon campaign () Hopeless ribbon campaign
/\ against HTML mail /\ against gratuitous bloodshed
[stolen with permission from Daniel B. Cristofani]
No need to miss a message. Get email on-the-go
with Yahoo! Mail for Mobile. Get started.