View Single Post
Old 2006-11-24, 21:03   #1
Citrix's Avatar
Jun 2003

22×397 Posts
Default Cullen prime problem (How everything began)

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?


Last fiddled with by hhh on 2007-03-24 at 23:21
Citrix is offline