Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser–Schoenfeld's totient bound: analytic range e294≤ne^{294} \le ne294≤n

Open
TaoFivePrimes.rosser_schoenfeld_totient_large

by andreaskapfer · 1 vote · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes

Let φ\varphiφ be Euler's totient function and γ\gammaγ the Euler–Mascheroni constant. For every integer n≥e294n \ge e^{294}n≥e294,

nφ(n)  <  eγ log⁡log⁡n  +  2.50637log⁡log⁡n.\frac{n}{\varphi(n)} \;<\; e^{\gamma}\,\log\log n \;+\; \frac{2.50637}{\log\log n}.φ(n)n​<eγloglogn+loglogn2.50637​.

This is the analytic-range half of Theorem 15 of Rosser and Schoenfeld (1962). In §9, for log⁡n≥294\log n \ge 294logn≥294 (the argument in fact applies from log⁡n>255\log n > 255logn>255), Lemma 15 combines Theorem 33 with the explicit Mertens product estimate (3.29) of §8 and the Chebyshev bounds for θ\thetaθ (Theorem 19, inequality (3.14)) to establish n/φ(n)<eγlog⁡log⁡n+52log⁡log⁡nn/\varphi(n) < e^{\gamma}\log\log n + \frac{5}{2\log\log n}n/φ(n)<eγloglogn+2loglogn5​. Since 5/2<2.506375/2 < 2.506375/2<2.50637, this yields the displayed uniform constant. Together with the finite range 3≤n<e2943 \le n < e^{294}3≤n<e294 (handled by Lemma 14 and numerical verification) this forms the complete proof of Theorem 15.

Formalization note: Nat.totient is Mathlib's totient function coerced to R\mathbb{R}R, Real.eulerMascheroniConstant is γ\gammaγ, and e294e^{294}e294 enters the hypothesis as Real.exp 294 \u2264 (n : \u211d).

Preamble
import Mathlib.Data.Nat.Totient
import Mathlib.NumberTheory.Harmonic.EulerMascheroni
Formal statement
namespace TaoFivePrimes

theorem rosser_schoenfeld_totient_large (n : ℕ) (hn : 3 ≤ n)
    (hlarge : Real.exp 294 ≤ (n : ℝ)) :
    (n : ℝ) / Nat.totient n <
      Real.exp Real.eulerMascheroniConstant * Real.log (Real.log (n : ℝ)) +
        2.50637 / Real.log (Real.log (n : ℝ)) := by sorry

end TaoFivePrimes
Source
J.B. Rosser, L. Schoenfeld, *Approximate formulas for some functions of prime numbers*, Illinois Journal of Mathematics 6 (1962), 64–94, https://projecteuclid.org/journals/illinois-journal-of-mathematics/volume-6/issue-1/Approximate-formulas-for-some-functions-of-prime-numbers/10.1215/ijm/1255631807.full, Theorem 15, p. 72, eqs. (3.41)–(3.42); finite range: Lemma 14 and §9, pp. 88–89; analytic range: Lemma 15, Theorem 33, §8 eq. (3.29), Theorem 19 and (3.14); used in T. Tao, *Every odd number greater than 1 is the sum of at most five primes*, arXiv:1201.6656, proof of Proposition 4.10.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me