FACTORIAL

$n$	$n!$
0	1
1	1
2	2
3	6
4	24
5	120
6	720
7	5040
8	40320
9	362880
10	3628800
15	1307674368000
20	2432902008176640000
25	15511210043330985984000000
50	3.04140932... × 1064
70	1.19785717... × 10100
450	1.73336873... × 101,000
3249	6.41233768... × 1010,000
25206	1.205703438... × 10100,000

{{caption|The first few and selected larger members of the sequence of factorials

In mathematics, the 'factorial' of a non-negative integer $n$ is the product of all positive integers less than or equal to $n$. For example,
:$5\; !\; =\; 1cdot\; 2\; cdot\; 3\; cdot\; 4\; cdot\; 5\; =\; 120$
:
:and
:
:$6\; !\; =\; 1cdot\; 2\; cdot\; 3\; cdot\; 4\; cdot\; 5\; cdot\; 6=\; 720$
where $n!$ represents n factorial.
The notation $n!$ was introduced by Christian Kramp in 1808.
__TOC__

Contents

Definition

Applications

Number theory

Rate of growth

Computation

The gamma function

Applications of the gamma function

Factorial-like products

Primorial

Double factorial

Multifactorials

Quadruple factorial

Superfactorials

Superfactorials (alternative definition)

Hyperfactorials

See also

References

External links

Definition

The factorial function is formally defined by
:
The above definition incorporates the instance
:$0!\; =\; 1$
as an instance of the fact that the product of no numbers at all is 1. This fact for factorials is useful, because

★ the recursive relation $(n\; +\; 1)!\; =\; n!\; imes\; (n\; +\; 1)$ works for $n\; =\; 0$;

★ this definition makes many identities in combinatorics valid for zero sizes.

★
★ In particular, the number of combinations or permutations of an empty set is, clearly, 1.

Applications

★ Factorials are important in combinatorics. For example, there are $n!$ different ways of arranging $n$ distinct objects in a sequence. (The arrangements are called permutations.) And the number of ways one can choose $k$ objects from among a given set of $n$ objects (the number of combinations), is given by the so-called binomial coefficient
:$\{nchoose\; k\}=\{n!over\; k!(n-k)!\}.$

★ In permutations, if $r$ objects can be chosen and arranged in $r$ different ways from a total of $n$ objects, where , then the total number of distinct permutations is given by:
::

★ Factorials also turn up in calculus. For example, Taylor's theorem expresses a function $f(x)$ as a power series in $x$, basically because the ''n''^th derivative of $x^n$ is $n!$.

★ Factorials are also used extensively in probability theory.

★ Factorials are often used as a simple example, along with Fibonacci numbers, when teaching recursion in computer science because they satisfy the following recursive relationship (if $n\; ge\; 1$):
::$n!\; =\; n\; imes\; (n-1)!.,$

Number theory

Factorials have many applications in number theory. In particular, $n!$ is necessarily divisible by all prime numbers up to and including $n$. As a consequence, $n\; >\; 5$ is a composite number if and only if
:$(n-1)!\; equiv\; 0\; (\{$
m mod} n).
A stronger result is Wilson's theorem, which states that
:$(p-1)!\; equiv\; -1\; (\{$
m mod} p)
if and only if $p$ is prime.
Adrien-Marie Legendre found that the multiplicity of the prime $p$ occurring in the prime factorization of $n!$ can be expressed exactly as
:$sum\_\{i=1\}^\{infty\}\; lfloor\; n/p^i$
floor,
which is finite since the floor function removes all $p^i\; >\; n$.
The only factorial that is also a prime number is 2, but there are many primes of the form $n!\; pm\; 1$. These are called factorial primes.

Rate of growth

As $n$ grows, the factorial $n!$ becomes larger than all polynomials and exponential functions in $n$.
When $n$ is large, $n!$ can be estimated quite accurately using Stirling's approximation:
:
ight)^n.
A weak version that can be proved with mathematical induction is
:$left(\{n\; over\; 3\}$
ight)^n < n! < left({n over 2}
ight)^n mbox{if} ngeq 6.,
The logarithm of the factorial can be used to calculate the number of digits in a given base the factorial of a given number will take. $log(n!)$ can easily be calculated as follows:
:$sum\_\{k=1\}^n\{log\; k\}.$
Note that this function, if graphed, is approximately linear, for small values; but the factor $\{log\; n!\}\; over\; n$ does grow arbitrarily large, although quite slowly. The graph of $log(n!)$ for $n$ between 0 and 20,000 is shown in the figure on the right.
A simple approximation for $ln(n!)$ based on Stirling's approximation is
:
A much better approximation for $ln(n!)$ was given by Srinivasa Ramanujan
:
One can see from this that $log(n!)$ is Ο(''n'' log ''n''). This result plays a key role in the analysis of the computational complexity of sorting algorithms (see comparison sort).

Computation

The value of $n!$ can be calculated by repeated multiplication if $n$ is not too large. The largest factorial that most calculators can handle is $69!$, because $70!\; >\; 10^\{100\}$. Computer programs such as Microsoft Excel and Google Calculator can handle factorials as large as $170!$, which is the largest factorial less than $16^\{256\}$ ($10^\{100\}$ in ''hexadecimal'') and corresponds to a 2048 bit integer. $11!$ and $20!$ are respectively the largest factorials that can be stored in the 32 bit and 64 bit integers commonly used in personal computers. In practice, most software applications will compute these small factorials by direct multiplication or table lookup. Larger values are often approximated in terms of floating-point estimates of the Gamma function, usually with Stirling's formula.
For number theoretic and combinatorial computations, very large exact factorials are often needed. Bignum factorials can be computed by direct multiplication, but multiplying the sequence $1\; imes\; 2\; imes\; ...\; imes\; n$ from the bottom up (or top-down) is inefficient; it is better to recursively split the sequence so that the size of each subproduct is minimized.
The asymptotically-best efficiency is obtained by computing $n!$ from its prime factorization. As documented by Peter Borwein, prime factorization allows $n!$ to be computed in time O(''n''(log ''n'' log log ''n'')²), provided that a fast multiplication algorithm is used (for example, the Schönhage-Strassen algorithm).^[1] Peter Luschny presents source code and benchmarks for several efficient factorial algorithms, with or without the use of a prime sieve.^[2]

The gamma function

The factorial function can also be defined for non-integer values, but this requires more advanced tools from mathematical analysis. The function that "fills in" the values of the factorial between the integers is called the Gamma function, denoted $Gamma(z)$ for no z integers less than 1, defined by
:$Gamma(z)=int\_\{0\}^\{infty\}\; t^\{z-1\}\; e^\{-t\},\; mathrm\{d\}t.\; !$
Euler's original formula for the Gamma function was
:
The Gamma function is related to factorials in that it satisfies a similar recursive relationship:
:$n!=n(n-1)!\; ,$
:$Gamma(n+1)=nGamma(n)\; ,$
Together with $Gamma(1)=1$ this yields the equation for any nonnegative integer $n$:
:$Gamma(n+1)=n!,!$
:
ight )! = rac{sqrt{pi}}{2}
Based on the Gamma function's value for 1/2, the specific example of half-integer factorials is resolved to
:
ight )!=sqrt{pi} imes prod_{k=0}^n {2k + 1 over 2}.
For example
:
The Gamma function is in fact defined for all complex numbers $z$ except for the nonpositive integers $(z\; =\; 0,\; -1,\; -2,\; ...)$. It is often thought of as a generalization of the factorial function to the complex domain, which is justified for the following reasons:

★ Shared meaning. The canonical definition of the factorial function shares the same recursive relationship with the Gamma function.

★ Context. The Gamma function is generally used in a context similar to that of the factorials (but, of course, where a more general domain is of interest).

★ Uniqueness (Bohr–Mollerup theorem). The Gamma function is the only function which satisfies the aforementioned recursive relationship for the domain of complex numbers, is meromorphic, and is log-convex on the positive real axis. That is, it is the only smooth, log-convex function that could be a generalization of the factorial function to all complex numbers.
Euler also developed a convergent product approximation for the non-integer factorials, which can be seen to be equivalent to the formula for the Gamma function above:
:
ight)^nrac{1}{n+1}
ight]left[ left(rac{3}{2}
ight)^nrac{2}{n+2}
ight]left[ left(rac{4}{3}
ight)^nrac{3}{n+3}
ight]...
The product converges quickly for small values of $n$.

Applications of the gamma function

★ The volume of an $n$-dimensional hypersphere can be expressed as:
::$V\_n=\{pi^\{n/2\}R^nover\; Gamma((n/2)+1)\}.$

Factorial-like products

There are several other integer sequences similar to the factorial that are used in mathematics:

Primorial

The primorial is similar to the factorial, but with the product taken only over the prime numbers.

Double factorial

$n!!$ denotes the 'double factorial' of $n$ and is defined recursively by
:$$
n!!=
left{
egin{array}{ll}
1, &mbox{if }n=-1mbox{ or }n=0mbox{ or }n=1;
\
n(n-2)!! &mbox{if }nge2.qquadqquad
end{array}

ight.

For example, 8!! = 2 · 4 · 6 · 8 = 384 and 9!! = 1 · 3 · 5 · 7 · 9 = 945. The sequence of double factorials for $n\; =\; 0,\; 1,\; 2,\; ...$ starts as
: 1, 1, 2, 3, 8, 15, 48, 105, 384, 945, 3840, ...
The above definition can be used to define double factorials of negative numbers:
:
The sequence of double factorials for $n=\; -1,\; -3,\; -5,\; -7,\; dots,$ starts as
: $1,\; -1,\; 1/3,\; -1/15\; ...$
while the double factorial of negative even integers is infinite.
Some identities involving double factorials are:
:$n!=n!!(n-1)!!\; ,$
:$(2n)!!=2^nn!\; ,$
:$(2n+1)!!=\{(2n+1)!over(2n)!!\}=\{(2n+1)!over2^nn!\}$
:$Gammaleft(n+\{1over2\}$
ight)=sqrt{pi},,{(2n-1)!!over2^n}
:$Gammaleft(\{nover2\}+1$
ight)=sqrt{pi},,{n!!over2^{(n+1)/2}}
where $Gamma$ is the Gamma function. The last equation above can be used to define the double factorial as a function of any complex number $n$
eq 0, just as the Gamma function generalizes the factorial function. One should be careful not to interpret $n!!$ as the factorial of $n!$, which would be written $(n!)!$ and is a much larger number (for $n\; >\; 2$).

Multifactorials

A common related notation is to use multiple exclamation points to denote a 'multifactorial', the product of integers in steps of two ($n!!$), three ($n!!!$), or more. The double factorial is the most commonly used variant, but one can similarly define the triple factorial ($n!!!$) and so on. In general, the ''k''^th factorial, denoted by $n!^\{(k)\}$, is defined recursively as
:$$
n!^{(k)}=
left{
egin{matrix}
1,qquadqquad &&mbox{if }0le n \
n(n-k)!^{(k)},&&mbox{if }nge k.quad ,
end{matrix}

ight.

Some mathematicians have suggested an alternative notation of $n!\_2$ for the double factorial and similarly $n!\_k$ for other multifactorials, but this has not come into general use.

Quadruple factorial

The quadruple factorial, however, is not a multifactorial; it is a much larger number given by .

Superfactorials

Neil Sloane and Simon Plouffe defined the 'superfactorial' in 1995 as the product of the first $n$ factorials. So the superfactorial of 4 is
:$mathrm\{sf\}(4)=1!\; imes\; 2!\; imes\; 3!\; imes\; 4!=288\; ,$
In general
:$$
mathrm{sf}(n)
=prod_{k=1}^n k! =prod_{k=1}^n k^{n-k+1}
=1^ncdot2^{n-1}cdot3^{n-2}cdots(n-1)^2cdot n^1.

The sequence of superfactorials starts (from $n\; =\; 0$) as
:1, 1, 2, 12, 288, 34560, 24883200, ...
This idea was extended in 2000 by Henry Bottomley to the 'superduperfactorial' as the product of the first $n$ superfactorials, starting (from $n\; =\; 0$) as
:1, 1, 2, 24, 6912, 238878720, 5944066965504000, ...
and thus recursively to any 'multiple-level factorial' where the ''m''^th-level factorial of $n$ is the product of the first $n$ $(m\; -\; 1)$^th-level factorials, i.e.
:$mathrm\{mf\}(n,m)\; =\; mathrm\{mf\}(n-1,m)mathrm\{mf\}(n,m-1)$
=prod_{k=1}^n k^{n-k+m-1 choose n-k}
where $mathrm\{mf\}(n,0)=n$ for $n>0$ and $mathrm\{mf\}(0,m)=1$.

Superfactorials (alternative definition)

Clifford Pickover in his 1995 book ''Keys to Infinity'' defined the 'superfactorial' of $n$ as
:
or as,
:$nmathrm\{S\}!!!!!;,\{!\}=n!^\{(4)\}n!\; ,$
where the ⁽⁴⁾ notation denotes the hyper4 operator, or using Knuth's up-arrow notation,
:$nmathrm\{S\}!!!!!;,\{!\}=(n!)uparrowuparrow(n!)\; ,$
This sequence of superfactorials starts:
:$1mathrm\{S\}!!!!!;,\{!\}=1\; ,$
:$2mathrm\{S\}!!!!!;,\{!\}=2^2=4\; ,$
:$3mathrm\{S\}!!!!!;,\{!\}=6uparrowuparrow6=6^\{6^\{6^\{6^\{6^6\}\}\}\}$

Hyperfactorials

Occasionally the 'hyperfactorial' of $n$ is considered. It is written as $H(n)$ and defined by
:$$
H(n)
=prod_{k=1}^n k^k
=1^1cdot2^2cdot3^3cdots(n-1)^{n-1}cdot n^n.

For ''n'' = 1, 2, 3, 4, ... the values ''H''(''n'') are 1, 4, 108, 27648,... .
The hyperfactorial function is similar to the factorial, but produces larger numbers. The rate of growth of this function, however, is not much larger than a regular factorial. However, ''H''(14) = 1.85...×10⁹⁹ is already almost equal to a googol, and ''H''(15) = 8.09...×10¹¹³ is almost of the same magnitiude as the Shannon number, the theoretical number of possible chess games.
The hyperfactorial function can be generalized to complex numbers in a similar way as the factorial function. The resulting function is called the K-function.

See also

★ Alternating factorial

★ Digamma function

★ Exponential factorial

★ Factorial prime

★ Factoradic

★ Stirling's approximation

★ Triangular number, the additive analogue of factorial

References

1. Peter Borwein. "On the Complexity of Calculating Factorials". ''Journal of Algorithms'' 6, 376-380 (1985)
2. Peter Luschny, ''The Homepage of Factorial Algorithms''.

External links

★ Approximation formulas

★ All about factorial notation n!

★ The Dictionary of Large Numbers

★

★ "Factorial Factoids" by Paul Niquette

★
;Factorial calculators

★ Factorial Up to 170!

★ Factorial Calculator Utility Up to 984!
;Factorial lists

★ Up to 999!