Romanoff theorem in a sparse set

From MaRDI portal





Let \(A\) be a set of positive integers and \(A(x)\) the number of elements of \(A\) not exceeding \(x\). The author proves that the number of positive integers which are less than \(x\) and of the form \(2^k+p\) with \(k\in A\) and \(p\) a prime number is greater than \(0.030996A(\log_2 x)\pi(x)\) for all sufficiently large \(x\). The number of positive integers which are less than \(x\) and of the form \(p-2^k\) with \(k\in A\) and \(p\) a prime number is greater than \(0.030996A(\log_2 x)\pi(x)\) for all sufficiently large \(x\). Four related open problems and one conjecture are posed.











This page was built for publication: Romanoff theorem in a sparse set

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