Factorial: Difference between revisions
imported>Dmitrii Kouznetsov m (→Stirling formula: misprint) |
imported>Dmitrii Kouznetsov (→Inverse function: add raw to the table) |
||
Line 158: | Line 158: | ||
| <math>\mu_0</math> | | <math>\mu_0</math> | ||
|| 0.46163214496836234126265954233 | || 0.46163214496836234126265954233 | ||
|- | |||
| <math>\frac{\sqrt{\pi}}{2}</math> | |||
|| 0.50000000000000000000000000000 | |||
|- | |- | ||
| 1 || 1.00000000000000000000000000000 | | 1 || 1.00000000000000000000000000000 |
Revision as of 01:11, 21 January 2009
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 definiton above should be extended. The factorial can be defined as unique meromorphic function , satisfying relations
for all complex except negative integer values. This definition is not constructive, and gives no straightforward way for the evaluation. Therefore, 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.
The definition through the integral can be extended to the whole complex plane, using relation
for the cases , assuming that in not negative integer. This allows to plot the map of factorial in the complex plane. 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 evlauate 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
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
The Tailor expansion of at the point can be writen ax follows:
The approximations for the coefficients of this expansion are in the table:
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.
Specific values
For several specific values of the argument, the simple representations for the factorial are known. In addition fo the integer values, ; then, using the relation, values at half-integer argument can be expressed; for example, is slightly greater than , which is minimal value of this function for the positive values of the argument.
Values of factorial at integer plus quarter and at integer plut third are mentioned in in textbooks, but these numbers do not have special names.
Related functions
In the figure above, the two other functions are plotted. The first of them is
is the inverse function;
In the range of biholomorphism, the inverse relation is also valid; in particular,
Specific values of the inverse function:
- ,
- ,
- ,
- ,
- .
For comparison, in the figure above, the function
is plotted with the blue curve. This function is entire, id est, it has no singularities, and can used for the approximation of factorial. The Tailor series for this function always converge (this function has has infinite radius of convergence).
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 holomorphizm is shown with black dashed line.
ArcFactorial for some real values of the argument is approximated in the table at right.
Function
The inverse function of factorial, id est, from the previous section, sohuld 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;
;
.
is entire function, that grows in the left hand side of the compelx plane and quickly decays to zero along the real axis.
Evaluation of the factorial
In principle, the integral representation from the definition above can be used for the evlauation of the factorial. However, such an implementation is not efficient, and is not suitable, when the factorial is used as a component in construction of other functions with complicated representations, involving many evaluations of the factorial. Therefore, the approximations with elementary functions are used. For the efficient evaluation of , the approximatons for above, of those for are used.
Logfactorial
For the approximation of factorial, if can be represented in the form
Function LogFactorial has singularities at the same points, as the factorial, id est, at negative integer values of the argument.
Far from the negative part of the real axis, the function LogFactorial can be approximated through the coninual fraction :
The coefficients and their approximate evaluations are copypasted in the table below:
approximation of | ||
---|---|---|
0 | 1 / 12 | 0.083333333333333333 |
1 | 1 / 30 | 0.033333333333333333 |
2 | 53 / 210 | 0.252380952380952381 |
3 | 195 / 371 | 0.525606469002695418 |
In vicinity of the real axis, while the modulus of the imaginary part of LogFactorial does not exceed , the LogFactorial can be interpreted as lofarithm of factorial, id est,
In particular, this relation is valid for positive real values of .
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 LogFactgorial above, just replacing to zero.
References
- Ronald L. Graham; Donald E. Knuth, Oren Patashnik (1989). Concrete Mathematics. Addison Wesley, 111,332. ISBN 0-201-14236-8.