Bertrand's postulate for primes in arithmetical progressions
From MaRDI portal
Publication:1309735
DOI10.1016/0898-1221(93)90071-3zbMATH Open0789.11001OpenAlexW2043092105MaRDI QIDQ1309735FDOQ1309735
Authors: 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
Recommendations
Cites Work
- The large sieve
- Approximate formulas for some functions of prime numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Braids and permutations
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- Explicit Estimates for θ (x; 3, l) and ψ(x; 3, l)
- Title not available (Why is that?)
- Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
- On the Galois groups of the exponential Taylor polynomials
- The Discriminator (A Simple Application of Bertrand's Postulate)
- Title not available (Why is that?)
- On the incongruence of consecutive fourth powers
- Numerical Computations Concerning the ERH
Cited In (11)
- A Bertrand postulate for a subclass of primes
- Inverse cyclotomic polynomials
- Further results on a generalization of Bertrand's postulate
- Presentations of finite simple groups: a computational approach.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the prime numbers of certain arithmetic series.
- Title not available (Why is that?)
- Ramanujan Primes and Bertrand's Postulate
- Erdős and the integers
- Title not available (Why is that?)
This page was built for publication: Bertrand's postulate for primes in arithmetical progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309735)
