Lenstra–Pomerance–Wagstaff conjecture
OpenMersenneLPW.lenstra_pomerance_wagstaffThe Lenstra–Pomerance–Wagstaff (LPW) conjecture: the number of exponents for which is a Mersenne prime is asymptotic to as , where is the Euler–Mascheroni constant:
Equivalently, the number of Mersenne primes below is asymptotic to . The conjecture predicts about Mersenne primes per doubling of the exponent bound, and about per decimal digit of the exponent. It is open, and strictly stronger than the infinitude of Mersenne primes (the mission's goal). The heuristic originates with Gillies (1964) and Wagstaff (1983), as developed by Lenstra, Pomerance and Wagstaff.
Formalization Note. is MersenneLPW.mersenneExponentCount, built from Nat.count with the strict bound (the versus convention is asymptotically immaterial). Asymptotics.IsEquivalent Filter.atTop f g means along atTop on ; values are real, Real.logb 2 y = Real.log y / Real.log 2 with cast to (its junk value at is irrelevant along atTop), and is Real.eulerMascheroniConstant. The constant is exact, not a numerical approximation. The statement follows the FormalConjectures formalization (PR #7866).
import Mathlib import Definitions.Def_MersenneLPW_mersenneExponentCount
namespace MersenneLPW
theorem lenstra_pomerance_wagstaff :
Asymptotics.IsEquivalent Filter.atTop
(fun y => (mersenneExponentCount y : ℝ))
(fun y => Real.exp Real.eulerMascheroniConstant * Real.logb 2 y) := by sorry
end MersenneLPWConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.