Statement For every n > 1 there is always at least one prime $p$ such that $n < p < 2n$.
I am curious to know that if I replace that $2n$ by $2n-\epsilon$, (\epsilon>0) then what is the $\inf (\epsilon)$ so that the inequality still holds, meaning there is always a prime between $n$ and $2n-\epsilon$