Existence of primes in the interval [15x, 16x]. An entirely elementary proof
Let \(k\) be a positive integer. In this paper, the authors give a short and entirely elementary proof of the proposition ``For any positive integer \(N\), there exists a real number \(L_{k,N}\) such that for any real number \(x\ge L{k,N}\), there are at least \(N\) primes in the interval \([k x, (k+1)x]\) for \(k\le 15\). \textit{P. Erdős} [Acta Litt. Sci. Szeged 5, 194--198 (1932; JFM 58.0154.04)] gave a short and elementary proof for \(k=1\). \textit{S. Hitotsumatsu} [``\(n\) to \(2n\) no aida ni sosuu ga aru, Sūken Tsushin 70, 2--5 (2011)] introduced a very elementary and simplified proof. \textit{I. Sainose} [``Chebyshev no teiri no seimitsuka, Sūken Tsushin 76, 22--26 (2013)] applied their methods for \(k=2\). In the case of \(k=3\) and \(k=4\), the method is very similar to the case of \(k=2\). In 2023, the third author of this paper showed the case for \(k=5\) in his master's thesis with some new idea. In this paper, the authors extend his result to the case for \(k\le 15\) by refining his idea. The proof is also entirely elementary.
This page was built for publication: Existence of primes in the interval \([15x, 16x]\). An entirely elementary proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949684)
