Revisiting Generalized Bertand's Postulate and Prime Gaps

Abstract

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n,2n]$. Our aim in this note is to generalize this result to $[n,kn]$. A lower as well as an upper bound on the number of primes in $[n,kn]$ were conjectured by Mitra et al. [Arxiv 2009]. In 2016, Christian Axler provided a proof of the lower bound which is valid only when $n$ is greater than a very large threshold. In this paper, after almost a decade, we for the first time provide a direct proof of the lower bound that holds for all $n\ge 2$. Further, we show that the upper bound is a consequence of Firoozbakht's conjecture. Finally, we also prove a stronger version of the bounded gaps between primes.

References in corpus (4)

• Estimates of Some Functions Over Primes without R.H.
• Bounded length intervals containing two primes and an almost-prime
• On a new property of primes that leads to a generalization of Cramer's conjecture
• Some Conjectures on the Number of Primes in Certain Intervals