20070324, 15:44  #1 
Jun 2005
373 Posts 
Welcome!
This project is searching a Cullen prime, i.e. a prime of the form n*2^n+1, with prime exponent.
The project consists of three parts: Sieving with gcwsieve and the sieve.txt in the sieve reservation thread is going to be finished soon, but still available, P1 with prime95 or mprime can be reserved in the P1 reservation thread and will advance as it becomes necessary, and LLR, the actual prime hunting, with the LLRclient (not LLRnet); the content for the input files needs to be copy/pasted in the LLRreservation thread. Currently, there are about 4000 tests below 5M remaining, and any substantial help is appreciated to finish them off. Background:There are 14 Cullen primes known, but only with composite exponents, and nobody knows if there is one with a prime exponent. That's why this project exists. The first stage of the project is the search in the range n=1.5M5M. Below 1.5M, all Cullen numbers have been tested by others and no prime exponent yielded a prime(Doublecheck up to 400000). The range we are working on for the moment has been sieved by the same people up to 2.5 G, and with the improvements done by Citrix to Mark Rodenkirchs multisieve, and geoff's gcwsieve, based on Rodenkirch's code as well, currently being sieved beyond 3000G. This project, given its small scale, is mostly run manually; reservations, database, all this is not automated and will probably never be. So, please don't expect realtime handling of the results etc, but the organisation should take place in reasonable delys, normally. Stats are not planned for the moment, but your reservations are going to be kept public in the reservation threads, so that one can figure out how much you contributed. Finally, welcome again, and let us find that prime and finish the project soon. Yours H. Last fiddled with by hhh on 20070505 at 07:32 
20070325, 05:59  #2  
Jun 2005
2·7^{2} Posts 
Quote:
HHH congratulation on your organisational skills and running with the idea that had started at http://primepuzzles.redgolpe.com/topic.asp?TOPIC_ID=10 . I wish this group luck and it will be great if the primeCullenprime exponent can be found, there is no reason why it should not exist. 

20070505, 01:04  #3 
"Jason Goatcher"
Mar 2005
DB1_{16} Posts 
Just out of curiousity, how many Cullen primes are known, and what are the chances that a prime Cullen prime hasn't been found because of simple dumb luck? In other words, if a number being searched is assumed to have the same odds of success as another number nearby in the range, what is the statistical chance that we would get this far without finding a prime Cullen prime.

20070505, 07:42  #4 
Jun 2005
373 Posts 
I put some of the information requested in the initial post. As for the chances of dumb luck, I don't know much; As for the Woodalnumbers, with 1 instead of +1, there exist prime exponents yielding a prime, e.g. 3, but that doesn't need necessarily something.

20070617, 00:18  #5 
"Jason Goatcher"
Mar 2005
3505_{10} Posts 
[Offtopic]
Can't you just picture someone, later on in the main effort, where they don't care if the exponent is prime or not but they're only testing composites because they're at a lower nvalue than this project. (new person to the effort): I just noticed something remarkable about the sieved exponents, and I'm wondering if this has been recorded before. EVERY SINGLE nvalue is composite. At the moment, I'm attempting to figure out why this is. Does anyone have any theories? (Old hand in the project): That IS amazing. Keep at it, dude. And meanwhile he's PMing everyone to check out this noob's post. [/Offtopic] Last fiddled with by jasong on 20070617 at 00:43 
20070617, 00:53  #6  
"Robert Gerbicz"
Oct 2005
Hungary
2^{4}×83 Posts 
Quote:


20070618, 01:06  #7 
"Jason Goatcher"
Mar 2005
3505_{10} Posts 
I'm going to expose my ignorance here. Because the numbers are of the form
k*2^n+1, and k is prime, does this not increase the chance that a number has a small factor like 3 or 5? I mean, with other k's there's an increased chance, an observable phenomenon, that one or more small primes are represented in the kvalue. In my opinion, the fact that it's always a prime k decreases the chance that a random nvalue will yield a prime. Am I wrong? 
20070618, 01:31  #8  
Jun 2003
3·503 Posts 
Quote:
Using a program I calculated that if you sieve a bunch of numbers to 20M, then each candidate remaining is 30 times more likely to be prime compared to each before sieving. edit: this is true in general, but if a series has special form of factors like mersenne numbers, then this is totally off. No one knows if prime cullen factors have a special form or not. Last fiddled with by Citrix on 20070618 at 02:10 
