Two statements that are equivalent to a conjecture related to the distribution of prime numbers
arXiv:1406.4801
Abstract
Let . In [8] we ask the question whether any sequence of consecutive integers greater than and smaller than contains at least one prime number, and we show that this is actually the case for every . In addition, we prove that a positive answer to the previous question for all would imply Legendre's, Brocard's, Andrica's, and Oppermann's conjectures, as well as the assumption that for every there is always a prime number in the interval . Let denote the amount of prime numbers in the interval . Here we show that the conjecture described in [8] is equivalent to the statement that where and is any real number such that . We also prove that the conjecture in question is equivalent to the statement that where We use this last result in order to create plots of for many values of .
16 pages, 3 figures (version 2 includes them also as ancillary files, no changes to version 1 have been made), Mathematica code; keywords: Andrica's conjecture, Brocard's conjecture, Legendre's conjecture, Oppermann's conjecture, prime numbers, triangular numbers. arXiv admin note: text overlap with arXiv:1310.1323