# Factorial

0 | 1 |

1 | 1 |

2 | 2 |

3 | 6 |

4 | 24 |

5 | 120 |

6 | 720 |

7 | 5040 |

8 | 40320 |

9 | 362880 |

10 | 3628800 |

In mathematics, the **factorial** is the meromorphic function with fast growth along the real axis; for non-negative integer values of the argument, this function has integer values.
Frequently, the postfix notation is used for the factorial of number .
For integer , the gives the number of ways in which *n* labelled objects (for example the numbers from 1 to *n*) can be arranged in order. These are the permutations of the set of objects. In some programming languages, both n! and factorial(n) , or Factorial(n), are recognized as the factorial of the number .

## Integer values of the argument

For integer values of the argument, the factorial can be defined by a recurrence relation. If *n* labelled objects have to be assigned to *n* places, then the *n*-th object can be placed in one of *n* places: the remaining *n*-1 objects then have to be placed in the remaining *n*-1 places, and this is the same problem for the smaller set. So we have

and it follows that

which we could derive directly by noting that the first element can be placed in *n* ways, the second in *n*-1 ways, and so on until the last element can be placed in only one remaining way.

Since zero objects can be arranged in just one way ("do nothing") it is conventional to put 0! = 1.

The factorial function is found in many combinatorial counting problems. For example, the binomial coefficients, which count the number of subsets size *r* drawn from a set of *n* objects, can be expressed as

The factorial function can be extended to arguments other than positive integers: this gives rise to the Gamma function.

## Definitions

For complex values of the argument, the combinatoric definition above should be extended.

### Implicit definition

The factorial can be defined as unique meromorphic function , satisfying relations

for all complex except negative integer values.
The uniqueness of function , satisfying these equations, follows from the
Wielandt's theorem
^{[1]}
^{[2]}. Historically, the deduction refers to the Gamma function, but the application to the factorial is straightforward.

### Definition through the integral

Usually, the integral representation is used as definition. For , define

Such definition is similar to that of the Gamma function, and leads to the relation

for all complex except the negative integer values.

The definition above agrees with the combinatoric definition for integer values of the argument; at integer , the integral can be expressed in terms of the elementary functions.

### Extension of integral definition

The definition through the integral can be extended to the whole complex plane, using relation

for the cases , assuming that is not negative integer. Also, the symmetry formula takes place for the non-integer values of ,

The similar formula of symmetry holds however, for the Gamma function. From this expression, it follows that is entire function of . Also, this symmetry gives the simple way to express , and, therefore, factorial of half-integer numbers.

In the figure,
lines of constant and
lines of constant are shown.

The levels u = − 24, − 20, − 16, − 12, − 8, − 7, − 6, − 5, − 4, − 3, − 2, − 1,0,1,2,3,4,5,6,7,8,12,16,20,24 are drown with thick black lines.

Some of intermediate levels u = const are shown with thin blue lines for positive values and with thin red lines for negative values.

The levels v = − 24, − 20, − 16, − 12, − 8, − 7, − 6, − 5, − 4, − 3, − 2, − 1 are shown with thick red lines.

The level v = 0 is shown with thick pink lines.

The levels v = 1,2,3,4,5,6,7,8,12,16,20,24 are drown with thick blue lines. some of intermediate levels v = const are shown with thin green lines.

The dashed blue line shows the level and corresponds to the value of the principal local minimum of the factorial of the real argument.

The dashed red line shows the level and corresponds to the similar value of the negative local extremum of the factorial of the real argument.

Due to the fast growth of the function, in the right hand side of the figure, the density of the levels exceeds the ability of the plotter to draw them; so, this part is left empty.

## Factorial of the real argument

The definition above was elaborated for factorial of complex argument. In particular, it can be used to evaluate the factorial of the real argument. In the figure at right, the is plotted versus real with red line. The function has simple poluses at negative integer .

At , the .

### The local minimum

The factorial has local minimum at

- 0.461632144968362341262659542325721328468196204

marked in the picture with pink vertical line; at this point, the derivative of the factorial is zero:

The value of factorial in this point

- 0.88560319441088870027881590058258873320795153367

The Tailor expansion of at the point can be written as follows:

- .

The coefficients of this expansion are copypasted in the table below:

approximation of | |
---|---|

2 | 0.428486815855585429730209907810650582960483696962 |

3 | -0.130704158939785761928008749242671025181542078103 |

4 | 0.160890753325112844190519489594363387594505844657 |

5 | -0.092277030213334350126864106458600575084335085690 |

This expansion can be used for the precise evaluation of the inverse function of factorial (arcfactorial) in vicinity of the branchpoint.

Other local extremums are at negative values of the argument; one of them in shown in the figure above.

## The Taylor expansion

The Taylor expansion of at , or the MacLaurin expansion, has the form . The first coefficients of this expansion are copypasted in the table below:

approximation of | ||
---|---|---|

0 | ||

1 | ||

2 | ||

3 | ||

4 |

Here, is the Euler constant and is the Riemann function. The Computer algebra systems such as Maple and Mathematica can generate many terms of this expansion. The radius of convergence of the Taylor series is unity, and the coefficient does not decay as increases. However, due to the relation , for any real value of argument of factorial, the expansion above can be used for the precise evaluation of factorial of the real argument, running the approximation above for an argument with modulus not larger than half. Also, the expansion at the half-integer values can be used: . The first coefficients of this expansion are copypasted in the table below:

approximation of | ||
---|---|---|

0 | ||

1 | ||

2 | ||

3 | long expression | |

4 | even longer expression |

The Taylor series of developed at , converges for all such that .

In order to boost the approximation of factorial for real values of the argument, and, especially, for the evaluation for complex values, and the evaluation of the inverse function, the expansions for and are used instead of the direct Taylor expansions above.

## Halving of the imaginary part of the argument

While neither nor is negative integer, the argument of factorial can be dropped with the identity

This may be useful to drop with factor 1/2 the imaginary part of the argument (for example, to apply the Taylor expansion above for the evaluation), but the function has to be evaluated twice.

## Related functions

In the plot of factorial of the real argument, the two other functions are plotted, and . These functions can be useful for the generalization of the factorial and for its evaluation.

### Inverse function

ArcFactorial | |
---|---|

0.46163214496836234126265954233 | |

0.50000000000000000000000000000 | |

1 | 1.00000000000000000000000000000 |

2 | 2.00000000000000000000000000000 |

3 | 2.40586998630956692469992921838 |

4 | 2.66403279720644615568638939436 |

5 | 2.85235545803172783164299808684 |

6 | 3.00000000000000000000000000000 |

Inverse function of factorial can be defined with equation

and condition that ArcFactorial is holomorphic in the comlex plane with cut along the part of the real axis, that begins at the minimum value of the factorial of the positive argument, and extends to . This function is shown with lines of constant real part and lines of constant imaginary part .

Levels are shown with thick black curves.

Levels are shown with thin blue curves.

Levels are shown with thick blue curves.

Level is shown with thick pink line.

Levels are shown with thick red curves.

The intermediate levels of constant are shown with thin dark green curves.
The ArcFactorial has the branch point ; the cut of the range of holomorphism is shown with black dashed line.

ArcFactorial for some real values of the argument is approximated in the table at right.

approximation for | |
---|---|

1 | 1.43764234228440800 |

2 | 0.315227181071631549 |

3 | -0.0256407066268564423 |

4 | 0.00492170392390056555 |

In vicinity of the branchpoint , the ArcFactorial can be expanded as follows:

The approximations for the first coefficients of this expansion are copypasted in the table at right. About of 30 terms in this expansion are sufficient to plot the distribution of the real and the imaginary parts of ArcFactorial in the figure above.

### Function

The inverse function of factorial, id est, from the previous section, should not be confused with
shown in the figure at right.
The lines of constant and
the lines of constant are drawn.

The levels are shown with thick black lines.

The levels are shown with thick red lines.

The level is shown with thick pink line.

The levels are shown with thick blue lines.

Some of intermediate elvels const are shown with thin red lines for negative values and thin blue lines for the positive values.

Some of intermediate elvels const are shown with thin green lines.

The blue dashed curves represent the level and correspond to the positive local maximum of the inverse function of the real argument.

The red dashed curves represent the level , which corresponds to the first negative local maximum of the factorial of the real argument;
;
.

In the upper-left hand side of the figure, and at the lower-left hand side of the figure, the density of levels exceeds the ability of the ploter to draw them, and these parts are left empty.

is entire function, that grows in the left hand side of the complex plane and quickly decays to zero along the real axis.

### Logfactorial

For the approximation of factorial, if can be represented in the form

#### Plof of LogFactorial

Function LogFactorial is shown in figure with lines of constant real part and lines of constant imaginary part.
Levels of constant and
Levels of constant are drawn with solid lines:

Levels are shown with thick black curves.

Levels are shown with thin red curves.

Levels are shown with thin blue curves.

Levels are shown with thick red curves.

Level is shown with thick pink line.

Levels are shown with thick blue lines.

Levels are shown with thin green curves.

The cut of range of holomorphism is shown with black dashed line.

Function LogFactorial has singularities at the same points, as the factorial, id est, at negative integer values of the argument.

#### Approximation of LogFactorial at large values of the argument

approximation of | ||
---|---|---|

0 | 1 / 12 | 0.083333333333333333 |

1 | 1 / 30 | 0.033333333333333333 |

2 | 53 / 210 | 0.252380952380952381 |

3 | 195 / 371 | 0.525606469002695418 |

Far from the negative part of the real axis, the function LogFactorial can be approximated through the continual fraction :

The coefficients and their approximate evaluations are copypasted in the table at right.

In vicinity of the real axis, while the modulus of the imaginary part of LogFactorial does not exceed , the
LogFactorial can be interpreted as logarithm of factorial, id est,

In particular, this relation is valid for positive real values of .

For all except negative integers,

However, the LogFactorial has singularities at negative integer valies of the argument.

### Stirling formula

Historically, one of the first approximations of the factorial with elementary functions was the Stirling formula below.
For large *n* there is an approximation due to Scottish mathematician James Stirling

This formula can be obtained from the approximation for LogFactorial above, just replacing to zero.

## References

- ↑ Wielandt's theorem online: http://www.math.ku.dk/~henrikp/specialtopic2000/node7.html
- ↑ Reinhold Remmert The American Mathematical Monthly, Vol. 103, No. 3 (Mar., 1996), pp. 214-220, http://www.jstor.org/pss/2975370

- Ronald L. Graham; Donald E. Knuth, Oren Patashnik (1989).
*Concrete Mathematics*. Addison Wesley, 111,332. ISBN 0-201-14236-8.