mersenneforum.org 2021 project goals
 Register FAQ Search Today's Posts Mark Forums Read

 2020-12-29, 00:17 #1 gd_barnes     May 2007 Kansas; USA 293516 Posts 2021 project goals Below are some goals for 2021 that CRUS can aim for: 1. Prove 3 bases; 3/3 bases proven; completed on 2021/07/27! 2. Search all bases with 3 k remaining (at n<300K) to n>=300K; 13/13 bases completed on 2021/07/11! 3. Search all bases with <= 10 k's remaining (at n<200K) to n>=200K; 25/25 bases completed on 2021/08/15! 4. Complete all Riesel/Sierp base 2/4 odd/even k's and n's to n=8M base 2. 1.35M/1.35M n-range completed on 2021/11/21! 5. Complete all k's on base R3 to n>=100K; 31G/33G k-range completed. 6. Find 60 top 3000 primes; 60/60 primes found; completed on 2021/08/07! 7. Find 15 top 1000 primes; 8/15 primes found. 8. Find 4 top 500 primes; 4/4 primes found; completed on 2021/07/27! I have lowered the goals on several categories due to the amount of effort required for Goal #5. I'm confident that we can accomplish most or all of these goals. All help is greatly appreciated! Last fiddled with by gd_barnes on 2021-11-27 at 07:30 Reason: update counts
 2021-01-01, 20:59 #2 gd_barnes     May 2007 Kansas; USA 1054910 Posts Posts about sieving R3 moved to the "sieving for CRUS" thread.
 2021-01-03, 11:39 #3 gd_barnes     May 2007 Kansas; USA 101001001101012 Posts I added another goal: #4, after Reb agreed to have BOINC work on it. That will be the last change. Last fiddled with by gd_barnes on 2021-01-03 at 11:42
 2021-05-20, 16:14 #4 rogue     "Mark" Apr 2003 Between here and the 22×5×17×19 Posts For goal #5 that should be 10G of 33G completed. It appears that #3 and #5 are going to be the most difficult to accomplish by the end of the year. Last fiddled with by rogue on 2021-05-20 at 16:17
2021-05-20, 18:53   #5
rebirther

Sep 2011
Germany

302110 Posts

Quote:
 Originally Posted by rogue For goal #5 that should be 10G of 33G completed. It appears that #3 and #5 are going to be the most difficult to accomplish by the end of the year.

Goal #3 should be no problem if we have the sieve files.

2021-05-20, 19:20   #6
gd_barnes

May 2007
Kansas; USA

7×11×137 Posts

Quote:
 Originally Posted by rogue For goal #5 that should be 10G of 33G completed. It appears that #3 and #5 are going to be the most difficult to accomplish by the end of the year.
Updated. Actually Goal 4 will be by far the most difficult. It is unlikely to finish although I will throw many of my machines at it for awhile later in the year to give it a reasonable shot.

Goal 3...no problem at all. All sieve files are in the works and each base isn't much work for BOINC. Goal 5 is a little tough but doable.

I set the goals high to see what we can pull off.

Last fiddled with by gd_barnes on 2021-05-20 at 19:23

 2021-06-04, 03:29 #7 gd_barnes     May 2007 Kansas; USA 7×11×137 Posts With Pepi's recent large-prime proof of R650 that leaves us just one away from completing goals 1 and 8. :-)
 2021-07-11, 19:46 #8 gd_barnes     May 2007 Kansas; USA 7×11×137 Posts Goal #2 has been completed!
 2021-07-27, 19:55 #9 gd_barnes     May 2007 Kansas; USA 101001001101012 Posts With the proof of S470, goals 1 & 8 have been completed!
 2021-08-07, 07:51 #10 gd_barnes     May 2007 Kansas; USA 1054910 Posts Goal #6 has been completed!
 2021-08-15, 19:53 #11 gd_barnes     May 2007 Kansas; USA 7·11·137 Posts Goal #3 has been completed!

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 14 2020-12-30 15:58 gd_barnes Conjectures 'R Us 23 2019-12-07 21:12 gd_barnes Conjectures 'R Us 24 2019-01-03 09:47 em99010pepe Octoproth Search 10 2007-01-28 12:34 Greenbank Octoproth Search 11 2006-01-19 11:42

All times are UTC. The time now is 01:54.

Mon Nov 29 01:54:41 UTC 2021 up 128 days, 20:23, 0 users, load averages: 1.21, 1.18, 1.17

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.