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

<record version="17" id="516">
 <title>factorial</title>
 <name>Factorial</name>
 <created>2001-10-26 03:07:34</created>
 <modified>2006-10-09 16:34:38</modified>
 <type>Definition</type>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <author id="23" name="Riemann"/>
 <classification>
	<category scheme="msc" code="05A10"/>
	<category scheme="msc" code="11B65"/>
 </classification>
 <synonyms>
	<synonym concept="factorial" alias="factorial function"/>
 </synonyms>
 <related>
	<object name="BinomialCoefficient"/>
	<object name="ExponentialFactorial"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}</preamble>
 <content>\PMlinkescapeword{word}

For any non-negative integer $n$, the {\em factorial} of $n$, denoted $n!$, can be defined by
$$n!=\prod_{r=1}^n r$$
where for $n=0$ the empty product is taken to be $1$.

Alternatively, the factorial can be defined recursively by $0!=1$ and $n!=n(n-1)!$ for $n&gt;0$.

$n!$ is equal to the number of permutations of $n$ distinct objects.
For example, there are $5!$ ways to arrange the five letters A, B, C, D and E into a word.

For every non-negative integer $n$ we have
$$\Gamma(n+1) = n!$$
where $\Gamma$ is Euler's gamma function.
In this way the notion of factorial can be generalized to all \PMlinkname{complex}{Complex} values except the negative integers.</content>
</record>
