On consecutive primes

From MaRDI portal





Let \(\displaystyle S(n) = \sum_{p < n} (n-p)^{-1}\) where \(p\) represents prime numbers. Erdős and De Bruijn have proved a number of inequalities for \(S\) and \(S^2\) summed over integers and over primes. The author extends these results by proving Theorem 1: For every integer \(k\ge 1\), \[ \sum_{n\le N}S^k(n) = O(N) \text{ and } \sum_{q\le N} S^k(q) = O(N/\log N) \] where \(q\) represents primes; and Theorem 2: Assuming a certain density hypothesis for the zeros of the zeta-function, for every integer \(k\ge 2\), \[ \sum_{n\le N} \vert S(n) -1\vert^k = O[N(\log N)^{-1+\varepsilon}] \text{ and }\sum_{q\le N} \vert S(q) -1\vert^k = O[N(\log N)^{-2+\varepsilon}]. \]











This page was built for publication: On consecutive primes

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