mersenneforum.org f14 complete
 Register FAQ Search Today's Posts Mark Forums Read

 2006-03-29, 03:04 #1 masser     Jul 2003 Behind BB 75916 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 low-hanging fruit around here...
 2006-03-30, 21:17 #2 axn     Jun 2003 14EF16 Posts Probably we should think about doing it by 'n' instead of doing it by the 'k' -- like SOB, RieselSieve, PSP, etc.
 2006-04-23, 16:05 #3 masser     Jul 2003 Behind BB 32·11·19 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, F15-F17 are not complete yet. I'm going to try to come up with the corresponding Riesel distribution. Any doublechecks would be appreciated.

 Similar Threads Thread Thread Starter Forum Replies Last Post fivemack Factoring 50 2008-03-24 19:57 Khemikal796 Factoring 13 2005-04-15 15:21 Peter Nelson Software 4 2005-04-06 00:17 nitro Lone Mersenne Hunters 0 2003-12-07 13:50 nitro Lone Mersenne Hunters 2 2003-07-19 02:06

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

Mon May 16 05:09:39 UTC 2022 up 32 days, 3:10, 0 users, load averages: 1.73, 1.54, 1.83