Prime avoiding numbers is a basis of order 2

arXiv2209.03058MaRDI QIDQ6409961FDOQ6409961

Authors: Mikhail R. Gabdullin 

Publication date: 7 September 2022

Abstract: For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where ${\displaystyle }$ F(n_i) geqslant (log N)(loglog N)^{1/325565}, ${\displaystyle }$ for $i=1,2$. This improves the corresponding "trivial" statement where only $F(n_i)gglogN$ is required.

This page was built for publication: Prime avoiding numbers is a basis of order $2$

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