×

# Seems simple?

Prove that for every natural number $$n$$, there exists a prime number $$p$$ such that $$p < n < 2p$$.

Note by Achal Jain
8 months, 2 weeks ago

Sort by:

It is just Bertrand's postulate, applied as, $\frac{n}{2} < p < {n}$ · 8 months, 2 weeks ago