Bertrand's postulate for primes in arithmetical progressions

DOI10.1016/0898-1221(93)90071-3zbMath0789.11001OpenAlexW2043092105MaRDI QIDQ1309735

Pieter Moree

Publication date: 13 June 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90071-3

zbMATH Keywords

explicit upper boundsgeneralization of Bertrand's postulateprimes in arithmetical progressions

Mathematics Subject Classification ID

Primes in congruence classes (11N13) Primes (11A41)

Related Items (3)

Presentations of finite simple groups: a computational approach. ⋮ Erdős and the integers ⋮ Inverse cyclotomic polynomials

Cites Work

• On the incongruence of consecutive fourth powers
• On the Galois groups of the exponential Taylor polynomials
• Approximate formulas for some functions of prime numbers
• Braids and permutations
• Numerical Computations Concerning the ERH
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Explicit Estimates for θ (x; 3, l) and ψ(x; 3, l)
• The Discriminator (A Simple Application of Bertrand's Postulate)
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• The large sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bertrand's postulate for primes in arithmetical progressions