Take the 2-minute tour ×
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.

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}$

share|improve this question
    
this MO link could help, –  Raymond Manzoni Aug 10 '12 at 18:46
add comment

1 Answer

up vote 5 down vote accepted

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.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.