CoChat

Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis

Open access
Ernvall-Hytönen, Anne-Maria, Palojärvi, Neea · 2022 · Mathematics of Computation

The 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

Crossref · 10.1090/mcom/3691

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 Valid · 1 Not valid · 11 Not checked · 47 Own results and interpretations

40 more claims

Create a free account to see all 59 claims and to verify the 8 references still open.

See all claims — free account
  • The quote only partly states this claim. 6
  • It may state two separate claims as one. 10
  • Probably not a substantial claim. 2

Create a free account to see these claims.

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?

Citations

Cites

Show all 18 references

Research works printed but not linked: 1

  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

See all 12

Metadata

Authors
Ernvall-Hytönen, A.-M., & Palojärvi, N.
Affiliations
  • University of Helsinki (FI)
  • Åbo Akademi University (FI)
Venue
Mathematics of Computation
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
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.