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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Proposition: $\pi (2n) \ge \dfrac{\log \binom{ 2n }{n} }{\log 2n}$

Since this is a follow up proposition to this one: How can we show that $\operatorname{ord}_{p}\left(\binom{2n}n\right) \le \frac{\log 2n}{\log p}$

We can use : $$\operatorname{ord}_{p}\left(\binom{2n}n\right) \le \frac{\log 2n}{\log p}$$

attempt :

$$n \log 2 \le \sum_{p\le 2n}\left[\frac{\log 2n}{\log p}\right]\log p \le \sum_{p \le 2n} \log 2n = \pi(2n) \log 2n$$

(don't see how to "finish", if this is correct at all... )

share|cite|improve this question
What does $n\log 2$ have to do with $\log\binom{2n}{n}$? – anon Mar 15 '12 at 14:57
up vote 4 down vote accepted


$$\rm p\Big|\binom{2n}{n}\implies p|(2n)! \implies p\le 2n; $$

$$\rm m=\prod_{p|n} p^{\operatorname{ord}_p(m)}: \quad m=\binom{2n}{n}\implies \log \binom{2n}{n}=\sum_{p\le 2n}(\log p)\cdot\operatorname{ord}_p\binom{2n}{n} $$

share|cite|improve this answer
Thanks, anon. So $\log m = \sum_{p\le 2n} \log p ord_{p}m \le \sum_{p\le 2n} \frac{\log 2n}{\log p} \log p \le \sum_{p\le 2n} \log 2n = \pi(2n)\log 2n $ , right ? – VVV Mar 15 '12 at 16:25
@VVV: Yep, that's correct. – anon Mar 15 '12 at 16:31

Your Answer


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.