Math 2.0

statement theorem

Symmetry of binomial coefficients

Statement

Let nn and kk be natural numbers with k≤nk \le n. Then (nk)=(nn−k).\binom{n}{k} = \binom{n}{n - k}.

Remarks

For a set XX with nn elements, the map S↦X∖SS \mapsto X \setminus S is a bijection from the kk-subsets of XX to the (n−k)(n-k)-subsets. This is a bijective proof of the identity. The identity makes each row of Pascal's triangle read the same from left to right and from right to left.

Explanations

L1 human

To choose kk people for a team is the same as to choose the n−kn - k people who stay out. For example, (52)=(53)=10\binom{5}{2} = \binom{5}{3} = 10.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Binomial coefficient definition
  2. Symmetry of binomial coefficients statement

Sources

  1. Web https://en.wikipedia.org/wiki/Binomial_coefficient, Factorial formula