Explicit bounds for primes in arithmetic progressions

DOI10.1215/IJM/1552442669zbMATH Open1440.11180arXiv1802.00085OpenAlexW2963987338WikidataQ128294631 ScholiaQ128294631MaRDI QIDQ669494FDOQ669494

Authors: Michael A. Bennett, Greg Martin, Kevin O'Bryant, Andrew Rechnitzer 

Publication date: 15 March 2019

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

Abstract: We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $gcd(a,q)=1$ and $3leqqleq10^5$, and $heta(x;q,a)$ denotes the sum of the logarithms of the primes $pequivapmodq$ with $pleqx$, we show that ${\displaystyle }$ �igg| heta (x; q, a) - frac{x}{phi (q)} �igg| < frac1{160} frac{x}{log x}, ${\displaystyle }$ for all $xge8cdot10^9$ (with sharper constants obtained for individual such 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 $apmodq$ when $qle1200$. 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.

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

Recommendations

• Primes in arithmetic progressions
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Medium-sized values for the prime number theorem for primes in arithmetic progressions
• Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
• scientific article; zbMATH DE number 2005658

zbMATH Keywords

arithmetic progressionsprime-counting functions

Mathematics Subject Classification ID

Real zeros of (L(s, chi)); results on (L(1, chi)) (11M20) Asymptotic results on arithmetic functions (11N37) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Algebraic number theory computations (11Y40) Primes in congruence classes (11N13) Analytic computations (11Y35)

Cited In (61)

• New bounds for numbers of primes in element orders of finite groups
• Explicit sieve estimates and nonexistence of odd multiperfect numbers of a certain form
• Explicit results for Euler’s factorial series in arithmetic progressions under GRH
• On the sum of a prime and a square-free number with divisibility conditions
• Computing generalized convolutions faster than brute force
• Conditional estimates for the logarithmic derivative of Dirichlet \(L\)-functions
• Climbing and descending tall isogeny volcanos
• Coprime mappings on Gaussian lines
• On the equation \(\sigma^*(n)=1+mn\)
• Explicit zero-free regions for the Riemann zeta-function
• On \(q\)-orders in primitive modular groups
• Padé approximation for a class of hypergeometric functions and parametric geometry of numbers
• EXPLICIT ZERO‐FREE REGIONS FOR DIRICHLET ‐FUNCTIONS
• Title not available (Why is that?)
• On the equation $\varphi (n)=\varphi (n+1)$
• Title not available (Why is that?)
• Explicit small heights in infinite non-abelian extensions
• Euler's divergent series in arithmetic progressions
• Nontrivial upper bounds for the least common multiple of an arithmetic progression
• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
• A Conjecture on Primes in Arithmetic Progressions and Geometric Intervals
• Title not available (Why is that?)
• Title not available (Why is that?)
• The first moment of primes in arithmetic progressions: beyond the Siegel–Walfisz range
• Densities in certain three-way prime number races
• The Riemann hypothesis is true up to 3·1012
• Title not available (Why is that?)
• Ramanujan-Nagell cubics
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
• Partial Gaussian sums and the Pólya-Vinogradov inequality for primitive characters
• Classification of some vertex operator algebras of rank 3
• On members of Lucas sequences which are products of factorials
• Improving and maximal inequalities for primes in progressions
• On the divisibility of odd perfect numbers, quasiperfect numbers and amicable numbers by a high power of a prime
• Counting zeros of Dirichlet $L$-functions
• AN EXPLICIT VERSION OF CHEN’S THEOREM
• Counting elliptic curves over the rationals with a 7-isogeny
• A lower bound on HMOLS with equal sized holes
• Effective bounds for certain functions concerning prime numbers
• Title not available (Why is that?)
• Improved constants for effective irrationality measures from hypergeometric functions
• Prime powers dividing products of consecutive integer values of \(x^{2^n}+1\)
• Diophantine equations involving the Euler totient function
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
• Quadratic fields admitting elliptic curves with rational \(j\)-invariant and good reduction everywhere
• Conditional Bounds on Siegel Zeros
• On the upper bound for the number of primes or almost primes in a given integer sequence
• Title not available (Why is that?)
• Large sieve inequality with sparse sets of moduli applied to Goldbach conjecture
• Uniform explicit Stewart theorem on prime factors of linear recurrences
• Medium-sized values for the prime number theorem for primes in arithmetic progressions
• Explicit bounds on exceptional zeroes of Dirichlet \(L\)-functions. II
• On the average value of
• Explicit Bounds for Primality Testing and Related Problems
• Euler’s function on products of primes in a fixed arithmetic progression
• An elementary bound on Siegel zeroes
• AN EFFECTIVE BOUND FOR GENERALISED DIOPHANTINE m-TUPLES
• Explicit bounds on exceptional zeroes of Dirichlet \(L\)-functions
• Explicit short intervals for primes in arithmetic progressions on GRH
• Deciding FO-definability of regular languages

This page was built for publication: Explicit bounds for primes in arithmetic progressions

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