mersenneforum.org  

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

Reply
 
Thread Tools
Old 2022-11-23, 19:01   #1
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

3·2,269 Posts
Unhappy Potential 2023 Project Goals

Bass upon 2022 project goals, I have some ideas for 2023. I am less familiar with base 2 conjectures, so Gary will have to add those. I have added goals 9 thru 14 because they have millions of fast tests and will likely require coordination at the conjecture level. They might be appealing to people who want to help the project, but want to work outside of BOINC. I will contribute GPU cycles to sieving the conjectures with many thousands of k. I am already sieving (no testing) for goal 2 and will complete sieving those conjectures by the end of the year and send them to Gary when done. Of course Gary has final say on all 2023 project goals.

1. Prove 4 bases

2. Search all bases with <= 5000 k's remaining (at n=10K) to n>=25K; 36 bases

3. Search all bases with <= 20 k's remaining to n>=300K; 15 bases

4. Search all bases with 2 k's remaining to n>=500K; 29 bases

5. Search all bases < 800 with 1 k remaining to n>=600K; 35 bases

6. Find 50 top 3000 primes

7. Find 10 top 1500 primes

8. Find 5 top 500 primes

9. Search S3 to n>=50000 for k < 40e9

10. Search R3 to n>=200000 for k < 20e9

11. Search R63 to n>=50000 for k < 60e6

12. Search S63 to n>=50000 for k < 10e6

13. Search R66 to n>=50000 for k < 30e6

14. Search S66 to n>=50000
rogue is offline   Reply With Quote
Old 2022-11-25, 10:34   #2
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

70748 Posts
Default

Search all bases < 500 with 1 k remaining to n >= 1M (22 Sierpinski bases and 30 Riesel bases, totally 52 bases)

Search all 1k-remaining bases whose remain k is k = 2 or k = 4 to n = 1M

Search all bases with CK <= 25M to n >= 2.5K (11 Sierpinski bases and 9 Riesel bases, totally 20 bases)

Search all bases with CK <= 1M to n >= 10K

Search all bases with <= 1000 k remaining to n >= 100K

Search all bases <= 300 with <= 100 k remaining to n >= 200K (this is more important, since some bases such as S45 and R53, have not been updated for more then 10 years)

Complete all power-of-2 bases to n=10M base 2

Complete all bases to relative difficulty >= 50000 (7 Sierpinski bases and 12 Riesel bases, totally 19 bases)

Search SR7 and SR15:

* k <= 1G to n >= 25K
* k <= 100M to n >= 100K
* k <= 10M to n >= 300K
* k <= 1M to n >= 1M

Search the full range for SR71, SR85, SR120, SR124, SR127 to n=2.5K (possible?)

Last fiddled with by sweety439 on 2022-11-25 at 10:38
sweety439 is online now   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
2021 project goals gd_barnes Conjectures 'R Us 22 2022-01-01 07:29
2020 project goals gd_barnes Conjectures 'R Us 14 2020-12-30 15:58
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

All times are UTC. The time now is 10:55.


Fri Nov 25 10:55:38 UTC 2022 up 99 days, 8:24, 0 users, load averages: 1.10, 1.01, 0.98

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔