mersenneforum.org Happy weekend for Five or Bust project
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2021-08-23, 15:08 #1 Raydex   Nov 2020 Massachusetts, USA 52 Posts Happy weekend for Five or Bust project On Saturday, August 21, the Five or Bust project has reached a new milestone in the quest to find a prime for the multiplier k = 22699. https://www.primegrid.com/stats_sob_llr.php 22699 has become the first of the five multipliers to exceed an exponent of 35 million (35,000,000). In fact, it is now considerably far above 35 million while the other four are still in the 34****** range. The exponent as of late is 35,438,302, more than 500,000 numbers higher than the next highest exponent: 34,898,787 for k = 67607. It has been nearly five years (half a decade) since the discovery of a prime number for k = 10223 on Halloween of 2016, but let's keep working to (hopefully) find primes for the remaining five. If found, it will make history as it will be the first non-Mersenne prime number with over 10 million digits to be discovered. On this day in 2008, the Mersenne prime M(43112609) became our first known 10 million digit prime and its discoverer won an award for it when the prime was verified and made public in September of that year. As that prime enters its teen years today, let's do like we do any other day: to keep the spirit alive in finding the Proth primes for the remaining five multipliers!
 2021-08-27, 10:12 #2 bur     Aug 2020 79*6581e-4;3*2539e-3 5×97 Posts With the mix of exponentially decreasing prime density and exponentially increasing computation times I guess the project will still be running in 2040. The question is, what'll be first, the next Mersenne prime or the next k eliminated from Five or Bust? Another project with a chance of finding a 10,000,000+ digit prime is the generalized fermat search at Primegrid. b^2^21 has a leading edge b of 703,000, i.e. more than 12,000,000 digits. Not to mention the b^2^22 search with b of around 940,000 that - with more than 25,000,000 digits - would yield the largest known prime if successfull. That's a big if though.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post scan80269 Information & Answers 3 2019-07-31 06:11 masser GPU Computing 17 2016-11-15 01:55 hhh Lounge 1 2008-10-10 15:26 ltd Prime Sierpinski Project 31 2006-04-19 21:30 R.D. Silverman Factoring 11 2005-10-12 15:30

All times are UTC. The time now is 05:22.

Sun Jan 23 05:22:16 UTC 2022 up 183 days, 23:51, 0 users, load averages: 1.86, 1.86, 1.71

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.

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