Go Back > Other Stuff > Archived Projects > PSearch

Thread Tools
Old 2003-02-17, 19:48   #1
P90 years forever!
Prime95's Avatar
Aug 2002
Yeehaw, FL

153778 Posts
Default 2.2 million?

Are you now going to start on exponents above 2.2 million to try and capture the largest non-Mersenne prime title?
Prime95 is online now  
Old 2003-02-17, 21:13   #2
wfgarnett3's Avatar
"William Garnett III"
Oct 2002
Bensalem, PA

22×3×7 Posts
Default sticking where we are :)

Hi George,

Nah, we are going to stick where we are. No reason to waste all the work we have done, as we are practically done sieving and have a good amount of PRP work done. So we will stick with searching for the largest "proth" (now 6th largest prime overall). After all, the larger the exponent, the more work that needs to be done; also who knows, someone else may beat Michael Angel number and we would have to start over again :)

wfgarnett3 is offline  
Old 2003-02-18, 04:04   #3
ebx's Avatar
Aug 2002

101 Posts

A decent CPU can test about 3 131072 gfn numbers every day. Soon we will be out of 'testable' gfn -- all untested numbers are so large that essentially they are in the same scale as mersenne numbers.
ebx is offline  
Old 2003-02-21, 21:32   #4

1ED716 Posts
Default largest non-mersenne

Has anyone else thought about LLR, to find primes of the form k*2^n-1?

Since Mersennes primes are a subset of these Riesel primes, there should be plenty of testable k left, that yield frequent primes for n=1,2,3,4....

For example k=195 yields many primes.
I found 195*2^243999-1(73,545 digits)
is prime with LLR, within just a few hours.
In fact there should be k, that for all n are prime, with (k =< 2^n)
I dont expect anyone to find one soon but the implications are fascinating.
Especially with the definition of a Riesel number. A proof may be the only tangible evidence.

PS I notice k is seldomly prime, for Riesel primes.
Does anyone know the mechanism for this?
Old 2003-02-22, 08:42   #5
Oct 2002

43 Posts
Default Re: largest non-mersenne

Originally Posted by TTn
PS I notice k is seldomly prime, for Riesel primes.
Does anyone know the mechanism for this?
If p divides k, then p does not divide k*2^n-1. This means that N=k*2^n-1 is prime with probability k/phi(k) * 1/ln(N) instead of probability 1/ln(N).

For k<100 with k*2^n-1 prime, this moves the probability that k is prime from 1 in 4 to 1 in 7; for k<1000, the probability of k prime moves from 1 in 6 to 1 in 11; for k<10000, the probability moves from 1 in 8 to 1 in 16.
cperciva is offline  

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
500 - 600 Million Range moo LMH > 100M 32 2013-02-06 03:14
Day Million jasong Puzzles 15 2007-08-25 03:01
73 million to 73.5 million to 2^63 DJones Lone Mersenne Hunters 7 2007-08-01 08:30
76 million to 76.5 million to 2^63 DJones Lone Mersenne Hunters 5 2007-03-31 19:06
GIMPS Credit for Exponents Between 79.3 Million and 596 Million jinydu Lounge 25 2006-12-22 10:54

All times are UTC. The time now is 22:08.

Sun Jul 12 22:08:37 UTC 2020 up 109 days, 19:41, 1 user, load averages: 1.22, 1.48, 1.44

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.