Selected members of the factorial sequence (sequence A000142 in the OEIS); values specified in scientific notation are rounded to the displayed precision
The factorial function can also be extended to non-integer arguments while retaining its most important properties by defining x! = Γ(x + 1), where Γ is the gamma function; this is undefined when x is a negative integer.
This section needs expansion. You can help by adding to it. (November 2019)
The use of factorials is documented since the Talmudic period (200 to 500 CE), one of the earliest examples being the Hebrew Book of Creation Sefer Yetzirah which lists factorials as a means of counting permutations.^{[2]} Indian scholars have been using factorial formulas since at least the 12th century.^{[3]}Siddhānta Shiromani by Bhāskara II (c. 1114–1185) mentioned factorials for permutations in Volume I, the Līlāvatī. Fabian Stedman later described factorials as applied to change ringing, a musical art involving the ringing of several tuned bells.^{[4]} After describing a recursive approach, Stedman gives a statement of a factorial (using the language of the original):
Now the nature of these methods is such, that the changes on one number comprehends [includes] the changes on all lesser numbers ... insomuch that a compleat Peal of changes on one number seemeth to be formed by uniting of the compleat Peals on all lesser numbers into one entire body.^{[5]}
Notation[]
Factorial of n is denoted by n! or n.^{[6]} The notation n! was introduced by the French mathematician Christian Kramp in 1808.^{[7]}
There are several motivations for this definition:
For n = 0, the definition of n! as a product involves the product of no numbers at all, and so is an example of the broader convention that the product of no factors is equal to the multiplicative identity (see Empty product).
There is exactly one permutation of zero objects (with nothing to permute, the only rearrangement is to do nothing).
It makes many identities in combinatorics valid for all applicable sizes. The number of ways to choose 0 elements from the empty set is given by the binomial coefficient:
${\binom {0}{0}}={\frac {0!}{0!0!}}=1.$
More generally, the number of ways to choose all n elements among a set of n is:
${\binom {n}{n}}={\frac {n!}{n!0!}}=1.$
It allows for the compact expression of many formulae, such as the exponential function, as a power series:
$e^{x}=\sum _{n=0}^{\infty }{\frac {x^{n}}{n!}}.$
It extends the recurrence relation to 0.
It matches the gamma function $0!=\Gamma (0+1)=1$.
Applications[]
Although the factorial function has its roots in combinatorics, formulas involving factorials occur in many areas of mathematics.
There are n! different ways of arranging n distinct objects into a sequence, the permutations of those objects.^{[8]}^{[9]}
Often factorials appear in the denominator of a formula to account for the fact that ordering is to be ignored. A classical example is counting k-combinations (subsets of k elements) from a set with n elements. One can obtain such a combination by choosing a k-permutation: successively selecting and removing one element of the set, k times, for a total of
possibilities. This, however, produces the k-combinations in a particular order that one wishes to ignore; since each k-combination is obtained in k! different ways, the correct number of k-combinations is
This number is known^{[10]} as the binomial coefficient, because it is also the coefficient of x^{k} in (1 + x)^{n}. The term $n^{\underline {k}}$ is often called a falling factorial (pronounced "n to the falling k").
Factorials also turn up in calculus; for example, they occur in the denominators of the terms of Taylor's formula,^{[11]} where they are used as compensation terms due to the nth derivative of x^{n} being equivalent to n!.
Most approximations for n! are based on approximating its natural logarithm
$\ln n!=\sum _{x=1}^{n}\ln x\,.$
The graph of the function f(n) = ln n! is shown in the figure on the right. It looks approximately linear for all reasonable values of n, but this intuition is false. We get one of the simplest approximations for ln n! by bounding the sum with an integral from above and below as follows:
It is sometimes practical to use weaker but simpler estimates. Using the above formula it is easily shown that for all n we have (n/3)^{n} < n!, and for all n ≥ 6 we have n! < (n/2)^{n}.
Comparison of Stirling's approximation with the factorial
Both this and Stirling's approximation give a relative error on the order of 1/n^{3}, but Ramanujan's is about four times more accurate. However, if we use two correction terms in a Stirling-type approximation, as with Ramanujan's approximation, the relative error will be of order 1/n^{5}:^{[14]}
If efficiency is not a concern, computing factorials is trivial from an algorithmic point of view: successively multiplying a variable initialized to 1 by the integers up to n (if any) will compute n!, provided the result fits in the variable. In functional languages, the recursive definition is often implemented directly to illustrate recursive functions.
The main practical difficulty in computing factorials is the size of the result. To assure that the exact result will fit for all legal values of even the smallest commonly used integral type (8-bit signed integers) would require more than 700 bits, so no reasonable specification of a factorial function using fixed-size types can avoid questions of overflow. The values 12! and 20! are the largest factorials that can be stored in, respectively, the 32-bit and 64-bit integers commonly used in personal computers, however many languages support variable length integer types capable of calculating very large values.^{[15]}Floating-point representation of an approximated result allows going a bit further, but this also remains quite limited by possible overflow. Most calculators use scientific notation with 2-digit decimal exponents, and the largest factorial that fits is then 69!, because 69! < 10^{100} < 70!. Other implementations (such as computer software such as spreadsheet programs) can often handle larger values.
Most software applications will compute small factorials by direct multiplication or table lookup. Larger factorial values can be approximated using Stirling's formula. Wolfram Alpha can calculate exact results for the ceiling function and floor function applied to the binary, natural and common logarithm of n! for values of n up to 249999, and up to 20000000! for the integers.
If the exact values of large factorials are needed, they can be computed using arbitrary-precision arithmetic. Instead of doing the sequential multiplications ((1 × 2) × 3) × 4..., a program can partition the sequence into two parts, whose products are roughly the same size, and multiply them using a divide-and-conquer method. This is often more efficient.^{[16]}
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)^{2}), provided that a fast multiplication algorithm is used (for example, the Schönhage–Strassen algorithm).^{[17]} Peter Luschny presents source code and benchmarks for several efficient factorial algorithms, with or without the use of a prime sieve.^{[18]}
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 numberif and only if
where s_{p}(n) denotes the sum of the standard base-p digits of n.
Adding 1 to a factorial n! yields a number that is only divisible by primes that are larger than n. This fact can be used to prove Euclid's theorem that the number of primes is infinite.^{[21]} Primes of the form n! ± 1 are called factorial primes.
Although the sum of this series is an irrational number, it is possible to multiply the factorials by positive integers to produce a convergent series with a rational sum:
The convergence of this series to 1 can be seen from the fact that its partial sums are ${\frac {k!-1}{k!}}$.
Therefore, the factorials do not form an irrationality sequence.^{[22]}
Factorial of non-integer values[]
The gamma and pi functions[]
The gamma function interpolates the factorial function to non-integer values. The main clue is the recurrence relation generalized to a continuous domain.
Besides nonnegative integers, the factorial can also be defined for non-integer values, but this requires more advanced tools from mathematical analysis.
One function that fills in the values of the factorial (but with a shift of 1 in the argument), that is often used, is called the gamma function, denoted Γ(z). It is defined for all complex numbers z except for the non-positive integers, and given when the real part of z is positive by
Carl Friedrich Gauss used the notation Π(z) to denote the same function, but with argument shifted by 1, so that it agrees with the factorial for nonnegative integers. This pi function is defined by
$\Pi (z)=\int _{0}^{\infty }t^{z}e^{-t}\,dt.$
The pi function and gamma function are related by the formula Π(z) = Γ(z + 1). Likewise, Π(n) = n! for any nonnegative integer n.
The factorial function, generalized to all real numbers except negative integers. For example, 0! = 1! = 1, (−1/2)! = √π, 1/2! = √π/2.
In addition to this, the pi function satisfies the same recurrence as factorials do, but at every complex value z where it is defined
$\Pi (z)=z\Pi (z-1)\,.$
This is no longer a recurrence relation but a functional equation. In terms of the gamma function, it is
$\Gamma (n+1)=n\Gamma (n)\,.$
The values of these functions at half-integer values is therefore determined by a single one of them:
The pi function is certainly not the only way to extend factorials to a function defined at almost all complex values, and not even the only one that is analytic wherever it is defined. Nonetheless it is usually considered the most natural way to extend the values of the factorials to a complex function. For instance, the Bohr–Mollerup theorem states that the gamma function is the only function that takes the value 1 at 1, satisfies the functional equation Γ(n + 1) = nΓ(n), is meromorphic on the complex numbers, and is log-convex on the positive real axis. A similar statement holds for the pi function as well, using the Π(n) = nΠ(n − 1) functional equation.
However, there exist complex functions that are probably simpler in the sense of analytic function theory and which interpolate the factorial values. For example, Hadamard's 'gamma' function (Hadamard 1894) harv error: no target: CITEREFHadamard1894 (help) which, unlike the gamma function, is an entire function.^{[23]}
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:
Amplitude and phase of factorial of complex argument
Representation through the gamma function allows evaluation of factorial of complex argument. Equilines of amplitude and phase of factorial are shown in figure. Let
$f=\rho e^{i\varphi }=(x+iy)!=\Gamma (x+iy+1)\,.$
Several levels of constant modulus (amplitude) ρ and constant phase φ are shown. The grid covers the range −3 ≤ x ≤ 3, −2 ≤ y ≤ 2, with unit steps. The scratched line shows the level φ = ±π.
Thin lines show intermediate levels of constant modulus and constant phase. At the poles at every negative integer, phase and amplitude are not defined. Equilines are dense in vicinity of singularities along negative integer values of the argument.
For the large values of the argument, the factorial can be approximated through the logarithm of the gamma function, using a continued fraction representation. This approach is due to T. J. Stieltjes (1894).^{[24]} Writing
The continued fraction converges iff $\Re (z)>0$.^{[26]} The convergence is poor in the vicinity of the imaginary axis. When $\Re (z)>2$, the six coefficients above are sufficient for the evaluation of the factorial with complex double precision. For higher precision more coefficients can be computed by a rational QD scheme (Rutishauser's QD algorithm).^{[27]}
Non-extendability to negative integers[]
The relation n! = n × (n − 1)! allows one to compute the factorial for an integer given the factorial for a smaller integer. The relation can be inverted so that one can compute the factorial for an integer given the factorial for a larger integer:
$(n-1)!={\frac {n!}{n}}.$
However, this recursion does not permit us to compute the factorial of a negative integer; use of the formula to compute (−1)! would require a division of a nonzero value by zero, and thus blocks us from computing a factorial value for every negative integer. Similarly, the gamma function is not defined for zero or negative integers, though it is defined for all other complex numbers.
Factorial-like products and functions[]
There are several other integer sequences similar to the factorial that are used in mathematics:
Backward factorial[]
The notation $x^{(n)}$ is sometimes used to represent the product of the n integers counting up to and including x (i.e. ${\textstyle {\frac {x!}{(x-(n-1))!}}}$).^{[28]}
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 (see generalizations of the double factorial). The double factorial is the most commonly used variant, but one can similarly define the triple factorial (n!!!) and so on.^{[33]} One can define the k-tuple factorial, denoted by n!^{(k)}, recursively for positive integers as
In the same way that n! is not defined for negative integers, and n!! is not defined for negative even integers, n!^{(k)} is not defined for negative integers divisible by k.
The primorial of a natural number n (sequence A002110 in the OEIS), denoted n#, is similar to the factorial, but with the product taken only over the prime numbers less than or equal to n. That is,
$n\#=\prod _{p\leq n}p,$
where p ranges over the prime numbers less than or equal to n. For example, the primorial of 11 is
$11\#=11\times 7\times 5\times 3\times 2=2310.$
Compositorial[]
The compositorial of a natural number n (sequence A036691 in the OEIS) is similar to the factorial, but with the product taken only over the composite numbers less than or equal to n. For example, the compositorial of 11 is
$10\times 9\times 8\times 6\times 4=17280.$
Subfactorial[]
The subfactorial yields the number of derangements of a set of $n$ objects. Its value is:
where $n\in \mathbb {Z} ^{+}\cup \{0\}$ and "nint" denotes the function which rounds its input to the nearest integer (there will never be any ambiguity/ties in this case because $n!$ is always an integer and $e$ is an algebraically-independent transcendental, namely the natural base/Euler's number).
Neil Sloane and Simon Plouffe defined a superfactorial in The Encyclopedia of Integer Sequences (Academic Press, 1995) to be the product of the first n factorials. So the superfactorial of 4 is
The superfactorials can be extended to all complex numbers with the Barnes G-function, such that $G(n)=\operatorname {sf} (n)$ for all positive integers n. The sequence of superfactorials starts (from n = 0) as
1, 1, 2, 12, 288, 34560, 24883200, 125411328000,... (sequence A000178 in the OEIS)
By this definition, we can define the k-superfactorial of n (denoted sf_{k}(n)) as:
For n = 1, 2, 3, 4,... the values of H(n) are 1, 4, 108, 27648,... (sequence A002109 in the OEIS).
The asymptotic growth rate is
$H(n)\sim An^{(6n^{2}+6n+1)/12}e^{-n^{2}/4}$
where A = 1.2824... is the Glaisher–Kinkelin constant.^{[34]}H(14) ≈ 1.8474×10^{99} is already almost equal to a googol, and H(15) ≈ 8.0896×10^{116} is almost of the same magnitude as the Shannon number, the theoretical number of possible chess games. Compared to the Pickover definition of the superfactorial, the hyperfactorial grows relatively slowly.
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.
^Char, Bruce W. (April 1980). "On Stieltjes' Continued Fraction for the Gamma Function". Mathematics of Computation. 34 (150): 547–551. doi:10.2307/2006103. JSTOR2006103.
^"5.10". Digital Library of Mathematical Functions. Archived from the original on 2010-05-29. Retrieved 2010-10-17.
^Dale, M. R. T.; Moon, J. W. (1993), "The permuted analogues of three Catalan sets", Journal of Statistical Planning and Inference, 34 (1): 75–87, doi:10.1016/0378-3758(93)90035-5, MR1209991.
^Weisstein, Eric W. "Multifactorial". mathworld.wolfram.com. Retrieved 2021-07-18.
Higgins, Peter (2008), Number Story: From Counting to Cryptography, New York: Copernicus, ISBN978-1-84800-000-1
Stedman, Fabian (1677), Campanalogia, London The publisher is given as "W.S." who may have been William Smith, possibly acting as agent for the Society of College Youths, to which society the "Dedicatory" is addressed.