When Euler met Brun
Let \(p'\) denotes the smallest prime that is larger than prime \(p\). Brun's sieve asserts that for any fixed \(K\), \(\sum_{p'-p \le K}1/p<\infty\). In the paper under review, motivated by replacing \(K\) by a growing function, say \(y(p)=\lambda (p) \log p\), the author surveys some results concerning the following sum\N\[\NS(x):=\sum_{\substack{p\le x\\ p'-p \le y(p)}}\frac{1}{p}.\N\]\NIf for \(k\ge 2\) we let \(\log_k\) to be the \(k\)-th iterated logarithm, and define the ``logorial function by \(\mathrm{Log}_k = \prod_{2\le j \le k}\log_j\), then the author shows that as \(x \to \infty\)\N\[\NS(x)\sim \log_{k+1}x\N\]\Nfor \(\lambda (p) = 1/\mathrm{Log}_k(p)\), but \(S(x)\ll 1\) for \(\lambda (p) = 1/\mathrm{Log}_k(p)(\log_k p)^{\varepsilon}\), under the assumption that\N\[\N\frac{1}{\pi(x)}\#\left\{p\le x; \frac{p'-p}{\log p} \le \lambda(p)\right\} \sim \int^{\lambda(x)}_{0}e^{-u}du = 1-e^{-\lambda(x)}\N\]\Nholds for these functions \(\lambda\). The author also considers the problem unconditionally using sieve bounds.
- Bounded gaps between primes
- Dense clusters of primes in subsets
- scientific article; zbMATH DE number 953241 (Why is no real title available?)
- Jumping Champions
- On the distribution of primes in short intervals
- On the sum of the reciprocals of the differences between consecutive primes
- Opera de cribro
- Primes in Short Intervals: Heuristics and Calculations
- Primes in tuples. I
- Primes in tuples. IV: Density of small gaps between consecutive primes
- Small gaps between primes
- Some singular series averages and the distribution of Goldbach numbers in short intervals
- THE DISTRIBUTION OF PRIME NUMBERS
- The jumping champion conjecture
This page was built for publication: When Euler met Brun
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595579)
