MathDB
E 34

Source:

May 25, 2007
blogs

Problem Statement

Let pnp_{n} denote the nnth prime number. For all n6n \ge 6, prove that π(p1p2pn)>2n.\pi \left( \sqrt{p_{1}p_{2}\cdots p_{n}}\right) > 2n.