Math 2.0

Combinatorics Lemma

Half-integer binomial coefficient formula

Builds on Central binomial coefficientFalling factorial

Statement

For a real number rr and a natural number kk, let (rk)\binom{r}{k} be the generalized binomial coefficient r(r−1)⋯(r−k+1)k!\frac{r(r-1)\cdots(r-k+1)}{k!}, that is, the falling factorial of rr of length kk divided by k!k!.

Let k≥1k \ge 1 be an integer. Then (1/2k)=(−1)k−1k⋅(2k−2k−1)22k−1.\binom{1/2}{k} = \frac{(-1)^{k-1}}{k} \cdot \frac{\binom{2k-2}{k-1}}{2^{2k-1}}.

Remarks

The number (2k−2k−1)\binom{2k-2}{k-1} is the (k−1)(k-1)-th central binomial coefficient.

Example: for k=1k = 1 the right side is 11⋅12=12\frac{1}{1} \cdot \frac{1}{2} = \frac{1}{2}. For k=2k = 2 it is −12⋅28=−18-\frac{1}{2} \cdot \frac{2}{8} = -\frac{1}{8}. Both agree with the left side.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Central binomial coefficient definition
  2. Falling factorial concept
  3. Half-integer binomial coefficient formula statement

Further reading

  1. Web https://github.com/mitchkeller/applied-combinatorics/blob/ebd95d6bd59e23c633c65cf560bcb93efa912aae/source/s_recurrence_rubots.ptx#L40, source/s_recurrence_rubots.ptx:40
About this page
Tag2WXZAJSBKV
URIm2://2WXZAJSBKV
Kindstatement, lemma
WritingW0 stub
MSC05A10
StatusThis copy of the site has no build data. Run m2 status 2WXZAJSBKV.
UsesCentral binomial coefficient, Falling factorial
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.