# Introducing the Factorial: the Exclamation Mark of Math

Home / Introducing the Factorial: the Exclamation Mark of Math

Last Updated on

The formula for “choosing ‘k’ permutations from a set of ‘n’ elements’ = P(n, k) = (n!)/( (n-k)! ). For set ‘C’, this was 3!/1! = 6/1 = 6.

Finally for this section, the number of “k-subsets” also is calculated with factorials. This is the problem for combining selected elements but without regard to permuting them into various sequences. From set ‘C’ above, the three 2-subsets are {a,b}, {a,c}, {b,c}.

The formula for combining or “choosing” k-subsets is usually shown in the above image, where C(n, k) = (n!)/( k! * (n-k)! ).

These concepts and formulas are useful in discrete probabilty theory, where one must determine the proportion of items that might be selected versus all the combinations that could be chosen.

## Extending the Factorial Beyond Positive Integers

The first and simplest extension is to define “zero factorial” = 0! = 1, for the reason that there is exactly one way to arrange zero objects. In other words, the empty set, {}, has exactly that one permutation.

The gamma function for positive integers is defined as Γ(n) = (n-1)!. This is not an extension of the factorial function, but simply defines part of the gamma function in terms of factorials.

The gamma function may be extended to all positive Real numbers by defining it as the smooth line that fits the points defined by the factorials of positive integers. This integration function plots a smooth curve that joins the (n, n!) points on the Cartesian plane for ( x > zero, Γ(x) ) in the Real numbers. Note the U-shaped curve in the upper right quadrant of the plot. In the integration version of the gamma function, ‘e’ is the base of natural logarithms, with a value of approximately 2.718.

Finally, the general gamma function extends to negative Real numbers and complex numbers. (Complex numbers have the form “z = x + iy”, where ‘z’ is Complex, ‘x’ and ‘y’ are Real, and ‘i’ is the square root of -1). The value of the integral function approaches infinity as the argument approaches each negative integer. Γ(x) never has the value zero.

Another equation defining the gamma function is Γ(x) = (x-1) * Γ(x-1), which is more reminiscent of the recursive definition of the factorial function on positive integers.

The gamma function has applications in probability and statistics, particularly when dealing with continous variables. However, any further discussion about the gamma function will be deferred for much later articles.

## A Future for Factorials in Decoded Science

We will also put an exclamation point on factorials through topics in permutations, combinations, and probability, as well as practical applications of each. To whet your appetite, one application of factorials is to calculate how many different bingo cards are required for a complete set.

References:
Weisstein, E. W. Factorialk-Subset; Permutation.  MathWorld-A Wolfram Web Resource. (1999-2012). Accessed August 8, 2012.

Categories Uncategorized
Home / Introducing the Factorial: the Exclamation Mark of Math

Last Updated on

What is a “factorial,” and how is it used in mathematics?

## The Mathematical Definition of Factorial for Positive Integers

In mathematics, a factorial is a function applied to natural numbers greater than zero. The symbol for the factorial function is an exclamation mark after a number, like this: 2!

The usual definition of “n factorial” is “n! = n * (n – 1) * (n – 2) *…* 2 * 1,” where ‘n’ is a positive integer.

The first handful of factorial values from positive integers are: 1! = 1; 2! = 2; 3! = 3*2 = 6; 4! = 4*3*2 = 24; and 5! = 5*4*3*2 = 120. In the image, only the first five factorial results are plotted although the first ten have been calculated.

## Recursive Definition for the Factorial

A recursive definition for the factorial function is “n! = n * (n-1)!”, placing the lower limit for the recursion at n=2.

## Factorial Function: Practical Uses

Although the factorial function deals with repeated multiplication, its most obvious use in math is to compute the number of ways in which ‘n’ objects can be permuted.

A permutation is a re-arrangement of a set. For example, set A={a} has exactly one arrangement. However, set B={a,b} could be re-arranged as {b,a}; and set C={a,b,c} has the six permutations {(a,b,c), (a,c,b), (b,a,c), (b,c,a), (c,a,b), (c,b,a)}.

Note that |A| = 1 (set A has one element), |B| = 2 and |C| has three; but they have 1, 2 and 6 permutations respectively. Our readers are invited to list the permutations for set D={a,b,c,d}, but there should be two dozen in that permutation set.

This extends to selecting permutations of an ordered subset. From set C={a,b,c}, how many ways can two elements be selected and permuted? The solution set is {(a,b), (b,a), (a,c), (c,a), (b,c), (c,b)}, and has six elements. 