Quote:
Originally Posted by Citrix
On http://primes.utm.edu/top20/page.php?id=6
There is an open problem to find a cullen prime p*2^p+1 where p is also prime. Has anyone done anywork on this?
I tried to write a crude sieving program. There are ~9000 candidates left under p=5 million when the range is sieved to 350 Million.
Factors available on request.
Is anyone interested in improving on these results. Writing a faster sieve software? Any thoughts on how to solve this problem?
Thanks!

d/l my MultiSieve program. You can build a list of primes into an ABC file (which MultiSieve supports), then start sieving at 2.