Waste less time on Facebook — follow Brilliant.
×

Seems simple?

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

Note by Achal Jain
2 months, 2 weeks ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

It is just Bertrand's postulate, applied as, \[ \frac{n}{2} < p < {n} \] Ameya Daigavane · 2 months, 2 weeks ago

Log in to reply

@Ameya Daigavane Thanks for sharing the wiki. Achal Jain · 2 months, 2 weeks ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...