Navigation
Home
News
Status
Ranges
Primes
Participants
Links
Impressum
Definition
Generalized Cullen Primes are numbers that are prime and of
the form GCn,b = n * b n + 1 with b > 2 and n + 2 > b.
The goal of this project is to find prime number(s) for every
base b with b > 100 and b <= 200. The results for b >= 3 and b <= 100
are taken from Günter Löh.
If you want to join the search, send me an email which range
you want to test. I will reserve this range on the status page.
Then first sieve your range with the MultiSieve software from Mark
Rodenkirch.
Then run PRP-test with the remaining candidates using the
WinPFGW software from OpenPFGW group or use the LLR software from George Woltman and Jean Penné to get about 10% better performance on Intel machines.
Finally run on any PRP-result a prime test with Yves Gallot
Proth software.
If you find an new prime, please email me the result file.
Last Modified 25.10.2006
questions and comments to Daniel Hermle