Math 2.0

statement theorem

Closed formula for Catalan numbers

Statement

Let nn be a natural number, and let CnC_n be the nn-th Catalan number. Then Cn=1n+1(2nn)=(2n)!(n+1)! n!.C_n = \frac{1}{n + 1} \binom{2n}{n} = \frac{(2n)!}{(n + 1)!\, n!}.

Remarks

The fraction is an integer, because Cn=(2nn)−(2nn+1)C_n = \binom{2n}{n} - \binom{2n}{n+1}. The numerator (2nn)\binom{2n}{n} is the central binomial coefficient. Example: C4=15(84)=705=14C_4 = \frac{1}{5} \binom{8}{4} = \frac{70}{5} = 14.

Explanations

L1 human

Among the (2nn)\binom{2n}{n} grid paths from (0,0)(0, 0) to (n,n)(n, n), exactly one in n+1n + 1 stays below the diagonal. So the Catalan number is the central binomial coefficient divided by n+1n + 1.

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 4 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. Catalan numbers definition
  3. Central binomial coefficient definition
  4. Closed formula for Catalan numbers statement

Sources

  1. Web https://en.wikipedia.org/wiki/Catalan_number, Proof of the formula