Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index; none of the 12 sources its claims cite is checked for support yet.
Abstract
We prove an explicit error term for the ψ ( x , χ ) function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.
Overview
CoChat Summary
TL;DR
The paper proves an explicit error term for \(\psi(x,\chi)\) under the Generalized Riemann Hypothesis and uses it to give a conditional explicit bound for the number of primes in arithmetic progressions. The main result is a fully explicit inequality for \(\pi(x;q,a)\), with a simplified corollary.
Key findings
- Assuming GRH, for integers \(a,q\) with \(\gcd(a,q)=1\), \(q\ge 3\), and \(x\ge q\), Corollary 2 gives
\[
\left|\pi(x;q,a)-\frac{\operatorname{li}(x)}{\varphi(q)}\right|
\le \frac{1}{8\pi\varphi(q)}+\frac{1}{6\pi}\sqrt{x}\log x
+(0.184\log q+12969.946)\sqrt{x}-237.934.
\]
- Theorem 1 gives a longer explicit bound for the same quantity, involving additional terms such as \(\sqrt{x}\log x\), \(\sqrt{x}\log^2 x\), \(x^{1/4}\), and \(x^{1/4}\log\log x\); the paper states the first term on the right side is clearly dominating for large \(x\).
- Theorem 3 gives an explicit bound for
\[
\left|\psi(x;q,a)-\frac{x}{\varphi(q)}\right|
\]
under \(\mathrm{GRH}(q)\) for \(q\) and all moduli dividing \(q\), with a remainder term \(R_1(q)\) defined piecewise for ranges of \(q\).
Methods
- Analytic number theory proof: express \(\psi(x;q,a)\) via Dirichlet characters, use the explicit formula for \(\psi_0(x,\chi)\), and bound the contribution from zeros of Dirichlet \(L\)-functions.
- Uses explicit zero-counting estimates for Dirichlet \(L\)-functions, bounds for logarithmic derivatives \(L'(s,\chi)/L(s,\chi)\), and partial summation to pass from \(\psi(x;q,a)\) to \(\pi(x;q,a)\).
- Numerical verification with Sage is used for small ranges, e.g. checking \(2\le x\le 74\) for a \(\psi(x)-x\) bound and evaluating constants in lemmas.
Limitations
- Stated: the authors say it would be possible to obtain a sharper bound, but they state the result in a long, complicated form because the first term dominates for large \(x\) and the simplified form reveals the order of magnitude.
- Stated: some parameter choices are not optimized because they affect the least important term in the main results.
- Evident from the text: all main results are conditional on GRH or \(\mathrm{GRH}(q)\), and the simplified Corollary 2 is weaker than the fuller Theorem 1 bound.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 1 Not valid · 11 Not checked · 47 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 3. Let x ≥ 2 be a real number and q ≥ 3 and a, where gcd(a, q) = 1, be integers.Assume that the GRH(q) holds for the number q and all moduli dividing q.We have ψ(x; q, a) -x ϕ(q) < 1 8πϕ(q) + 1 6π √ x log 2 x + (0.184 log q + 8.250) √ x log x + (5.314 log q + 124.318) √ x + (5.048 log 2 q + 109.573log q + 725.316) √ x log x + (2.015 log q + 0.5) log x + R 1 (q)”
§ EXPLICIT BOUND FOR THE NUMBER OF PRIMES IN ARITHMETIC PROGRESSIONS ASSUMING THE GENERALIZED RIEMANN HYPOTHESIS > 1. Introduction
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“log q log x when q = 6.”
§ EXPLICIT BOUND FOR THE NUMBER OF PRIMES IN ARITHMETIC PROGRESSIONS ASSUMING THE GENERALIZED RIEMANN HYPOTHESIS > 3.1. Contribution coming from the principal character.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 1. Assume the GRH.Let a and q be integers and x be a real number such that gcd(a, q) = 1, q ≥ 3 and x ≥ q. Then we have π(x; q, a) -li(x) ϕ(q) < 1 8πϕ(q) + 1 6π √ x log x + (0.184 log q + 8.396) √ x + (6.05 log q + 158.745) √ x log x”
§ EXPLICIT BOUND FOR THE NUMBER OF PRIMES IN ARITHMETIC PROGRESSIONS ASSUMING THE GENERALIZED RIEMANN HYPOTHESIS > 1. Introduction
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Further, if x ≥ q ≥ 10 29 , we even have x 1/4 log 2 x > 949.261 log log x.”
§ EXPLICIT BOUND FOR THE NUMBER OF PRIMES IN ARITHMETIC PROGRESSIONS ASSUMING THE GENERALIZED RIEMANN HYPOTHESIS > 2.2.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Furthermore, if s = σ + it, where σ ≥ 2, then L ′ (s,χ) L(s,χ) < 0.570.”
§ EXPLICIT BOUND FOR THE NUMBER OF PRIMES IN ARITHMETIC PROGRESSIONS ASSUMING THE GENERALIZED RIEMANN HYPOTHESIS > 3.2. Contribution coming from the other characters.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
40 more claims
Create a free account to see all 59 claims and to verify the 8 references still open.
- The quote only partly states this claim. 6
- It may state two separate claims as one. 10
- Probably not a substantial claim. 2
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?
The cited source says what the claim attributes to it.
In the citing paper
“although our results appear to be sharper.”
From The prime number theorem for primes in arithmetic progressions at large values (2023) · cites this paper as [13]
In the citing paper
“Recently, Ernvall-Hytönen and Paloj ä rvi also proved another explicit version of the prime number theorem for primes in arithmetic progressions in [13], although our results appear to be sharper.”
From The prime number theorem for primes in arithmetic progressions at large values (2023) · cites this paper as [13]
Citations
Cites
Table of Integrals, Series, and Products
(2015) · Elsevier eBooks · doi:10.1016/c2010-0-64839-5 · Cited by 7,119
Lint, J. H. (2020) · Cited by 5,023
Davenport, H. (1980) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-5927-3 · Cited by 1,893
Approximate formulas for some functions of prime numbers
Rosser, J. B., & Schoenfeld, L. (1962) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255631807 · Cited by 1,546
Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
Rosser, J. B., & Schoenfeld, L. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0457373-7 · Cited by 386
Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II
Schoenfeld, L. (1976) · Mathematics of Computation · doi:10.1090/s0025-5718-1976-0457374-x · Cited by 369
Conditional bounds for the least quadratic non-residue and related problems
Lamzouri, Y., Li, X., & Soundararajan, K. (2015) · Mathematics of Computation · doi:10.1090/s0025-5718-2015-02925-1 · Cited by 59
Explicit upper bounds for 𝐿-functions on the critical line
Chandee, V. (2009) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-09-10075-8 · Cited by 57
Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
Rosser, J. B., & Schoenfeld, L. (1975) · Mathematics of Computation · doi:10.2307/2005479 · Cited by 40
Trudgian, T. S. (2014) · Mathematics of Computation · doi:10.1090/s0025-5718-2014-02898-6 · Cited by 39
Research works printed but not linked: 1
- C.-J. de la Vallée Poussin, Recherches analytiques la théorie des nombres premiers, Ann. Soc. scient. Bruxelles 20 (1896), 183-256.
Cited by
Conditional estimates for the logarithmic derivative of Dirichlet L -functions
Chirre, A., Hagen, M. V., & Simonič, A. (2023) · Indagationes Mathematicae · doi:10.1016/j.indag.2023.07.005 · Cited by 17
Uniform effective estimates for |L(1,χ)|
Languasco, A., & Trudgian, T. S. (2021) · Journal of Number Theory · doi:10.1016/j.jnt.2021.07.019 · Cited by 16
Omega theorems for logarithmic derivatives of zeta and $L$-functionsPreprint
Yang, D. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.16371 · Cited by 12
Conditional estimates for $L$-functions in the Selberg classPreprint
Palojärvi, N., & Simonič, A. (2022) · Repository of the University of Primorsk (University of Primorska) · doi:10.48550/arxiv.2211.01121 · Cited by 8
Self-citationSparse polynomial interpolation: faster strategies over finite fields
van der Hoeven, J., & Lecerf, G. (2024) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-024-00655-5 · Cited by 6
Metadata
- Authors
- Ernvall-Hytönen, A.-M., & Palojärvi, N.
- Affiliations
- University of Helsinki (FI)
- Åbo Akademi University (FI)
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 2022-02-15
- Volume
- 91
- Issue
- 335
- Pages
- 1317-1365
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W3009789484
- Cited by
- 12
- References
- 17
- Citations by year
- 2026: 2 · 2024: 4 · 2023: 4 · 2022: 1
- FWCI
- 2.90
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Mathematics of Computation (publishedVersion)
- Helda - University of Helsinki Institutional Repository (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Emil Aaltosen Säätiö
- Åbo Akademi
- 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 › Geometry and Topology › Algebraic Geometry and Number Theory
- Keywords
- primes in arithmetic progressions, generalized Riemann hypothesis, character sums, Dirichlet characters, prime counting function
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: Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis. https://app.cochat.ai/papers/10.1090/mcom/3691
- The paper
- Ernvall-Hytönen, A.-M., & Palojärvi, N. (2022). Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis. Mathematics of Computation. https://doi.org/10.1090/mcom/3691
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.