mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2007-10-14, 08:08   #12
Jens K Andersen
 
Jens K Andersen's Avatar
 
Feb 2006
Denmark

23010 Posts
Default

190927*2^72289-1 is prime, written earlier.
173587*2^172609-1 is prime.
112391 reserved by me now.
Jens K Andersen is offline   Reply With Quote
Old 2007-10-14, 14:39   #13
Jens K Andersen
 
Jens K Andersen's Avatar
 
Feb 2006
Denmark

111001102 Posts
Default

112391*2^159730-1 is prime! Time : 40.493 sec.

I'm reserving 239107. All 4 remaining k's are now reserved.
Jens K Andersen is offline   Reply With Quote
Old 2007-10-14, 19:38   #14
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3·7·167 Posts
Default update

17861 (17861*2^98954-1 is prime! Time : 23.000 sec. by jasong)
23651 (23651*2^237506-1 is prime! Time : 167.859 sec.) found by jasong
77167 (77167*2^153441-1 is prime! Time : 34.146 sec.) found by jasong
170467 (170467*2^55273-1 is prime. by Jens K Andersen)
173587 (173587*2^172609-1 is prime.) found by Jens K Andersen
175567 reserved by jasong
190927 (190927*2^72289-1 is prime.) found by Jens K Andersen
112391 112391 reserved by Jens K Andersen
239107 reserved by Jens K Andersen.

testing begins at n=85,000 and continues to n=500,000.

Last fiddled with by jasong on 2007-10-14 at 19:38
jasong is offline   Reply With Quote
Old 2007-10-14, 22:26   #15
Jens K Andersen
 
Jens K Andersen's Avatar
 
Feb 2006
Denmark

2×5×23 Posts
Default

Great!
I wrote earlier that 112391*2^159730-1 is prime so we are down to 2 k's. Unfortunately one of them is the expected hardest: 239107 which has quickly growing candidates and is currently tested to 244000. I estimate less than 50% chance it has a prime below 1,000,000 digits.
175567 looks much more promising.
Jens K Andersen is offline   Reply With Quote
Old 2007-10-15, 03:24   #16
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3×7×167 Posts
Default

Quote:
Originally Posted by Jens K Andersen View Post
Great!
I wrote earlier that 112391*2^159730-1 is prime so we are down to 2 k's. Unfortunately one of them is the expected hardest: 239107 which has quickly growing candidates and is currently tested to 244000. I estimate less than 50% chance it has a prime below 1,000,000 digits.
175567 looks much more promising.
Only 2 to go. That's fantastic.

I like to jump from project to project, and because I'm very impulsive, I reserved work in another project before I remembered my k. 175567*2^187425-1 is as far as I got. If anybody wants it, I'm unreserving it.

This project looks like it might be completed fairly quickly. Then, again, one or both of the remaining ks may prove to be very, very stubborn.
jasong is offline   Reply With Quote
Old 2007-10-17, 21:10   #17
Jens K Andersen
 
Jens K Andersen's Avatar
 
Feb 2006
Denmark

2·5·23 Posts
Default

239107 gave no prime to 500000.
Reserving 175567 from 187425 to 500000.
Jens K Andersen is offline   Reply With Quote
Old 2007-10-18, 23:32   #18
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

DB316 Posts
Default

If anybody decides to sieve above n=500,000 please both check here to see if anybody else has beaten you to it, and be sure to post your intentions either before you start, or at least within hours of starting.
jasong is offline   Reply With Quote
Old 2007-10-24, 18:43   #19
Jens K Andersen
 
Jens K Andersen's Avatar
 
Feb 2006
Denmark

2×5×23 Posts
Default

175567 gave no prime to 500000.
175567 and 239107 have not been sieved above n=500,000.
I have stopped working on this project.
The following is a summary of the search so far.

Consider k values for which k*2^n-1 is composite for all n>0.
Odd such k are called Riesel numbers.
The goal of the Riesel problem is to find the smallest Riesel number.
The goal of our project is to prove that there is no even k below the smallest Riesel number, whatever it is. The smallest known is 509203.

The following PARI/GP script identifies odd k values which have an even multiple of form k*2^m that is a potential solution below the smallest Riesel number.
It first eliminates odd k which have no prime of form k*2^n-1 below 509203, because if any k*2^m below 509203 for such a k is a solution then k would itself be a Riesel number.
Second it eliminates k which give a prime between 509203 and k*2^1000-1.
The 61 remaining k values are printed.

? R=509203;L=1000;
? forstep(k=1,R,2,c=0;n=1;\
while(k*2^n<R,c+=isprime(k*2^n-1);n++);if(c,\
while(n<=L && !isprime(k*2^n-1),n++);\
if(n>L,print1(k", "))))
37, 337, 1589, 1721, 1807, 2257, 2317, 2683, 3775, 5857, 6869, 10021, 11887,
12401, 17861, 18089, 23651, 24161, 31453, 31841, 32257, 33373, 39817, 43151,
46411, 47653, 55687, 58331, 63367, 67001, 74857, 77167, 79601, 80771, 88115,
90907, 112391, 114367, 115451, 116257, 118447, 120457, 120997, 121061,
122017, 135787, 170467, 173467, 173587, 175567, 179677, 185347, 190357,
190927, 207397, 209737, 230407, 230827, 233221, 239107, 246787,

A prime has been found for 59 of the k values:
37*2^2553-1
337*2^11677-1
1589*2^1620-1
1721*2^1034-1
1807*2^1369-1
2257*2^1297-1
2317*2^2805-1
2683*2^2239-1
3775*2^1297-1
5857*2^4973-1
6869*2^45084-1
10021*2^1835-1
11887*2^1189-1
12401*2^26522-1
17861*2^98954-1
18089*2^1124-1
23651*2^237506-1
24161*2^8570-1
31453*2^1371-1
31841*2^1010-1
32257*2^1985-1
33373*2^5283-1
39817*2^1801-1
43151*2^23286-1
46411*2^2027-1
47653*2^1083-1
55687*2^1597-1
58331*2^1506-1
63367*2^1129-1
67001*2^9506-1
74857*2^1121-1
77167*2^153441-1
79601*2^3542-1
80771*2^9482-1
88115*2^2468-1
90907*2^4689-1
112391*2^159730-1
114367*2^1681-1
115451*2^6218-1
116257*2^1045-1
118447*2^14473-1
120457*2^1261-1
120997*2^2121-1
121061*2^2338-1
122017*2^1257-1
135787*2^7721-1
170467*2^55273-1
173467*2^6925-1
173587*2^172609-1
179677*2^2729-1
185347*2^1189-1
190357*2^15465-1
190927*2^72289-1
207397*2^5609-1
209737*2^1313-1
230407*2^1105-1
230827*2^4177-1
233221*2^1021-1
246787*2^1081-1

Used programs: PARI/GP, PrimeForm/GW, srsieve, LLR.
jasong found 17861*2^98954-1, 23651*2^237506-1, 77167*2^153441-1.
The largest found prime is 23651*2^237506-1.
Jens K Andersen is offline   Reply With Quote
Old 2007-10-24, 22:56   #20
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3×7×167 Posts
Default Reserving k=239107 and 175567 for sieving

Reserving 239107 and 175567 for sieving.

I'll be sieving for n=500K-2,500K.

I'll sieve each to a billion. Then, as soon as I figure out how to combine the files, I'll use sr2sieve to sieve higher.
jasong is offline   Reply With Quote
Old 2007-10-29, 21:58   #21
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

1101101100112 Posts
Default

I'm unreserving the numbers and posting the sieve file.

Edit by Max (8/30/09): Cleaned up attachment as the sieve file is now available on the Conjectures 'R Us web site. (See the "Riesel Conjecture Reservations" page, under base 2.)

Last fiddled with by mdettweiler on 2009-08-30 at 19:37
jasong is offline   Reply With Quote
Old 2007-11-14, 14:56   #22
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

B5B16 Posts
Default

i inserted all k's mentioned here with their available data in the data-pages of www.15k.org. the next update of these pages will be end november and then all k's are available there. so if anyone has some more infos for me (higher n values search -> more primes) i can insert them too. perhaps i push some k to higher n.
kar_bon is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Untested Riesel conjectures sorted by conjecture rogue Conjectures 'R Us 36 2018-01-03 19:53
Riesel Base 5 LLR em99010pepe Sierpinski/Riesel Base 5 8 2010-06-08 21:21
Riesel primes Primeinator Information & Answers 12 2009-07-19 23:30
even ks and the Riesel Conjecture jasong Programming 11 2007-10-15 20:48
Question about Riesel and Sierpinski conjecture. jasong Information & Answers 1 2006-10-06 06:17

All times are UTC. The time now is 09:09.


Tue Jul 27 09:09:47 UTC 2021 up 4 days, 3:38, 0 users, load averages: 1.38, 1.51, 1.53

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.