Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
← 55 members online
 0 viewing
Let \( \pi(n)\) be the number of primes less or equal to n.
Show that
\[
n^{\pi(2n)\pi(n)}<4^{n}
\]
 one year ago
 one year ago
Let \( \pi(n)\) be the number of primes less or equal to n. Show that \[ n^{\pi(2n)\pi(n)}<4^{n} \]
 one year ago
 one year ago

This Question is Closed

mukushlaBest ResponseYou've already chosen the best response.2
sir i tried induction..but no result are we supposed to prove by induction or not?
 one year ago

eliassaabBest ResponseYou've already chosen the best response.0
The proof I know does not need induction.
 one year ago

sauravshakyaBest ResponseYou've already chosen the best response.0
@mukushla got any clue?
 one year ago

eliassaabBest ResponseYou've already chosen the best response.0
Hint \[ 4^n=(1+1)^{2n}> {2n \choose n} \]
 one year ago

mukushlaBest ResponseYou've already chosen the best response.2
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}\]
 one year ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.