Bertrand's postulate for primes in arithmetical progressions
type: Item
instance of: scholarly article
title: Bertrand's postulate for primes in arithmetical progressions
zbMATH Open document ID: 0789.11001
DOI: 10.1016/0898-1221(93)90071-3
author: Pieter Moree
publication date: 1994-06-13T00:00:00Z
review text: The author considers the following generalization of Bertrand's postulate. Define, for integers \(m \geq 1\), \(d \geq 2\), and a real \(z>1\) \[ \begin{multlined} B_ m (z,d)=\lim \inf \{c:\text{ For every } x \geq c \text{ the interval } (x,zx) \text{ contains } \\ \text{at least } m \text{ primes } \equiv a \pmod d \}.\end{multlined} \] Using elementary methods of \textit{G. Ricci} [Boll. Un. Mat. Ital. 13, 7-17 (1934; Zbl 0008.29602)] and \textit{P. Erdős} [Math. Z. 39, 473-491 (1935; Zbl 0010.29303)] he derives explicit upper bounds for \(B_ m(z,d)\) in the case \[ \sigma (d)=\sum_{p<d, p \nmid d} {1 \over p}<1. \] A complete list of these numbers \(d\) is given, the largest one is \(d=840\).
Mathematics Subject Classification ID: 11A41
Mathematics Subject Classification ID: 11N13
zbMATH DE Number: 474523
zbMATH Keywords: primes in arithmetical progressions
zbMATH Keywords: generalization of Bertrand's postulate
zbMATH Keywords: explicit upper bounds
reviewed by: Dieter Wolke
MaRDI profile type: Publication
full work available at URL: 0898-1221(93)90071-3
OpenAlex ID: W2043092105
cites work: The Discriminator (A Simple Application of Bertrand's Postulate)
cites work: Braids and permutations
cites work: On the Galois groups of the exponential Taylor polynomials
cites work: Q3204531
cites work: On the incongruence of consecutive fourth powers
cites work: Q3211377
cites work: Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
cites work: Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
cites work: Explicit Estimates for θ (x; 3, l) and ψ(x; 3, l)
cites work: Numerical Computations Concerning the ERH
cites work: Q5339393
cites work: Q3661646
cites work: Approximate formulas for some functions of prime numbers
cites work: The large sieve
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 474523