mersenneforum.org Bases 501-1030 reservations/statuses/primes
 Register FAQ Search Today's Posts Mark Forums Read

 2009-11-16, 01:36 #34 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 47·197 Posts Reserving Riesel 1019 to 50K, and Riesel 1021 to 40K. Last fiddled with by gd_barnes on 2010-01-18 at 12:53 Reason: remove base <= 500
 2009-11-22, 23:54 #35 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 100100001010112 Posts Riesel base 704 is proven A big fish. (176,647 digits) 2*704^62034-1 is 3-PRP! (605.8170s+0.0069s) Done. PFGW Version 20090928.Win_Dev (Beta 'caveat utilitor') [GWNUM 25.13] Output logging to file ../BR704a.txt No factoring at all, not even trivial division Primality testing 2*704^62034-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) Special modular reduction using FFT length 48K on 2*704^62034-1 N+1: 2*704^62034-1 15000/586809 mro=0.052734375... ...a few hours later will submit to Top5000.
 2009-11-23, 12:24 #36 gd_barnes     May 2007 Kansas; USA 1027910 Posts Congratulations on a large proof Serge!
 2009-11-25, 23:32 #37 Dougal     Jan 2009 Ireland 2×3×31 Posts doing some work on riesel base 1017 at the minute conjectured k is 900. Last fiddled with by gd_barnes on 2010-01-18 at 12:59 Reason: remove base <= 500
 2009-11-26, 00:49 #38 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 925910 Posts I took Sierp. base 1002 (conj. k=1240) and apart from GFNs at k=1 and k=base, there are 10 k's left at 9.8K: 152 154 171 409 448 492 613 707 917 1106 I'll make a "Chris"-like zip file for every base, Gary, sometime this weekend.
2009-11-27, 20:20   #39
kar_bon

Mar 2006
Germany

2×1,433 Posts

Quote:
 Originally Posted by gd_barnes Edit: There is only one such Riesel base <= 1024 remaining to be proven. The highest one: base 1019, which has currently been tested to n=25K. So there you go Karsten...another possible one to prove. Doing so would prove all Riesel bases <= 1024 where b==(29 mod 30). :-)
k=2 for Riesel Base 1019 at n=63.4k and continuing!

2009-11-28, 05:22   #40
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

47×197 Posts

Riesel Base 1002 is proven with conj. k=237.
Primes are attached.
Attached Files
 R1002_primes.zip (676 Bytes, 267 views)

2009-12-01, 11:36   #41
gd_barnes

May 2007
Kansas; USA

19×541 Posts

Quote:
 Originally Posted by Batalov I took Sierp. base 1002 (conj. k=1240) and apart from GFNs at k=1 and k=base, there are 10 k's left at 9.8K: 152 154 171 409 448 492 613 707 917 1106 I'll make a "Chris"-like zip file for every base, Gary, sometime this weekend.
Serge,

This is a tremendous number of new bases and I have to check them all and subsequently update the pages, which I'm close to finishing now. The problem that I'm having is that I make it a rule to not list k's remaining until I can balance them; that is I have all of the primes. What I must have is a listing of the primes for n>2500 (preferrably n>1000). The biggest problem are the ones like the above where you're listing no primes or only primes for n>5000 (or 7000 or 10000). For those, I have to ignore them on the pages or make a note to myself to follow up on them. I have spare cores on a slower machine and can fairly quickly use it to test to n=2500 without sieving. But to test to n=5000 or 10000 to get that complete listing would require that I stop other efforts, sieve, and then test...too much personal time and CPU resources.

It would really help me out if you would post primes n>2500 and k's remaining at the same time. Otherwise I have to update the pages twice or just ignore the 1st posting of k's remaining, which means someone else may end up testing a base that you have already started on.

For now, I'm going to list what I can on the pages with a note to myself to follow up on primes needed for n=2500 to (the lower limit of what you're listing shows). In the future, I won't show them at all until I get the n>2500 primes, which means a base or two could get missed.

Thanks,
Gary

Last fiddled with by gd_barnes on 2009-12-01 at 11:37

 2009-12-06, 11:42 #42 Siemelink     Jan 2006 Hungary 1000011002 Posts Riesel base 1000 proven Hi all, The riesel conjecture 12 for base 1000 is proven. k = 1, 4, 7, 10 are eliminated because 1000-1 has 3 as a factor. k = 8 can be eliminated because All k = m^3 for all n; factors to (m*10^n - 1) *(m^2*100^n + m*10^n + 1) ( I stole this from base 27) That leaves these primes: 2*1000^1-1 3*1000^1-1 5*1000^1-1 6*1000^998-1 9*1000^1-1 11*1000^3-1 Willem.
 2009-12-08, 13:34 #43 Mini-Geek Account Deleted     "Tim Sorbera" Aug 2006 San Antonio, TX USA 17·251 Posts Sierp base 1000 Sierp Base 1000 Conjectured k = 12 Found Primes: Code: 3*1000^1+1 4*1000^1+1 6*1000^3+1 7*1000^1+1 9*1000^1+1 Remaining k's: Tested to n=10K 10*1000^n+1 Trivial Factor Eliminations: 2 5 8 11 GFN Eliminations: 1 Base Released (If k=10 can be eliminated for some algebraic/trivial reason, I don't see why. The automatic PFGW script didn't eliminate it and it's not a cube. It is equivalent to 10^(3*n+1)+1, but I don't know if that implies anything terribly interesting.)
 2009-12-08, 14:24 #44 Mini-Geek Account Deleted     "Tim Sorbera" Aug 2006 San Antonio, TX USA 17×251 Posts Riesel base 701 Riesel Base 701 Conjectured k = 14 Found Primes: Code: 2*701^2-1 4*701^1-1 10*701^31-1 12*701^2-1 Trivial Factor Eliminations: 6 8 Conjecture Proven

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 879 2021-01-17 07:30 gd_barnes Conjectures 'R Us 2237 2021-01-15 17:45 gd_barnes Conjectures 'R Us 1425 2021-01-14 09:49 KEP Conjectures 'R Us 1068 2021-01-13 18:09 Siemelink Conjectures 'R Us 1673 2020-11-18 12:14

All times are UTC. The time now is 14:44.

Wed Jan 20 14:44:23 UTC 2021 up 48 days, 10:55, 0 users, load averages: 3.41, 3.41, 3.68

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.