Suppose that we choose some real number $\varepsilon >0$.
Can we always find $n_0(\varepsilon) \in \mathbb N$ such that for every $n> n_0(\varepsilon)$ there is a prime number $p$ such that we have $n<p<n(1+\varepsilon)$?
Suppose that we choose some real number $\varepsilon >0$.
Can we always find $n_0(\varepsilon) \in \mathbb N$ such that for every $n> n_0(\varepsilon)$ there is a prime number $p$ such that we have $n<p<n(1+\varepsilon)$?
yes, see: https://en.wikipedia.org/wiki/Bertrand%27s_postulate --> "Better results"