Totient ratio at most 17017/3072 through five million
ProvedHelfgott.totient_ratio_le_17017_div_3072explicit-boundsexponential-sumsgoldbachnumber-theoryprove2me-goldbach-20261118
Let be Euler's totient function. Every positive integer with satisfies
This explicit arithmetic bound controls modulus weights in sieve and exponential-sum estimates.
Preamble
import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Analysis.SpecialFunctions.Log.Monotone import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Data.Nat.Totient import Mathlib.Tactic open Finset open scoped BigOperators
Formal statement
theorem Helfgott.totient_ratio_le_17017_div_3072 (q : ℕ) (hq : 0<q) (hmax : q≤5000000) :
(q:ℝ)/(q.totient:ℝ)≤(17017/3072:ℝ) := by sorrySource
Original formalization for the Prove2Me Weak Goldbach project; elementary totient estimates, not a claim of new mathematics. Exact supporting source files and SHA256 hashes are embedded in the solution. No unproved project imports are used.