Solutions to a Romanoff type problem

From MaRDI portal





Romanoff proved that the set of positive integers which are a sum of a prime and a power of \(2\) is of positive density. This motivated the following question. Given a set \({\mathcal B}\) of positive integers what can one say about the counting function of the set \({\mathcal S}\) of positive integers \(n\) which are a sum of a prime and a member of \({\mathcal B}\). Say that \({\mathcal B}\) satisfies the \(c\)-condition if \(\#{\mathcal B}(cx)\gg \#{\mathcal B}(x)\) holds for large \(x\) with some \(c<1\). The author presents two results. The first one says that if \({\mathcal B}\) satisfies the \(c\)-condition and \(\#{\mathcal B}(x)\gg x^{\alpha}\) holds for large \(x\) with some \(\alpha\in (0,1)\), then \N\[\N\#{\mathcal S}(x)\gg \frac{x}{\log\log\log x}. \N\]\NOne may ask what happens when \(\alpha\) tends to \(1\) in the above result. The author presents a second result which states that for all positive integers \(m\ge 3\), there exists a set \({\mathcal B}\) satisfying the \(c\)-condition such that additionally \N\[\N\#{\mathcal B}(x)\gg \exp\left(-\frac{2}{m} (\log x)^{1/m} \log\log x\right)\N\]\Nand furthermore \(\#{\mathcal S}(x)\ll x/\log\log\log x\). The proof of the first result uses the Cauchy-Schwartz inequality. For the second result the author constructs \({\mathcal B}\) explicitly by taking it to be the union over \(j\ge 1\) of the set of all positive multiples of the \(j\)th primorial, namely the number of the form \(p_1p_2\cdots p_j\) with \(p_k\) being the \(k\)th prime, in the interval \([\exp(j^m),\exp((j+1)^m)]\), and then by proving that for this \({\mathcal B}\) the required upper bound on \({\mathcal S}(x)\) holds.











This page was built for publication: Solutions to a Romanoff type problem

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