CoChat

Sharper bounds for the Chebyshev function 𝜃(𝑥)

Broadbent, Samuel, Kadiri, Habiba, Lumley, Allysa, Ng, Nathan, Wilk, Kirsten · 2021 · Mathematics of Computation
Cited by 34

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

In this article, we provide explicit bounds for the prime counting functions θ ( x ) for all ranges of x . The bounds for the error term for θ ( x ) − x are of the shape ε x and c k x ( log ⁡ x ) k , for k = 1 , … , 5 . Tables of values for ε and c k are provided.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1090/mcom/3643

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 42

  1. Axler, Christian, 2018, New estimates for some functions defined over primes, Integers, 18, Paper No. A52, 21
  2. S. Broadbent, A. Fiori, H. Kadiri, A. Lumley, N. Ng, J. Swidinsky, and K. Wilk, Tables of values of the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥), 41 pages, arXiv:2002.11068, 2020. · arXiv
  3. Büthe, Jan, 2016, Estimating 𝜋(𝑥) and related functions under partial RH assumptions, Math. Comp., 85, 2483, 10.1090/mcom/3060 · DOI
  4. Büthe, Jan, 2018, An analytic method for bounding 𝜓(𝑥), Math. Comp., 87, 1991, 10.1090/mcom/3264 · DOI
  5. P. L. Chebyshev, Mémoire sur les nombres premiers, J. Math. Pures Appl. 17 (1852), 366–390.
  6. Costa Pereira, N., 1985, Estimates for the Chebyshev function 𝜓(𝑥)-𝜃(𝑥), Math. Comp., 44, 211, 10.2307/2007805 · DOI · Paper page
  7. Costa Pereira, N., 1989, Elementary estimates for the Chebyshev function 𝜓(𝑥) and for the Möbius function 𝑀(𝑥), Acta Arith., 52, 307, 10.4064/aa-52-4-307-337 · doi:10.4064/aa-52-4-307-337
  8. Davenport, Harold, 2000, Multiplicative number theory, 74
  9. Saouter, Yannick, 2015, A still sharper region where 𝜋(𝑥)-𝑙𝑖(𝑥) is positive, Math. Comp., 84, 2433, 10.1090/S0025-5718-2015-02930-5 · DOI
  10. J. M. Deshouillers, Retour sur la methode de Chebyshev, Bull. Soc. Math. France 49–50 (1977), 41–45. · doi:10.24033/msmf.212
  11. Dudek, Adrian W., 2016, An explicit result for primes between cubes, Funct. Approx. Comment. Math., 55, 177, 10.7169/facm/2016.55.2.3 · doi:10.7169/facm/2016.55.2.3
  12. Dusart, Pierre, 1999, Inégalités explicites pour 𝜓(𝑋), 𝜃(𝑋), 𝜋(𝑋) et les nombres premiers, C. R. Math. Acad. Sci. Soc. R. Can., 21, 53
  13. P. Dusart, Estimates of some functions over primes without R.H., arXiv:1002.0442 (February 2, 2010). · arXiv
  14. Dusart, Pierre, 2016, Estimates of 𝜓,𝜃 for large values of 𝑥 without the Riemann hypothesis, Math. Comp., 85, 875, 10.1090/mcom/3005 · DOI
  15. Dusart, Pierre, 2018, Explicit estimates of some functions over primes, Ramanujan J., 45, 227, 10.1007/s11139-016-9839-4 · DOI
  16. P. Erdös, Beweis eines Satzes von Tschebyschef, Acta Litt. Sci. Szeged 5 (1932), 194–198.
  17. Faber, Laura, 2015, New bounds for 𝜓(𝑥), Math. Comp., 84, 1339, 10.1090/S0025-5718-2014-02886-X · DOI
  18. Faber, Laura, 2018, Corrigendum to New bounds for 𝜓(𝑥) [ MR3315511], Math. Comp., 87, 1451, 10.1090/mcom/3340 · doi:10.1090/mcom/3340
  19. Hadamard, J., 1896, Sur la distribution des zéros de la fonction 𝜁(𝑠) et ses conséquences arithmétiques, Bull. Soc. Math. France, 24, 199, 10.24033/bsmf.545 · doi:10.24033/bsmf.545
  20. Hanson, Denis, 1972, On the product of the primes, Canad. Math. Bull., 15, 33, 10.4153/CMB-1972-007-7 · doi:10.4153/cmb-1972-007-7
  21. Kadiri, Habiba, 2005, Une région explicite sans zéros pour la fonction 𝜁 de Riemann, Acta Arith., 117, 303, 10.4064/aa117-4-1 · doi:10.4064/aa117-4-1
  22. Kadiri, Habiba, 2018, Explicit zero density for the Riemann zeta function, J. Math. Anal. Appl., 465, 22, 10.1016/j.jmaa.2018.04.071 · doi:10.1016/j.jmaa.2018.04.071
  23. von Koch, Helge, 1901, Sur la distribution des nombres premiers, Acta Math., 24, 159, 10.1007/BF02403071 · DOI
  24. Logan, B. F., 1988, Bounds for the tails of sharp-cutoff filter kernels, SIAM J. Math. Anal., 19, 372, 10.1137/0519027 · doi:10.1137/0519027
  25. van de Lune, J., 1986, On the zeros of the Riemann zeta function in the critical strip. IV, Math. Comp., 46, 667, 10.2307/2008005 · DOI
  26. Mossinghoff, Michael J., 2015, Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function, J. Number Theory, 157, 329, 10.1016/j.jnt.2015.05.010 · DOI
  27. Pintz, J., 1980, On the remainder term of the prime number formula. II. On a theorem of Ingham, Acta Arith., 37, 209, 10.4064/aa-37-1-209-220 · doi:10.4064/aa-37-1-209-220
  28. Platt, David J., 2015, Computing 𝜋(𝑥) analytically, Math. Comp., 84, 1521, 10.1090/S0025-5718-2014-02884-6 · doi:10.1090/s0025-5718-2014-02884-6
  29. Platt, David J., 2017, Isolating some non-trivial zeros of zeta, Math. Comp., 86, 2449, 10.1090/mcom/3198 · doi:10.1090/mcom/3198
  30. Platt, D. J., 2016, On the first sign change of 𝜃(𝑥)-𝑥, Math. Comp., 85, 1539, 10.1090/mcom/3021 · DOI
  31. Platt, David J., 2021, The error term in the prime number theorem, Math. Comp., 90, 871, 10.1090/mcom/3583 · DOI
  32. D. Platt and T. Trudgian, The Riemann hypothesis is true up to 3⋅10¹², to appear in Bull. Lond. Math. Soc., \url{https://doi.org/10.1112/blms.12460}. · DOI
  33. Ramaré, O., 2016, An explicit density estimate for Dirichlet 𝐿-series, Math. Comp., 85, 325, 10.1090/mcom/2991 · DOI
  34. Rosser, Barkley, 1941, Explicit bounds for some functions of prime numbers, Amer. J. Math., 63, 211, 10.2307/2371291 · DOI
  35. Rosser, J. Barkley, 1955, Explicit remainder terms for some asymptotic series, J. Rational Mech. Anal., 4, 595, 10.1512/iumj.1955.4.54021 · DOI
  36. Rosser, J. Barkley, 1962, Approximate formulas for some functions of prime numbers, Illinois J. Math., 6, 64
  37. Rosser, J. Barkley, 1975, Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥), Math. Comp., 29, 243, 10.2307/2005479 · DOI
  38. Saouter, Yannick, 2015, A still sharper region where 𝜋(𝑥)-𝑙𝑖(𝑥) is positive, Math. Comp., 84, 2433, 10.1090/S0025-5718-2015-02930-5 · DOI
  39. Stečkin, S. B., 1970, The zeros of the Riemann zeta-function, Mat. Zametki, 8, 419
  40. Trudgian, Tim, 2016, Updating the error term in the prime number theorem, Ramanujan J., 39, 225, 10.1007/s11139-014-9656-6 · DOI
  41. C. J. de la Vallée Poussin, Recherches analytiques sur la théorie des nombres premiers, Ann. Soc. Sci. Bruxelles, deuxiéme partie 20 (1896), 183–256
  42. S. Wedeniwski, ZETAGRID, computational verification of the Riemann hypothesis, Conference in Number Theory in Honour of Professor H.C. Williams, Alberta, Canada, May 2003, \url{http://www.zetagrid.net/zeta/math/zeta.result.100billion.zeros.html}.

Cited by

Metadata

Authors
Broadbent, S., Kadiri, H., Lumley, A., Ng, N., & Wilk, K.
Venue
Mathematics of Computation
Published
2021-06-15
Volume
90
Issue
331
Pages
2281-2315
ISSN
  • 1088-6842
  • 0025-5718
Cited by
34
References
1
Language
en
Funders
  • Natural Sciences and Engineering Research Council of Canada (RGPIN-2020-06731, RGPIN-2020-06032, ULRF G00003674)
  • University of Lethbridge (RGPIN-2020-06731, RGPIN-2020-06032, ULRF G00003674)

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.

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 function 𝜃(𝑥). https://app.cochat.ai/papers/10.1090/mcom/3643
The paper
Broadbent, S., Kadiri, H., Lumley, A., Ng, N., & Wilk, K. (2021). Sharper bounds for the Chebyshev function 𝜃(𝑥). Mathematics of Computation. https://doi.org/10.1090/mcom/3643

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.