mersenneforum.org  

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

Reply
 
Thread Tools
Old 2019-01-03, 11:00   #1
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2×47×109 Posts
Default 2019 project goals

Below are some goals for 2019 that CRUS can go for:

1. Prove 5 bases; completed 2019/06/25!

2. Search all bases with 1 k remaining (at n=200K) to n>=400K;completed 2019/10/23!

3. Search all bases with <= 5 k's remaining (at n=100K) to n>=200K; completed 2019/10/22!

4. Complete all bases with conjectured k < 100K to n=25K; completed 2019/07/22!

If anyone has any that they would like to add, please feel free to post your thoughts.

I'm confident that we can accomplish many or all of these goals. Any and all help is appreciated!

Last fiddled with by gd_barnes on 2019-10-23 at 19:54 Reason: update counts
gd_barnes is offline   Reply With Quote
Old 2019-01-03, 11:05   #2
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

240068 Posts
Default

Here are some 2019 top-5000 primes goals proposed by Masser in the 2018 thread that we can shoot for:

100 top 3000 primes in 2019; completed 2019/12/07!
20 top 1000 primes in 2019; completed 2019/08/26!
5 top 200 primes in 2019; 3 primes to go.

Last fiddled with by gd_barnes on 2019-12-07 at 21:11 Reason: update counts
gd_barnes is offline   Reply With Quote
Old 2019-06-26, 19:25   #3
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

280616 Posts
Default

With the proof of S780, that makes 5 proofs for 2019. Goal #1 has now been completed!
gd_barnes is offline   Reply With Quote
Old 2019-06-27, 05:41   #4
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

101010100012 Posts
Default

S743 is also proven :)


https://primes.utm.edu/primes/page.php?id=126594


10 * 743285478+1
pepi37 is offline   Reply With Quote
Old 2019-06-27, 06:23   #5
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

895810 Posts
Default

Quote:
Originally Posted by pepi37 View Post
10 * 743285478+1
grrr... again? change that keyboard, man!
your XOR operator does not work
LaurV is online now   Reply With Quote
Old 2019-06-27, 07:52   #6
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2·47·109 Posts
Default

Quote:
Originally Posted by pepi37 View Post
S743 is also proven :)


https://primes.utm.edu/primes/page.php?id=126594


10 * 743285478+1
Pepi,

Hmm... 10 * 743285478+1 = 11*41*1831*9001

Surely you are mistaken.

Please use the exponentiation symbol.

In all seriousness, it is more appropriate to allow people to post their own top-5000 primes first in the forum, especially if it involves a proof. Otherwise you are stealing their thunder.

Last fiddled with by gd_barnes on 2019-06-27 at 08:04
gd_barnes is offline   Reply With Quote
Old 2019-06-27, 08:45   #7
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

1,361 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
Pepi,

Hmm... 10 * 743285478+1 = 11*41*1831*9001

Surely you are mistaken.

Please use the exponentiation symbol.

In all seriousness, it is more appropriate to allow people to post their own top-5000 primes first in the forum, especially if it involves a proof. Otherwise you are stealing their thunder.
Will not heapen again 🙄
pepi37 is offline   Reply With Quote
Old 2019-06-28, 01:44   #8
sweety439
 
sweety439's Avatar
 
Nov 2016

22×3×211 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
Below are some goals for 2019 that CRUS can go for:

1. Prove 5 bases; completed 2019/06/25!

2. Search all bases with 1 k remaining (at n=200K) to n>=400K; 16 bases to go.

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

4. Complete all bases with conjectured k < 100K to n=25K; 1 base to go.

If anyone has any that they would like to add, please feel free to post your thoughts.

I'm confident that we can accomplish many or all of these goals. Any and all help is appreciated!
5. Search all bases with <= 600 k's remaining (at n=25K) to n>=100K;

6. Search all bases with 1 k remaining and this k is <= 12 to n>=1M;

7. Search all bases <= 300 with <= 25 k's remaining (at n=100K) to n>=200K.

Last fiddled with by sweety439 on 2019-06-28 at 01:48
sweety439 is offline   Reply With Quote
Old 2019-06-28, 08:45   #9
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2×47×109 Posts
Default

Quote:
Originally Posted by sweety439 View Post
5. Search all bases with <= 600 k's remaining (at n=25K) to n>=100K;

6. Search all bases with 1 k remaining and this k is <= 12 to n>=1M;

7. Search all bases <= 300 with <= 25 k's remaining (at n=100K) to n>=200K.

Reasonable. Will be considered for 2020 goals.
gd_barnes is offline   Reply With Quote
Old 2019-07-22, 22:55   #10
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2×47×109 Posts
Default

With the completion of S1018 to n=25K, goal #4 has been accomplished!
gd_barnes is offline   Reply With Quote
Old 2019-08-03, 15:19   #11
sweety439
 
sweety439's Avatar
 
Nov 2016

22×3×211 Posts
Default

Complete all bases with conjectured k <= 200K to n=25K;

Complete all bases with conjectured k <= 250K to n=10K;
sweety439 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
January 2019 Xyzzy Puzzles 74 2019-04-09 13:34
2018 project goals gd_barnes Conjectures 'R Us 24 2019-01-03 09:47
2019 Coding Challenge miroslavkures Number Theory Discussion Group 2 2018-12-27 08:59
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 05:13.

Thu Dec 3 05:13:12 UTC 2020 up 1:24, 0 users, load averages: 1.29, 1.34, 1.30

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.