Is there an upper bound for $\pi (n)-\pi (n/2)$?

317 Views Asked by At

Is there a nice upper bound for $\pi (n)-\pi (n/2)$ where $\pi$ is the prime counting function?

enter image description here

1

There are 1 best solutions below

3
On BEST ANSWER

$\frac{n}{ln(n)}<\pi(n)<1.25506\frac{n}{ln(n)}$ for $n\geq 17$

See Rosser, Schoenfeld 1961 corollary 1.

Provides:

$\pi(n)-\pi(\frac{n}{2})<\left(1.25506\frac{n}{ln(n)}-\frac{\frac{n}{2}}{ln(n/2)} \right)$

Bound Comparison from 1 to 200