View Single Post
Old 2006-11-25, 01:27   #6
rogue's Avatar
Apr 2003
Between here and the

5×113 Posts

Originally Posted by Citrix View Post
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?

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