## eliassaab Group Title Let $$\pi(n)$$ be the number of primes less or equal to n. Show that $n^{\pi(2n)-\pi(n)}<4^{n}$ 2 years ago 2 years ago

1. mukushla

sir i tried induction..but no result are we supposed to prove by induction or not?

2. eliassaab

The proof I know does not need induction.

3. sauravshakya

@mukushla got any clue?

4. mukushla

nope :(

5. eliassaab

Hint $4^n=(1+1)^{2n}> {2n \choose n}$

6. mukushla

for $$n\le p_k\le 2n$$$\prod p_k | \frac{(n+1)(n+2)...(2n)}{n!}={2n \choose n} \Rightarrow\prod p_k <{2n \choose n}$$n^{\pi(2n)-\pi(n)}< \prod p_k<\binom{2n}{n}< 2^{2n}=4^{n}$