Factorial: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Dmitrii Kouznetsov
imported>Ro Thorpe
m (typo)
Line 2: Line 2:
In [[mathematics]], the '''factorial''' function 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 [[permutation]]s of the set of objects.  The function is denoted by ''n''!.
In [[mathematics]], the '''factorial''' function 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 [[permutation]]s of the set of objects.  The function is denoted by ''n''!.


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 ojects then have to be placed in the remaining ''n''-1 places, and this is the same problem for the smaller set.  So we have
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


:<math> n! = n \cdot (n-1)! \,</math>
:<math> n! = n \cdot (n-1)! \,</math>

Revision as of 08:27, 18 January 2009

This article is developed but not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
Code [?]
 
This editable, developed Main Article is subject to a disclaimer.

In mathematics, the factorial function 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. The function is denoted by n!.

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.

Stirling's formula

For large n there is an approximation due to Scottish mathematician James Stirling

Inverse function

ArcFactorial in the complex plane.

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 of factorial of the real 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.

The figure shows the mapping ot the complex plane with the factorial function. In particular, factorial maps the unity to unity; two is mapped to two, and 3 is mapped to 6.

References