Math 2.0

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.

Explanations

L1 human

The falling factorial starts like the factorial but stops after kk factors. For example, (5)3=5⋅4⋅3=60(5)_3 = 5 \cdot 4 \cdot 3 = 60 is the number of ways to award gold, silver and bronze among 5 runners.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Falling_and_rising_factorials, lead section