Combinatorics Basic counting Theorem
Binomial theorem
Builds on Binomial coefficient
Statement
Let be a commutative ring, let , and let be a natural number. Then Here is the binomial coefficient, and the integer acts on by repeated addition.
Remarks
For it gives . For it gives . The formula stays true in a noncommutative ring when . With it gives the sum of binomial coefficients. With and it gives the alternating sum. The multinomial theorem extends it to sums of more than two terms.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binomial coefficient definition
- Binomial theorem statement
Further reading
About this page
| Tag | 0EHWPWGHB2 |
|---|---|
| URI | m2://0EHWPWGHB2 |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 05A10 |
| Status | This copy of the site has no build data. Run m2 status 0EHWPWGHB2. |
| Uses | Binomial coefficient |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.