<?xml version="1.0" encoding="UTF-8"?>

<record version="23" id="6309">
 <title>generalized binomial coefficients</title>
 <name>GeneralizedBinomialCoefficients</name>
 <created>2004-10-06 12:41:27</created>
 <modified>2006-10-06 13:40:40</modified>
 <type>Definition</type>
<parent id="273">binomial coefficient</parent>
 <creator id="2872" name="pahio"/>
 <author id="2872" name="pahio"/>
 <classification>
	<category scheme="msc" code="05A10"/>
	<category scheme="msc" code="11B65"/>
 </classification>
 <defines>
	<concept>Pascal's formula</concept>
	<concept>Vandermonde's formula</concept>
 </defines>
 <related>
	<object name="BinomialFormula"/>
	<object name="GeneralPower"/>
	<object name="BinomialFormulaForNegativeIntegerPowers"/>
 </related>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here</preamble>
 <content>The binomial coefficients
\begin{align}
    {n\choose r} = \frac{n!}{(n\!-\!r)!r!},
\end{align}
where $n$ is a non-negative integer and\, $r \in \{0,\,1,\,2,\,\ldots,\,n\}$,\,
can be generalized for all integer and non-integer values of $n$ by using the \PMlinkname{reduced}{Division} form
\begin{align}
    {n\choose r} = \frac{n(n\!-\!1)(n\!-\!2)\ldots(n\!-\!r\!+\!1)}{r!}; 
\end{align}
here $r$ may be any non-negative integer.\, Then \PMlinkname{Newton's binomial series}{BinomialFormula} gets the \PMlinkescapetext{simple} form 
\begin{align}
    (1\!+\!z)^{\alpha} = \sum_{r = 0}^{\infty}{\alpha\choose r}z^r 
 = 1\!+\!{\alpha\choose1}z\!+\!{\alpha\choose 2}z^2\!+\cdots
\end{align}
It is not hard to show that the radius of convergence of this series is 1.\, This series expansion is valid for every complex number $\alpha$ when\, $|z| &lt; 1$,\, and it presents such a \PMlinkname{branch}{GeneralPower} of the \PMlinkname{power}{GeneralPower} $(1\!+\!z)^{\alpha}$ which gets the value 1 in the point\, $z = 0$.

In the case that $\alpha$ is a non-negative integer and $r$ is great enough, one factor in the numerator of 
\begin{align}
{\alpha\choose r} = 
  \frac{\alpha(\alpha\!-\!1)(\alpha\!-\!2)\ldots(\alpha\!-\!r\!+\!1)}{r!} 
\end{align}
vanishes, and hence the corresponding binomial coefficient ${\alpha\choose r}$ equals to zero; accordingly also all following binomial coefficients with a greater $r$ are equal to zero.\, It means that the series is left to being a finite sum, which gives the binomial theorem.

For all complex values of $\alpha$, $\beta$ and non-negative integer values of $r$, $s$, the {\em Pascal's formula}
\begin{align}
  {\alpha\choose r}\!+\!{\alpha\choose r\!+\!1} = {{\alpha\!+\!1}\choose{r\!+\!1}}
\end{align}
and {\em Vandermonde's convolution}
\begin{align}
 \sum_{r = 0}^s{\alpha\choose r}\!{\beta\choose{s\!-\!r}} = {{\alpha\!+\!\beta}\choose s}
\end{align}
hold (the latter is proved by expanding the power $(1\!+\!z)^{\alpha+\beta}$ to series).\, Cf. Pascal's rule and Vandermonde identity.</content>
</record>
