Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source: published paper, printed p. 412 (PDF p. 2),
Theorem 1, identified there as Theorem 4 of Rosser–Schoenfeld (1975).
This page records an exact external input. Its analytic proof is not
reconstructed here.
Let
ψ(x)=pν≤x∑logp,F(T)=2πTlog2πT−2πT+87.
The sum has primes p and positive integers ν. Dusart uses the real
number A>2π characterized by
F(A)=1500000001.
The finite zero-verification input is that all zeros β+iγ of
ζ in the critical strip with 0<γ≤A have β=1/2,
and N(A)=1500000001. This is imported from the computations cited as
[1] and [3], described precisely in External estimates.
It is a finite verification, not an assumption of the full Riemann hypothesis.
The numerical certificate below isolates this already specified A; it
does not establish the zero count or the locations of those zeros.
For b>1/2, a positive integer m and
0<δ<(1−e−b)/m, define
Here z>0, a≥0, and the applications of ϕm have y>17.
The function denoted R(T) here is the source's R(T);
R without an argument is its separate numerical constant.
All displayed decimal constants are treated as the exact rational constants
of the stated estimate. The analytic justification of (4), including its
zero-free-region estimates, remains external. The source's numerical
specialization is independently completed at Theorem 2.