CoChat

Explicit bounds for primes in arithmetic progressions

Bennett, Michael A., Martin, Greg, O’Bryant, Kevin, Rechnitzer, Andrew · 2018 · Illinois Journal of Mathematics
Cited by 31

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

Abstract

We derive explicit upper bounds for various counting functions for primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\mathop{\mathrm{gcd}}\nolimits (a,q)=1$ and $3\leq q\leq10^{5}$, and $\theta(x;q,a)$ denotes the sum of the logarithms of the primes $p\equiv a\ (\operatorname{mod}q)$ with $p\leq x$, we show that \[\vert \theta(x;q,a)-{x}/{\varphi(q)}\vert <\frac{1}{160}\frac{x}{\log x}\] for all $x\geq8\cdot10^{9}$, with significantly sharper constants obtained for individual moduli $q$. We establish inequalities of the same shape for the other standard prime-counting functions $\pi(x;q,a)$ and $\psi(x;q,a)$, as well as inequalities for the $n$th prime congruent to $a\ (\operatorname{mod}q)$ when $q\le1200$. For moduli $q>10^{5}$, we find even stronger explicit inequalities, but only for much larger values of $x$. Along the way, we also derive an improved explicit lower bound for $L(1,\chi)$ for quadratic characters $\chi$, and an improved explicit upper bound for exceptional zeros.

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.1215/ijm/1552442669

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: 31

  1. M. Watkins, Class numbers of imaginary quadratic fields, Math. Comp. 73 (2003), 907–938. · doi:10.1090/s0025-5718-03-01517-5
  2. T. Trudgian, An improved upper bound for the argument of the Riemann zeta-function on the critical line II, J. Number Theory 134 (2014), 280–292. · DOI
  3. M. A. Bennett, Rational approximation to algebraic numbers of small height: The Diophantine equation $\vert ax\sp n-by\sp n\vert=1$, J. Reine Angew. Math. 535 (2001), 1–49. · doi:10.1515/crll.2001.044
  4. D. Berkane and P. Dusart, On a constant related to the prime counting function, Mediterr. J. Math. 13 (2016), 929–938. · DOI
  5. C. J. de la Vallée Poussin, Sur la fonction $\zeta(s)$ de Riemann et le nombre des nombres premieres inférieur a une limite donnée, Mém. Courronnés et autres Mém. Publ. Acad. Roy. Sci., des Letters Beaux-Arts Belgique 59 (1899/00). · doi:10.3406/marb.1899.2449
  6. P. Dusart, Estimates of $\theta(x;k,l)$ for large values of $x$, Math. Comp. 71 (2002), no. 239, 1137–1168. · DOI
  7. P. Dusart, Explicit estimates of some functions over primes, Ramanujan J. 45 (2018), 227–251. · DOI
  8. K. Ford, F. Luca and P. Moree, Values of the Euler $\varphi$-function not divisible by a given odd prime, and the distribution of Euler–Kronecker constants for cyclotomic fields, Math. Comp. 83 (2014), 1447–1476. · DOI
  9. D. A. Frolenkov and K. Soundararajan, A generalization of the Pólya–Vinogradov inequality, Ramanujan J. 31 (2013), no. 3, 271–279. · doi:10.1007/s11139-012-9462-y
  10. J. Hadamard, Sur la distribution des zéros de la fonction $\zeta(s)$ et ses consequences arithmétiques, Bull. Soc. Math. France 24 (1896), 199–220. · doi:10.24033/bsmf.545
  11. W. Haneke, Über die reellen Nullstellen der Dirichletschen $L$-Reihen, Acta Arith. 22 (1973), 391–421. · doi:10.4064/aa-22-4-391-421
  12. A. E. Ingham, The distribution of prime numbers, Cambridge tract, vol. 30, Cambridge University Press, Cambridge, 1932.
  13. H. Iwaniec and E. Kowalski, Analytic number theory, American Mathematical Society Colloquium Publications, vol. 53, American Mathematical Society, Providence, RI, 2004. · DOI · Paper page
  14. H. Kadiri, Explicit zero-free regions for Dirichlet $L$-functions, Mathematika 64 (2018), no. 2, 445–474. · doi:10.1112/s0025579318000037
  15. K. S. McCurley, Explicit estimates for the error term in the prime number theorem for arithmetic progressions, Math. Comp. 42 (1984), no. 165, 265–285. · doi:10.2307/2007579
  16. K. S. McCurley, Explicit estimates for $\theta(x;3,l)$ and $\psi(x;3,l)$, Math. Comp. 42 (1984), no. 165, 287–296. · doi:10.2307/2007580
  17. K. S. McCurley, Explicit zero-free regions for Dirichlet L-functions, J. Number Theory 19 (1984), no. 1, 7–32. · DOI
  18. H. L. Montgomery and R. C. Vaughan, The large sieve, Mathematika 20 (1973), no. 40, 119–134. · doi:10.1112/s0025579300004708
  19. H. L. Montgomery and R. C. Vaughan, Multiplicative number theory. I. Classical theory, Cambridge Studies in Advanced Mathematics, vol. 97, Cambridge University Press, Cambridge, 2007. · DOI
  20. M. J. Mossinghoff and T. Trudgian, Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function, J. Number Theory 157 (2015), 329–349. · DOI
  21. D. J. Platt, Computing degree $1$ $L$-functions rigorously, Ph.D. Thesis, University of Bristol, 2011.
  22. D. J. Platt, Numerical computations concerning the GRH, Math. Comp. 85 (2016), no. 302, 3009–3027. · doi:10.1090/mcom/3077
  23. D. J. Platt, Isolating some non-trivial zeros of zeta, Math. Comp. 86 (2017), no. 307, 2449–2467. · doi:10.1090/mcom/3198
  24. C. Pomerance, Remarks on the Pólya–Vinogradov inequality, Integers 11 (2011), A19. · doi:10.1515/integ.2011.039
  25. O. Ramaré and R. Rumely, Primes in arithmetic progressions, Math. Comp. 65 (1996), 397–425. · DOI
  26. J. B. Rosser, Explicit bounds for some functions of prime numbers, Amer. J. Math. 63 (1941), 211–232. · DOI
  27. J. B. Rosser and L. Schoenfeld, Sharper bounds for the Chebyshev functions $\theta(x)$ and $\psi(x)$. Collection of articles dedicated to Derrick Henry Lehmer on the occasion of his seventieth birthday, Math. Comp. 29 (1975), 243–269. · DOI
  28. T. Trudgian, An improved upper bound for the argument of the Riemann zeta-function on the critical line, Math. Comp. 81 (2012), 1053–1061. · doi:10.1090/s0025-5718-2011-02537-8
  29. T. Trudgian, An improved upper bound for the error term in the zero-counting formulae for Dirichlet $L$-functions and Dedekind zeta-functions, Math. Comp. 84 (2015), 1439–1450. · DOI
  30. T. Trudgian, Updating the error term in the prime number theorem, Ramanujan J. 39 (2016), 225–234. · DOI
  31. J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94. · DOI · Paper page

Cited by

See all 31

Metadata

Authors
Bennett, M. A., Martin, G., O’Bryant, K., & Rechnitzer, A.
Venue
Illinois Journal of Mathematics
Published
2018-01-01
Volume
62
Issue
1-4
Pages
427-532
ISSN
  • 0019-2082
  • 1945-6581
Cited by
31
References
1

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: Explicit bounds for primes in arithmetic progressions. https://app.cochat.ai/papers/10.1215/ijm/1552442669
The paper
Bennett, M. A., Martin, G., O’Bryant, K., & Rechnitzer, A. (2018). Explicit bounds for primes in arithmetic progressions. Illinois Journal of Mathematics. https://doi.org/10.1215/ijm/1552442669

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.