Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with binomial-coefficients
Search options not deleted
user 67100
For questions that explicitly reference the binomial coefficients, Pascal's Triangle, and Binomial identities.
2
votes
2
answers
363
views
Estimation of a combinatorial sum when $n$ is large
Suppose $c,t$ are such that, $0< c< 1$ constant and $cn\leq t \leq n$.
I want to have an estimation of
$\sum _{i=0}^{cn} {cn\choose {i}}{(1-c)n \choose t-i} 2^{t-i}$
when n goes to infinity.
Can I …
- 228