statement theorem
Hockey-stick identity
Statement
Let and be natural numbers with . Then
Remarks
For it gives . Combinatorial proof: classify the -subsets of by their largest element . The other elements come from . In Pascal's triangle the summands lie on a diagonal, and the result lies below the end of the diagonal. This shape is the reason for the name.
Explanations
L1 human
Add the entries of Pascal's triangle along a diagonal, from the edge downward. The total is the entry just below and to the side of the last one, so the picture looks like a hockey stick.
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Binomial coefficient definition
- Hockey-stick identity statement
Sources
- Web https://en.wikipedia.org/wiki/Hockey-stick_identity, Formulations
What links here
No node links to this node yet.