CoChat

Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II

Open access
Schoenfeld, Lowell · 1976 · Mathematics of Computation

The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index; none of the 14 sources its claims cite is checked for support yet.

Abstract

In this paper, bounds given in the first part of the paper are strengthened. In addition, it is shown that the interval ( x , x + x / 16597 ) contains a prime for all x ⩾ 2 , 010 , 760 ; and explicit bounds for the Chebyshev functions are given under the assumption of the Riemann hypothesis.

Overview

CoChat Summary

TL;DR

This sequel strengthens explicit bounds for the Chebyshev functions θ(x) and ψ(x), including bounds conditional on the Riemann hypothesis, and proves a prime-gap interval result. It shows that (x, x + x/16597) contains a prime for all x > 2,010,759.9 and gives improved numerical bounds for moderate and large x.

Key findings

  • Under the Riemann hypothesis, Theorem 10 gives |ψ(x)−x|, |θ(x)−x| < (1/(8π))√x(log x−2)log x for 23·10^8 < x; |ψ(x)−x| < (1/(8π))√x log²x for 73.2 < x; and |θ(x)−x| < (1/(8π))√x log²x for 599 < x. It also gives −(1/(8π))√x log²x < ψ(x)−x for 59 < x. Corollary 1 gives |π(x)−li(x)| < (√x log x)/(8π) for 2,657 < x and π(x)−li(x) < (√x log x)/(8π) for 3/2 < x.
  • Theorem 11 gives unconditional large-x bounds: with X = √(log x)/R, R = 9.645908801, and e₀(x) as defined in (7.1), |ψ(x)−x| < x e₀(x) for 17 < x, |θ(x)−x| < x e₀(x) for 101 < x, and θ(x)−x < ψ(x)−x < x e₀(x) for 1 < x. Its corollary gives sharper bounds |ψ(x)−x|, |θ(x)−x| < x e₀(x)E(x)L(v₁) for e^710 < x and < x e₀(x)M(v)L(v) for e^687 < x.
  • Theorem 12 proves that the open interval (x, x + x/16597) contains a prime for all x > 2,010,759.9; the abstract states x > 2,010,760. The paper notes this lower bound is essentially best possible because for x₁ = 2,010,759.8 the interval does not contain a prime.
  • Moderate-x results include Theorem 6*: θ(x) < 1.001093x for 0 < x; 0.998697x < θ(x) for 1,155,901 < x; ψ(x)−θ(x) < 1.001093√x + 3x^(1/3) for 0 < x; and 0.998697√x < ψ(x)−θ(x) for 121 < x. Theorem 7* gives |ψ(x)−x| < 0.0220646x/log x for 161,971 < x; −0.0220646x/log x < ψ(x)−x for 89,909 < x; |θ(x)−x| < 0.0239922x/log x for 758,711 < x; θ(x)−x < 0.0201384x/log x for 1 < x; and |ψ(x)−x|, |θ(x)−x| < 0.0077629x/log x for e^22 < x. Theorem 8* lists constants η₂ = 8.0720, η₃ = 10644, η₄ = 1.6570×10^7 for bounds involving log², log³, log⁴. A Note Added in Proof states that using Brent’s tables one can show θ(x) < x for 0 < x < 10^11, improve (5.1*) to θ(x) < 1.000081x for all x > 0, and extend (5.6b*) to all x > 1.04×10^7.

Methods

  • The paper continues the references and paragraph numbering of Rosser and Schoenfeld [11] and uses the same notation, with modifications noted in Section 8. It proves explicit inequalities for θ(x), ψ(x), π(x), and prime gaps.
  • The analysis uses analytic estimates under the Riemann hypothesis, explicit lemmas and integral/sum estimates, optimization of parameters such as m = 2, T₂, and δ, and incomplete Bessel functions. Numerical verification uses tables of zeta zeros (Lehman) and prime gaps (Brent, Appel–Rosser, D. N. Lehmer, Rosser–Walker).
  • Bounds are derived for large x and then extended to smaller ranges by combining analytic estimates with numerical tables and direct verification.

Limitations

  • The paper states that some bounds are conditional on the Riemann hypothesis (Theorem 10 and Corollaries 1–3). It also states that the recalculated table “probably does not exceed the value stipulated by Theorems 4 and 5 by more than 2 units throughout the table,” and that further improvements might be possible by introducing additional b values in 900 < b < 1950.
  • The paper notes that the T₂ of (3.36) is about 50% too large and should not have been used in calculating the last three entries in the table on page 267 of the main part of the paper; it also notes that the choice m = 2 is optimal under the present methods.
  • Evident from the provided text: the OCR is heavily corrupted, with garbled formulas, missing symbols, and ambiguous constants/ranges in places, so some exact expressions cannot be reliably reconstructed from this text alone.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1090/s0025-5718-1976-0457374-x

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 Valid · 0 Not valid · 14 Not checked · 13 Own results and interpretations

18 more claims

Create a free account to see all 27 claims and to verify the 6 references still open.

See all claims — free account
  • Probably not a substantial claim. 2
  • It may state two separate claims as one. 2

Create a free account to see these claims.

Citations

Cites

Show all 25 references

Research works printed but not linked: 2

  1. J. P. M. BINET, "Note sur l'intégrale Jyty2'dye~p^y ^y prise entre des limites arbitraires," C. R. Acad. Sei. Paris, v. 12, 1841, pp. 958-962.
  2. J. P. GRAM, "Unders^gelser angaaende Maengen af Primtal under en given Graense," K. Danske Vidensk. Selskabs Skrifter, Naturv. og Math. Afd. ser. 6, v. 2, 1881-1886 (1884), pp. 183-308.

Cited by

See all 369

Metadata

Authors
Schoenfeld, L.
Corresponding author
Schoenfeld, Lowell
Venue
Mathematics of Computation
Published
1976
Volume
30
Issue
134
Pages
337-360
ISSN
  • 0025-5718 (ISSN-L)
  • 1088-6842
OpenAlex
W1512503533
Cited by
369
References
24
Citations by year
2026: 24 · 2025: 24 · 2024: 30 · 2023: 19 · 2022: 16 · 2021: 18 · 2020: 21 · 2019: 12 · 2018: 12 · 2017: 12 · 2016: 13 · 2015: 22 · 2014: 9 · 2013: 20 · 2012: 12
FWCI
0.47
Type
journal article
Language
en
Open access
Locations
Mathematics of Computation (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
  • Physical Sciences › Mathematics › Numerical Analysis › Mathematical Approximation and Integration
Keywords
Chebyshev function, prime counting function, prime gaps, prime number distribution, explicit bounds, Riemann hypothesis

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-11-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-11-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II. https://app.cochat.ai/papers/10.1090/s0025-5718-1976-0457374-x
The paper
Schoenfeld, L. (1976). Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1976-0457374-x

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.