mersenneforum.org  

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

Reply
 
Thread Tools
Old 2019-10-26, 17:44   #23
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

17518 Posts
Default

Here is 2 suggestions:

Proving 6 Riesel conjectures with a conjectured k<=100 (There is currently 78 such conjectures remaining to be proven, of those 56 has 1 k remaining, 9 has 2 k remaining, 4 has 3 k remaining, 8 has 4 k remaining and 1 has 5 k's remaining)

Proving 6 Sierpinski conjectures with a conjectured k<=100 (There is currently 91 such conjectures remaining to be proven, of those 57 has 1 k remaining, 17 has 2 k remaining, 9 has 3 k remaining, 5 has 4 k remaining, 2 has 5 k remaining and 1 has 9 k´s remaining)

These 169 bases are mostly held up by 1 k conjectures and with the work done by YOYO and SRBASE, it should be possible to reach at least one of the goals - if not both

Take care.
KEP is offline   Reply With Quote
Old 2019-12-07, 21:12   #24
gd_barnes
 
gd_barnes's Avatar
 
"Gary"
May 2007
Overland Park, KS

101111101000102 Posts
Default

After a tremendous run of primes by BOINC in the last 1-2 months, goal #1 in the second post has been accomplished. We are now at > 100 top-3000 primes for 2019. Congrats to all!
gd_barnes 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 22:18.


Tue Jun 6 22:18:23 UTC 2023 up 292 days, 19:46, 0 users, load averages: 0.91, 1.12, 1.08

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

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