Reciprocal totient-square sum through five million
ProvedHelfgott.totient_reciprocal_square_sum_five_millionexplicit-boundsexponential-sumsgoldbachnumber-theoryprove2me-goldbach-20261118
Let be Euler's totient function, the number of integers from to that are relatively prime to . The finite reciprocal-square sum satisfies
This explicit arithmetic bound controls modulus weights in sieve and exponential-sum estimates.
Preamble
import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Analysis.PSeries 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_reciprocal_square_sum_five_million :
(∑ q ∈ Finset.Icc 1 5000000, (1:ℝ)/(q.totient:ℝ)^2) ≤ 4 := 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.