## You are here

Homefactorial

## Primary tabs

# factorial

For any non-negative integer $n$, the 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>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 complex values except the negative integers.

Related:

BinomialCoefficient, ExponentialFactorial

Synonym:

factorial function

Type of Math Object:

Definition

Major Section:

Reference

Groups audience:

## Mathematics Subject Classification

05A10*no label found*11B65

*no label found*92-01

*no label found*92B05

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella