# Double factorial

In mathematics, the product of all the integers from 1 up to some non-negative integer *n* that have the same parity as *n* is called the **double factorial** or **semifactorial** of *n* and is denoted by *n*!!.^{[1]} That is,

where A consequence of this definition is that (as an empty product)

For example, 9!! = 1 × 3 × 5 × 7 × 9 = 945.

For even *n* the double factorial is

For odd *n* it is

The sequence of double factorials for even *n* = 0, 2, 4, 6, 8, ... starts as

The sequence of double factorials for odd *n* = 1, 3, 5, 7, ... starts as

Template:Harvtxt^{[2]} (possibly the earliest publication to use double factorial notation)^{[3]} states that the double factorial was originally introduced in order to simplify the expression of certain trigonometric integrals arising in the derivation of the Wallis product. Double factorials also arise in expressing the volume of a hypersphere, and they have many applications in enumerative combinatorics.^{[1]}^{[4]}

The term **odd factorial** is sometimes used for the double factorial of an odd number.^{[5]}

## Relation to the factorial

Because the double factorial only involves about half the factors of the ordinary factorial, its value is not substantially larger than the square root of the factorial *n*!, and it is much smaller than the iterated factorial (*n*!)!.

For an even positive integer *n* = 2*k*, *k* ≥ 0, the double factorial may be expressed as

For odd *n* = 2*k* − 1, *k* ≥ 1, it has the expressions

In this expression, the first denominator equals (2*k*)!! and cancels the unwanted even factors from the numerator.

For an odd positive integer *n* = 2*k* − 1, *k* ≥ 1, the double factorial may be expressed in terms of *k*-permutations of *2k* as^{[1]}^{[3]}

## Extensions

### Negative arguments

The ordinary factorial, when extended to the Gamma function, has a pole at each negative integer, preventing the factorial from being defined at these numbers. However, the double factorial of odd numbers may be extended to any negative odd integer argument by inverting its recurrence relation

to give

Using this inverted recurrence, −1!! = 1, −3!! = −1, and −5!! = 1/3; negative odd numbers with greater magnitude have fractional double factorials.^{[1]} In particular, this gives, when *n* is an odd number,

### Complex arguments

Disregarding the above definition of *n*!! for even values of *n*, the double factorial for odd integers can be extended to most real and complex numbers *z* by noting that when *z* is a positive odd integer then
^{[6]}
^{[7]}

From this one can derive an alternative definition of *z*!! for non-negative even integer values of *z*:

with the value for 0!! in this case being

The expression found for *z*!! is defined for all complex numbers except the negative even integers. Using it as the definition, the volume of an *n*-dimensional hypersphere of radius *R* can be expressed as^{[8]}

## Applications in enumerative combinatorics

Double factorials are motivated by the fact that they occur frequently in enumerative combinatorics and other settings. For instance, *n*!! for odd values of *n* counts

- Perfect matchings of the complete graph
*K*_{n + 1}for odd*n*. In such a graph, any single vertex*v*has*n*possible choices of vertex that it can be matched to, and once this choice is made the remaining problem is one of selecting a perfect matching in a complete graph with two fewer vertices. For instance, a complete graph with four vertices*a*,*b*,*c*, and*d*has three perfect matchings:*ab*and*cd*,*ac*and*bd*, and*ad*and*bc*.^{[1]}Perfect matchings may be described in several other equivalent ways, including involutions without fixed points on a set of*n*+ 1 items (permutations in which each cycle is a pair)^{[1]}or chord diagrams (sets of chords of a set of*n*+ 1 points evenly spaced on a circle such that each point is the endpoint of exactly one chord, also called Brauer diagrams).^{[4]}^{[9]}^{[10]}The numbers of matchings in complete graphs, without constraining the matchings to be perfect, are instead given by the telephone numbers, which may be expressed as a summation involving double factorials.^{[11]} - Stirling permutations, permutations of the multiset of numbers 1, 1, 2, 2, ...,
*k*,*k*in which each pair of equal numbers is separated only by larger numbers, where*k*= (*n*+ 1)/2. The two copies of*k*must be adjacent; removing them from the permutation leaves a permutation in which the maximum element is*k*− 1, with*n*positions into which the adjacent pair of*k*values may be placed. From this recursive construction, a proof that the Stirling permutations are counted by the double permutations follows by induction.^{[1]}Alternatively, instead of the restriction that values between a pair may be parger than it, one may also consider the permutations of this multiset in which the first copies of each pair appear in sorted order; such a permutation defines a matching on the 2*k*positions of the permutation, so again the number of permutations may be counted by the double permutations.^{[4]} - Heap-ordered trees, trees with
*k*+ 1 nodes labeled 0, 1, 2, ...*k*, such that the root of the tree has label 0, each other node has a larger label than its parent, and such that the children of each node have a fixed ordering. An Euler tour of the tree (with doubled edges) gives a Stirling permutation, and every Stirling permutation represents a tree in this way.^{[1]}^{[12]} - Unrooted binary trees with (
*n*+ 5)/2 labeled leaves. Each such tree may be formed from a tree with one fewer leaf, by subdividing one of the*n*tree edges and making the new vertex be the parent of a new leaf. - Rooted binary trees with (
*n*+ 3)/2 labeled leaves. This case is similar to the unrooted case, but the number of edges that can be subdivided is even, and in addition to subdividing an edge it is possible to add a node to a tree with one fewer leaf by adding a new root whose two children are the smaller tree and the new leaf.^{[1]}^{[4]}

Template:Harvtxt and Template:Harvtxt list several additional objects with the same counting sequence, including "trapezoidal words" (numerals in a mixed radix system with increasing odd radixes), height-labeled Dyck paths, height-labeled ordered trees, "overhang paths", and certain vectors describing the lowest-numbered leaf descendant of each node in a rooted binary tree. For bijective proofs that some of these objects are equinumerous, see Template:Harvtxt and Template:Harvtxt.^{[13]}^{[14]}

The even double factorials give the numbers of elements of the hyperoctahedral groups (signed permutations or symmetries of a hypercube)

## Additional identities

For even values of *n*,

Using instead the extension of the double factorial of odd numbers to complex numbers, the formula is

Double factorials can also be used to evaluate integrals of more complicated trigonometric polynomials.^{[2]}^{[15]}

Some additional identities involving double factorials of odd numbers are:

## References

- ↑
^{1.00}^{1.01}^{1.02}^{1.03}^{1.04}^{1.05}^{1.06}^{1.07}^{1.08}^{1.09}^{1.10}^{1.11}{{#invoke:citation/CS1|citation |CitationClass=citation }}. - ↑
^{2.0}^{2.1}{{#invoke:citation/CS1|citation |CitationClass=citation }} - ↑
^{3.0}^{3.1}{{#invoke:citation/CS1|citation |CitationClass=citation }}. - ↑
^{4.0}^{4.1}^{4.2}^{4.3}{{#invoke:citation/CS1|citation |CitationClass=citation }}. - ↑ E.g., in {{#invoke:citation/CS1|citation |CitationClass=citation }} and {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.