Prove that for every n ≥ 2 there exists a prime p with p≤n<2 p.
[Hint: In the case where n = 2k + 1; then by the Bertrand conjecture there exists a prime p such that k < p<2k.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.