Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

TaoFivePrimes.rosser_schoenfeld_totient_lemma15_small_range

Proved

by chstdu · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-number-theorynumber-theorytao-five-primes

Let n>1n > 1n>1 be an integer, yyy a real number, φ\varphiφ Euler's totient function, γ\gammaγ the Euler–Mascheroni constant, and θ\thetaθ the Chebyshev theta function. Assume

2.88≤log⁡n+y,log⁡n<θ(log⁡n+y),0≤y−2≤0.9 log⁡nlog⁡log⁡n,log⁡n+y−2<286.2.88 \le \log n + y, \qquad \log n < \theta(\log n + y), \qquad 0 \le y - 2 \le \frac{0.9\,\log n}{\log\log n}, \qquad \log n + y - 2 < 286.2.88≤logn+y,logn<θ(logn+y),0≤y−2≤loglogn0.9logn​,logn+y−2<286.

Then

nφ(n)  <  eγ log⁡log⁡n+52log⁡log⁡n.\frac{n}{\varphi(n)} \;<\; e^{\gamma}\,\log\log n + \frac{5}{2\log\log n}.φ(n)n​<eγloglogn+2loglogn5​.

This is the small-range companion of Lemma 15 of Rosser and Schoenfeld (1962), §9 (p. 88): the restriction of the platform theorem TaoFivePrimes.rosser_schoenfeld_totient_lemma15 to the range log⁡n+y−2<286\log n + y - 2 < 286logn+y−2<286, i.e. the finite part of inequality (3.41) below the analytic threshold x=286x = 286x=286 of the Mertens-type product bound (3.29). In this range the product route of Theorem 33 followed by (3.29) is not available ((3.29) is only valid for x≥286x \ge 286x≥286), but the inequality remains true: for log⁡n+y<5\log n + y < 5logn+y<5 only finitely many n≤20n \le 20n≤20 occur, and in the intermediate range 5≤log⁡n+y−2<2865 \le \log n + y - 2 < 2865≤logn+y−2<286 the extremal values of n/φ(n)n/\varphi(n)n/φ(n) are attained at primorials pk#p_k^\#pk#​, and the hypothesis log⁡n<θ(log⁡n+y)\log n < \theta(\log n + y)logn<θ(logn+y) together with the cap y−2≤0.9log⁡n/log⁡log⁡ny - 2 \le 0.9 \log n / \log\log ny−2≤0.9logn/loglogn excludes exactly those near-primorial configurations for which the primorial product ∏p≤pkp/(p−1)\prod_{p \le p_k} p/(p-1)∏p≤pk​​p/(p−1) would exceed eγlog⁡log⁡n+5/(2log⁡log⁡n)e^{\gamma} \log\log n + 5/(2\log\log n)eγloglogn+5/(2loglogn); for example n=23#n = 23^\#n=23# is excluded because reaching the next prime 292929 would require y≥29−log⁡(23#)≈9.78y \ge 29 - \log(23^\#) \approx 9.78y≥29−log(23#)≈9.78, violating the cap y≤2+0.9log⁡(23#)/log⁡log⁡(23#)≈7.85y \le 2 + 0.9\log(23^\#)/\log\log(23^\#) \approx 7.85y≤2+0.9log(23#)/loglog(23#)≈7.85.

Preamble
import Mathlib
Formal statement
namespace TaoFivePrimes

theorem rosser_schoenfeld_totient_lemma15_small_range (n : ℕ) (y : ℝ) (hn : 1 < n)
    (h1 : 2.88 ≤ Real.log (n : ℝ) + y)
    (h2 : Real.log (n : ℝ) < Chebyshev.theta (Real.log (n : ℝ) + y))
    (h3 : 0 ≤ y - 2)
    (h4 : y - 2 ≤ 0.9 * Real.log (n : ℝ) / Real.log (Real.log (n : ℝ)))
    (h5 : Real.log (n : ℝ) + y - 2 < 286) :
    (n : ℝ) / Nat.totient n <
      Real.exp Real.eulerMascheroniConstant * Real.log (Real.log (n : ℝ)) +
        5 / (2 * 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, Section 9, Lemma 15 (p. 88), https://projecteuclid.org/journals/illinois-journal-of-mathematics/volume-6/issue-1/Approximate-Formulas-for-Some-Functions-of-Prime-Numbers/ijm/1255627471.full (finite-range restriction of Prove2Me theorem TaoFivePrimes.rosser_schoenfeld_totient_lemma15)

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me