Concept
Factorial
Related concepts (52)
Enumerative combinatorics
Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations. More generally, given an infinite collection of finite sets Si indexed by the natural numbers, enumerative combinatorics seeks to describe a counting function which counts the number of objects in Sn for each n.
Polygamma function
In mathematics, the polygamma function of order m is a meromorphic function on the complex numbers defined as the (m + 1)th derivative of the logarithm of the gamma function: Thus holds where ψ(z) is the digamma function and Γ(z) is the gamma function. They are holomorphic on . At all the nonpositive integers these polygamma functions have a pole of order m + 1. The function ψ(1)(z) is sometimes called the trigamma function. Digamma function#Integral representations When m > 0 and Re z > 0, the polygamma function equals where is the Hurwitz zeta function.
Digamma function
In mathematics, the digamma function is defined as the logarithmic derivative of the gamma function: It is the first of the polygamma functions. This function is strictly increasing and strictly concave on , and it asymptotically behaves as for large arguments () in the sector with some infinitesimally small positive constant . The digamma function is often denoted as or Ϝ (the uppercase form of the archaic Greek consonant digamma meaning double-gamma).
Alternating series
In mathematics, an alternating series is an infinite series of the form or with an > 0 for all n. The signs of the general terms alternate between positive and negative. Like any series, an alternating series converges if and only if the associated sequence of partial sums converges. The geometric series 1/2 − 1/4 + 1/8 − 1/16 + ⋯ sums to 1/3. The alternating harmonic series has a finite sum but the harmonic series does not.
Symbolic method (combinatorics)
In combinatorics, the symbolic method is a technique for counting combinatorial objects. It uses the internal structure of the objects to derive formulas for their generating functions. The method is mostly associated with Philippe Flajolet and is detailed in Part A of his book with Robert Sedgewick, Analytic Combinatorics, while the rest of the book explains how to use complex analysis in order to get asymptotic and probabilistic results on the corresponding generating functions.
Bertrand's postulate
In number theory, Bertrand's postulate is a theorem stating that for any integer , there always exists at least one prime number with A less restrictive formulation is: for every , there is always at least one prime such that Another formulation, where is the -th prime, is: for This statement was first conjectured in 1845 by Joseph Bertrand (1822–1900). Bertrand himself verified his statement for all integers . His conjecture was completely proved by Chebyshev (1821–1894) in 1852 and so the postulate is also called the Bertrand–Chebyshev theorem or Chebyshev's theorem.
Parity of a permutation
In mathematics, when X is a finite set with at least two elements, the permutations of X (i.e. the bijective functions from X to X) fall into two classes of equal size: the even permutations and the odd permutations. If any total ordering of X is fixed, the parity (oddness or evenness) of a permutation of X can be defined as the parity of the number of inversions for σ, i.e., of pairs of elements x, y of X such that x < y and σ(x) > σ(y). The sign, signature, or signum of a permutation σ is denoted sgn(σ) and defined as +1 if σ is even and −1 if σ is odd.
Reflection formula
In mathematics, a reflection formula or reflection relation for a function f is a relationship between f(a − x) and f(x). It is a special case of a functional equation, and it is very common in the literature to use the term "functional equation" when "reflection formula" is meant. Reflection formulas are useful for numerical computation of special functions. In effect, an approximation that has greater accuracy or only converges on one side of a reflection point (typically in the positive half of the complex plane) can be employed for all arguments.
Beta function
In mathematics, the beta function, also called the Euler integral of the first kind, is a special function that is closely related to the gamma function and to binomial coefficients. It is defined by the integral for complex number inputs such that . The beta function was studied by Leonhard Euler and Adrien-Marie Legendre and was given its name by Jacques Binet; its symbol Β is a Greek capital beta. The beta function is symmetric, meaning that for all inputs and .
Q-Pochhammer symbol
In mathematical area of combinatorics, the q-Pochhammer symbol, also called the q-shifted factorial, is the product with It is a q-analog of the Pochhammer symbol , in the sense that The q-Pochhammer symbol is a major building block in the construction of q-analogs; for instance, in the theory of basic hypergeometric series, it plays the role that the ordinary Pochhammer symbol plays in the theory of generalized hypergeometric series.