This is an old revision of the document!
Binomial coefficient over the complex numbers
Function
| definition | $??$ |
| definition | ${x\choose{y}} := \dfrac{1}{\Gamma(y+1)}\dfrac{\Gamma(x+1)}{\Gamma((x+1)-(y+1)+1)}$ |
Discussion
For natural numbers $n\ge{k}$ we get
${n\choose{k}} = \dfrac{1}{k!}\dfrac{n!}{(n-k)!}$
Theorems
${m\choose{m}} = 1$
${m\choose{0}} = 1$
Pascal's identity (recursive formula)
${n\choose{k}} = {n\choose{k-1}} + {n-1\choose{k-1}}$
From this it's also clear that ${n\choose{k}}$ is a sum of 1's, i.e. an integer.
(* Random generalization of linear such recursive schemes *)
F[m_, 0] = a;
F[0, m_] = b;
F[m_, m_] = c;
F[n_, k_] := A*F[n, k - 1] + B*F[n - 1, k] + C*F[n - 1, k - 1]
Table[{n, k, F[n, k]}, {n, 0, 4}, {k, 0, 4}] // TableForm
Reference
Wikipedia: Binomial coefficient
Requirements
