20060329, 03:04  #1 
Jul 2003
wear a mask
2^{6}·3^{3} Posts 
f14 complete
The original Sierpinski and Riesel problems counted the number of primes found in intervals f_m: 2^m <= n < 2^(m+1). See:
http://www.prothsearch.net/rieselprob.html http://www.prothsearch.net/sierp.html We just completed phase 14, by testing all of our candidates past n=32768. By my count, we have 275 k values (mostly Riesels) to test up to n=65536, before we complete f15. Anyone want to conjecture how long it will take us? Anyone want to help? There's a lot of lowhanging fruit around here... 
20060330, 21:17  #2 
Jun 2003
2^{3}×643 Posts 
Probably we should think about doing it by 'n' instead of doing it by the 'k'  like SOB, RieselSieve, PSP, etc.

20060423, 16:05  #3 
Jul 2003
wear a mask
11011000000_{2} Posts 
I did some testing and came up with the following distribution for the Sierpinski numbers:
F0: 15961 F1: 20145 F2: 17679 F3: 11551 F4: 6436 F5: 3399 F6: 1861 F7: 1082 F8: 612 F9: 377 F10: 274 F11: 189 F12: 131 F13: 67 F14: 48 F15: 53 F16: 16 F17: 4 These are the number of k values that have their first prime in the F_n interval. Note, F15F17 are not complete yet. I'm going to try to come up with the corresponding Riesel distribution. Any doublechecks would be appreciated. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
6^383+1 by GNFS is complete. Thanks!  fivemack  Factoring  50  20080324 19:57 
Complete Factorization???  Khemikal796  Factoring  13  20050415 15:21 
Factoring 1.#J% complete  Peter Nelson  Software  4  20050406 00:17 
61.5 thru 62m complete to 2^60  nitro  Lone Mersenne Hunters  0  20031207 13:50 
6069M complete through 58 bits  nitro  Lone Mersenne Hunters  2  20030719 02:06 