# Statement For every n &gt; 1 there is always at least one prime p such that n

Statement For every $n>1$ there is always at least one prime $p$ such that $n.
I am curious to know that if I replace that $2n$ by $2n-ϵ$, ($ϵ>0$) then what is the $inf\left(ϵ\right)$ so that the inequality still holds, meaning there is always a prime between $n$ and $2n-ϵ$
You can still ask an expert for help

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

Gornil2
Three related points are worthy of mention, showing that epsilon can be close to n.

There is a result of Finsler that approximates how many primes lie between n and 2n, which is of order o(n/log(n)) as is to be expected by the Prime Number Theorem.

Literature on prime gaps will tell you the exponent delta such that there is (for sufficiently large n) at least one prime in the interval (n , n + n^delta). I think delta is less than 11/20.

Observed data suggests that n^delta can be replaced by something much smaller: for n between something like 3 and 10^14 , some function like 2(log(n))^2 works
###### Did you like this example?
Ayaan Barr
Bertrand's postulate is
if $n>3$ is an integer, then there always exists at least one prime number p with $n
Thus $\xi <2$ for $n>3$. What if $n\le 3$?

For $n=3,3<5<6-\xi ⇒\xi <1$
For $n=2,2<3<4-\xi ⇒\xi <1$

Hence we have $0<\xi <1$, if ε is a constant.