How to prove that $\prod_{p\leqslant{x}}p\leqslant4^{x-1},\ \forall x\geqslant2$,
where product is taken over all prime numbers $p\leqslant{x}$
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|||
|
|
One proof of this fact is the proof of Claim 2.2 of these notes on Erdos' proof of Bertrand's postulate by David Galvin. |
|||
|
|