Bertrand’s Postulate

For every $n > 1$ there exists a prime between $n$ and $2n$ i.e $n < p < 2n$ . This was first proved by Chebyshev.

	Sumant Sumant on A Geometry problem solved usin…
	sajithaa84a66b60d2 on A Geometry problem solved usin…
	Sumant Sumant on Angles between the diagonals o…
	pherlop300 on Evaporating water from a hemis…
	disho74 on IB SL Find the least positive…

About Sumant Sumant