20091116, 01:36  #34 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10011101101001_{2} Posts 
Reserving Riesel 1019 to 50K, and Riesel 1021 to 40K.
Last fiddled with by gd_barnes on 20100118 at 12:53 Reason: remove base <= 500 
20091122, 23:54  #35 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3^{2}×19×59 Posts 
Riesel base 704 is proven
A big fish. (176,647 digits)
2*704^620341 is 3PRP! (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^620341 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) Special modular reduction using FFT length 48K on 2*704^620341 N+1: 2*704^620341 15000/586809 mro=0.052734375... ...a few hours later will submit to Top5000. 
20091123, 12:24  #36 
"Gary"
May 2007
Overland Park, KS
10111100000110_{2} Posts 
Congratulations on a large proof Serge!

20091125, 23:32  #37 
Jan 2009
Ireland
BA_{16} Posts 
doing some work on riesel base 1017 at the minute conjectured k is 900.
Last fiddled with by gd_barnes on 20100118 at 12:59 Reason: remove base <= 500 
20091126, 00:49  #38 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3^{2}·19·59 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. 
20091127, 20:20  #39  
Mar 2006
Germany
13×233 Posts 
Quote:


20091128, 05:22  #40 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3^{2}·19·59 Posts 
Riesel Base 1002 is proven with conj. k=237.
Primes are attached. 
20091201, 11:36  #41  
"Gary"
May 2007
Overland Park, KS
2×13×463 Posts 
Quote:
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 20091201 at 11:37 

20091206, 11:42  #42 
Jan 2006
Hungary
2^{2}·67 Posts 
Riesel base 1000 proven
Hi all,
The riesel conjecture 12 for base 1000 is proven. k = 1, 4, 7, 10 are eliminated because 10001 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^11 3*1000^11 5*1000^11 6*1000^9981 9*1000^11 11*1000^31 Willem. 
20091208, 13:34  #43 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
11×389 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 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.) 
20091208, 14:24  #44 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
4279_{10} Posts 
Riesel base 701
Riesel Base 701
Conjectured k = 14 Found Primes: Code:
2*701^21 4*701^11 10*701^311 12*701^21 6 8 Conjecture Proven 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 251500 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  2518  20230321 22:48 
Bases 33100 reservations/statuses/primes  Siemelink  Conjectures 'R Us  1758  20230320 03:40 
Bases 101250 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1031  20230306 17:57 
Bases 632 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1420  20221230 17:20 
Riesel base 3 reservations/statuses/primes  KEP  Conjectures 'R Us  1140  20221226 17:36 