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 177751
For questions that explicitly reference the binomial coefficients, Pascal's Triangle, and Binomial identities.
1
vote
Closed form for a binomial product sum
For $j = 0$, the summand ${n \choose i_1} \cdots {i_{k - 1} \choose i_k}$ is counting the number of length $k+1$ chains $\{1, \ldots, n\} =: S_0 \supsetneq S_1 \supsetneq S_2 \supsetneq \cdots \supset …
- 204