mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2020-01-13, 01:14   #1
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

100111110000002 Posts
Default 2020 project goals

Below are some goals for 2020 that CRUS can shoot for:

1. Prove 5 bases; 5 bases to go.

2. Search all bases with 2 k remaining (at n<300K) to n>=300K; 23 bases to go.

3. Search all bases with <= 8 k's remaining (at n<200K) to n>=200K; 16 bases to go.

4. Complete all bases <= 4000 k's remaining (at n=2500) to n>=10K; 2 bases to go.

5. Complete all bases with difficulty < 25000* to difficulty >= 25000; 8 bases to go.
[Many will overlap with goals 2 & 3]

6. Find 100 top 3000 primes; 49 primes to go.

7. Find 25 top 1000 primes; 14 primes to go.

8. Find 5 top 500 primes; completed 2020/06/17!

* - As shown on the unproven conjectures page here:
www.noprimeleftbehind.net/crus/vstats_new/crus-unproven.htm

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 2020-08-09 at 08:37 Reason: update counts
gd_barnes is offline   Reply With Quote
Old 2020-06-18, 08:33   #2
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

26×3×53 Posts
Default

Goal #8 has been completed!
gd_barnes is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
January 2020 what Puzzles 21 2020-02-02 14:11
2019 project goals gd_barnes Conjectures 'R Us 23 2019-12-07 21:12
2018 project goals gd_barnes Conjectures 'R Us 24 2019-01-03 09:47
Goals of the project em99010pepe Octoproth Search 10 2007-01-28 12:34
Project Goals (Octoproth and Dodecaproth) Greenbank Octoproth Search 11 2006-01-19 11:42

All times are UTC. The time now is 23:39.

Fri Aug 14 23:39:41 UTC 2020 up 1 day, 20:15, 0 users, load averages: 0.94, 1.17, 1.21

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

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.