Math 2.0

Combinatorics Definition

Falling factorial

Definition

Let xx be an element of a commutative ring, for example a real number, and let kk be a natural number. The falling factorial of xx of order kk is (x)k=x(x−1)(x−2)⋯(x−k+1)=∏i=0k−1(x−i).(x)_k = x (x - 1) (x - 2) \cdots (x - k + 1) = \prod_{i=0}^{k-1} (x - i). For k=0k = 0 the product is empty, and (x)0=1(x)_0 = 1.

Remarks

Other notations are xk‾x^{\underline{k}} and P(n,k)P(n, k). For natural numbers n≥kn \ge k, (n)k=n!/(n−k)!(n)_k = n! / (n - k)!. For k>nk > n, (n)k=0(n)_k = 0. For natural numbers nn and kk, (n)k(n)_k is the number of injections from a kk-element set to an nn-element set.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Falling_and_rising_factorials, lead section
About this page
Tag0N5M924N3P
URIm2://0N5M924N3P
Kinddefinition
WritingW1 stated
MSC05A10
DefinesFalling factorial

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by