| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
| First Prev [ 1 2 3 ] Next Last |
In mathematics, the factorial of a natural number n is the product of the positive integers less than or equal to n. This is written as n! and pronounced "n factorial". The notation n! was introduced by Christian Kramp in 1808.
Since the exclamation mark, "!", is sometimes pronounced "bang" or "shriek", these words are occasionally used colloquially for "factorial" in pronouncing equations like n!.
The factorial function is formally defined by
For example,
This definition implies in particular that
because the product of no numbers at all is 1 (see empty product for an account of that fact). Proper attention to the value of the empty product is important in this case, because
The factorial function can also be defined (for non-integer in addition to the usual integer values of z), via the gamma functionIn mathematics, the gamma function is a function that extends the concept of factorial to the complex numbers. Definition The notation Γ z is due to Adrien-Marie Legendre. If the real part of the complex number z is positive, then the integral : con:
The sequence of factorials (sequence A000142 in OEIS) for n = 0, 1, 2,... starts:
Factorials are important in combinatorics. For example, there are n! different ways of arranging n distinct objects in a sequence. (The arrangements are called permutationThis article is about permutation a mathematical concept. See permutation (music) for the application of this concept to music. In mathematics, the concept of a permutation expresses the idea that objects that can be distinguished may be arranged in varios.) 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
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 xn is n!. Factorials are also used extensively in probability theory.
Factorials are often used as a simple example when teaching recursion in computer science because they satisfy the following recursive relationship (if n ≥ 1):