Computations concerning primes and powers of two
Let \(a(n)=\#\{m: m\leq n\), \(m=p+2^k\}\) and \(\delta(N,n)=(a(N+n) - a(N))/n\). It is known [see \textit{N. P. Romanoff}, Math. Ann. 109, 668--678 (1934; Zbl 0009.00801); \textit{J. G. van der Corput}, Simon Stevin 27, 99--105 (1950; Zbl 0037.16901); \textit{P. Erdős}, Summa Brasil. Math. 2, 113--123 (1950; Zbl 0041.36807)] that \[ 0<\lim \inf \delta(0,n)\leq \lim \sup \delta(0,n)<\tfrac12, \] and it is conjectured that \(\delta = \lim \delta(0,n)\) exists. The author computed \(\delta(0,n)\) for \(n\leq 2^{27}\), and \(\delta(N,n)\) for \(n\leq 10^7\), with various \(N\) near \(2^k\) up to \(k=31\). The results are given in graphs which show that \(\delta(0,n)\) has rather prominent local mins. and maxs. corresponding to\(n\) just before and just after a power of 2. These mins. and maxs. near \(2^k\) are given to 5 decimal places for \(9\leq k\leq 26\). It would have been useful to have the exact locations of these mins. and maxs.; similarly it would be of some interest to have various exact values of \(a(n)\). The calculations are extrapolated leading to a suggested value of \(0.434\dots\) for \(\delta\). Computations based on a probabilistic model suggested by Bombieri also lead to a similar value for \(\delta\).
- On Romanov's constant
- Computing the permanent modulo a prime power
- Primes and power-primes
- scientific article; zbMATH DE number 653244 (Why is no real title available?)
- On computing the density of integers of the form \(2^n + p\)
- An effective version of the Bombieri-Vinogradov theorem, and applications to Chen's theorem and to sums of primes and powers of two
- Some computational results on a conjecture of de Polignac about numbers of the form p + 2ᵏ
This page was built for publication: Computations concerning primes and powers of two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797630)
