scientific article; zbMATH DE number 3559678
A sequence \(Q = \{q_n\}\) of prime numbers is called a \(G\)-sequence, if \(3\le q_1< q_2 <\ldots\) and \(q_n\equiv 1 \bmod q_i\), \(1\le i<n\). Let \(A(Q,x)\) denote the number of elements of \(Q\), not exceeding \(x\). Then the author proves the following Theorem. For every \(G\)-sequence \(Q\) we have \[ \varlimsup_{x\to\infty} A(Q,x)/(x/\log x) <1. \] Furthermore, if \(\varepsilon\) is an arbitrary positive number, then there exists a \(G\)-sequence \(Q\) such that \[ \varlimsup_{x\to\infty} A(Q,x)/(x/\log x) >1 +\varepsilon. \] The proof is elementary and uses some simple facts of the Brun-Selberg sieve method.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132617)