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

DOI10.1090/MCOM/3691zbMATH Open1503.11123arXiv2003.01925OpenAlexW3009789484WikidataQ114094311 ScholiaQ114094311MaRDI QIDQ5070543FDOQ5070543

Authors: Anne-Maria Ernvall-Hytönen, Neea Palojärvi 

Publication date: 13 April 2022

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: We prove an explicit error term for the $psi(x,chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Full work available at URL: https://arxiv.org/abs/2003.01925

Recommendations

• Explicit bounds for primes in arithmetic progressions
• On the upper bound of the number of primes in arithmetic progression
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Explicit bounds for primes in residue classes
• scientific article; zbMATH DE number 733563
• Explicit Bounds for Some Functions of Prime Numbers
• Estimates of the \(k\)th prime under the Riemann hypothesis
• On the upper bound for the number of primes or almost primes in a given integer sequence

zbMATH Keywords

explicit boundsprimes in arithmetic progressionsgeneralized Riemann hypothesis

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Primes in congruence classes (11N13) Analytic computations (11Y35)

Cites Work

• Title not available (Why is that?)
• Approximate formulas for some functions of prime numbers
• Explicit upper bounds for 𝐿-functions on the critical line
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• Explicit bounds for primes in arithmetic progressions
• Counting zeros of Dirichlet \(L\)-functions
• Table errata: Table of integrals, series, and products [corrected and enlarged edition, Academic Press, New York, 1980; MR 81g:33001] by I. S. Gradshteyn [I. S. Gradshteĭn] and I. M. Ryzhik
• Estimating \(\pi (x)\) and related functions under partial RH assumptions
• Conditional bounds for the least quadratic non-residue and related problems
• On Mahler's transcendence measure for \(e\)
• Extension of the Riemann ξ-Function's Logarithmic Derivative Positivity Region to Near the Critical Strip

Cited In (11)

• Explicit estimates: from \(\Lambda (n)\) in arithmetic progressions to \(\Lambda (n)/n\)
• An explicit version of Chen's theorem assuming the generalized Riemann hypothesis
• Explicit results for Euler’s factorial series in arithmetic progressions under GRH
• Gaussian phenomena for small quadratic residues and non-residues
• The prime number theorem for primes in arithmetic progressions at large values
• Conditional estimates for the logarithmic derivative of Dirichlet \(L\)-functions
• Conditional bounds for the least quadratic non-residue and related problems
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Title not available (Why is that?)
• Some consequences of the general Riemann hypothesis in the comparative theory of primes
• Explicit bounds for primes in arithmetic progressions

Uses Software

• SageMath

This page was built for publication: Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070543)