Math 2.0

definition

Binomial coefficient

Definition

Let nn and kk be natural numbers. The binomial coefficient (nk)\binom{n}{k}, read "nn choose kk", is the natural number defined by the recursion (n0)=1,(0k+1)=0,(n+1k+1)=(nk)+(nk+1).\binom{n}{0} = 1, \qquad \binom{0}{k+1} = 0, \qquad \binom{n+1}{k+1} = \binom{n}{k} + \binom{n}{k+1}.

Remarks

The value (nk)\binom{n}{k} is the number of k-element subsets of an nn-element set. Many texts take this as the definition. For k>nk > n, (nk)=0\binom{n}{k} = 0. For k≤nk \le n, the factorial formula gives (nk)=n!k! (n−k)!\binom{n}{k} = \frac{n!}{k!\,(n-k)!}. The recursion is Pascal's rule, and the values form Pascal's triangle.

Explanations

L1 human

The number (nk)\binom{n}{k} tells how many ways there are to choose kk objects out of nn when the order does not matter. For example, (42)=6\binom{4}{2} = 6: from {1,2,3,4}\{1, 2, 3, 4\} you can choose 12,13,14,23,24,3412, 13, 14, 23, 24, 34.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

22 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Binomial_coefficient, Definition and interpretations