2
$\begingroup$

I'm looking for asymptotic estimate for the binomial coefficient: $$ \ln{\binom{n}{[\sqrt{n}]}} $$ I assume Stirling's approximation can help, but I'm not sure I will get any good estimation with this approach. Is there any good way to make an estimation for this coefficient? Thanks in advance.

$\endgroup$
  • 1
    $\begingroup$ Use $\ln(n!)=(n+1/2)\ln(n)-n+O(1)$ for all the three terms. $\endgroup$ – Shitikanth Oct 5 '12 at 20:14
1
$\begingroup$

Using Shitikanth's hint I think you're going to be coming up with $$\text{ln}{n \choose [\sqrt{n}]}\approx\text{ln}\left(\frac{n^{n+\sqrt{n}/2+3/4}}{\left(n-\sqrt{n}\right)^{1/2-\sqrt{n}+n}}\right).$$

$\endgroup$
  • $\begingroup$ Thank you. But I'm thinking if there is any other hints for this? I'm confused with sqrt(n), because if there is no special hint, why didn't they use any other parameter or number (like a, or whatever) instead of sqrt? $\endgroup$ – Kos Oct 6 '12 at 4:27
  • $\begingroup$ @Kos Well, I started with $\text{ln}{n \choose [\sqrt{n}]}=\text{ln}{(n)!}-\text{ln}(n - [\sqrt{n}])! + \text{ln}[\sqrt{n}]!$ and then use Shitikanth's expansion for all three terms, then I used the fact that $\sqrt{n}=n^{1/2}$ to help simplify at the end. $\endgroup$ – Alexander Gruber Oct 6 '12 at 4:39
  • $\begingroup$ It may just be that ${n \choose [\sqrt{n}]}$ is an important term in a lot of algorithms and that's why they put it in there. For what it's worth my answer looks right based on the plot of it: i.imgur.com/JOPFU.gif $\endgroup$ – Alexander Gruber Oct 6 '12 at 4:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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