×

# Seems simple?

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

Note by Achal Jain
4 months, 4 weeks ago

## Comments

Sort by:

Top Newest

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

Log in to reply

Thanks for sharing the wiki. · 4 months, 3 weeks ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...