![]() |
Generalized Fermat Prime Search?
I'd like to know if prothsearch is still active; I'd like to search also some Generalized Fermat primes but mr. Yves Gallot didn't answer to my email to reserve a range .
Do you know if it is still active ? Or any similar project ? |
[QUOTE=pacionet]I'd like to know if prothsearch is still active; I'd like to search also some Generalized Fermat primes but mr. Yves Gallot didn't answer to my email to reserve a range .
Do you know if it is still active ? Or any similar project ?[/QUOTE] I assume you mean the Generalized Fermat Prime Search at [url]http://perso.wanadoo.fr/yves.gallot/primes/gfn.html[/url] and not the Proth Search at [url]http://www.prothsearch.net[/url]. AFAIK, Yves has been out of contact for over a year. Phil Carmody has helped with the GFN search (in the sieving area). He might know something. Another person who might know is Daniel Heuer. |
Is [url]http://www.prothsearch.net/[/url] offering pre-sieved ranges? If so I have some slow computers that I can put on finding small proth primes. Please let me know on how to get these ranges?
Thanks, Citrix edit: I think I figured on how to get presieved ranges. May be you can put a guide on which k's are in need of most work. |
[QUOTE=Citrix]Is [url]http://www.prothsearch.net/[/url] offering pre-sieved ranges? If so I have some slow computers that I can put on finding small proth primes. Please let me know on how to get these ranges?
Thanks, Citrix edit: I think I figured on how to get presieved ranges. May be you can put a guide on which k's are in need of most work.[/QUOTE] You should be able to get pre-sieved ranges from [url]http://www.prothsieve.com/[/url], although it didn't work the last time I tried. As for "most needed", there is no such concept for the Proth Search. |
| All times are UTC. The time now is 17:03. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.