Factorial: Difference between revisions
Added basic information about factorials |
Rearranged for more wiki-like appearance |
||
| Line 1: | Line 1: | ||
The '''factorial''' is an important concept in [[combinatorics]], used to determine the number of ways to arrange objects. | |||
=== Definition === | === Definition === | ||
The factorial is defined for positive integers as <math>n!=n \cdot (n-1) \cdots 2 \cdot 1</math> Alternatively, a recursive definition for the factorial is: <math>n!=n \cdot (n-1)!</math>. | |||
=== Additional Information === | === Additional Information === | ||
Revision as of 12:24, 18 June 2006
The factorial is an important concept in combinatorics, used to determine the number of ways to arrange objects.
Definition
The factorial is defined for positive integers as 
Alternatively, a recursive definition for the factorial is: 
.
Additional Information
By convention, 
is given the value 
.
The gamma function is a generalization of the factorial to values other than positive integers.
Uses
The factorial is used in the definitions of combinations and permutations, as 
is the number of ways to order 
distinct objects.
