## What is a Falling Power?

A **falling power** (also called a falling factorial) is formally defined as:

The expression n^{k} is “n to the k falling” (note the important underline in the exponent). The notation n^{k} is commonly used in combinatorics; Some authors do use other notation. For example, Loeb (1992) uses (x)_{n} [1].

The first few falling powers are [2]:

- n
^{0}= 1 - n
^{1}= n - n
^{2}= n(n – 1) = n^{2}– n - n
^{3}= n(n – 1)(n – 2) = n^{3}– 3n^{2}+ 2n - n
^{4}= n(n – 1)(n – 2)(n – 3) = n^{4}– 6n^{3}+ 11n^{2}– 6n

## Conversion from Ordinary Powers

Falling powers are analogous to regular powers in finite calculus and differential calculus [3].In general, ordinary powers like x^{2} or x^{3} can be expressed as linear combinations of falling powers; You can convert from ordinary powers to falling powers by using Stirling numbers:

Where “*S*” is a Stirling number of the second kind.

Examples:

- n
^{2}= S(2, 2)n^{2}+ S(2, 1)n^{1}+ S(2, 0)n^{0}= n (n – 1) + n - n
^{3}= S(3, 3)n^{3}+ S(3, 2)n^{2}+ S(3, 1)n^{1}+ S(3, 0)n^{0}= n (n – 1)(n – 2) + 3n(n – 1) + n - n
^{4}= S(4, 4)n^{4}+ S(4, 3)n^{3}+ S(4, 2)n^{2}+ S(4, 1)n^{1}+ S(4, 0)n^{0}

= n(n – 1)(n – 2)(n – 3) + 6n(n – 1)(n – 2) + 7n(n – 1) + n

## Usefulness of Falling Powers

Falling powers are commonly used in the calculus of finite differences and arise in several different areas including generating functions, hypergeometric functions and power series solutions to differential equations.

## References

[1] Loeb, D. (1992). A generalization of the Stirling numbers. In Discrete Mathematics 103, 259-269. North-Holland.

[2] Catone, C. Bringing Calculus into Discrete Math via the Discrete Derivative. The College Mathematics Journal, 50:1, 21-27, DOI: 10.1080/07468342.2019.1530553. Retrieved June 11, 2021 from: http://www.auemath.aichi-edu.ac.jp/teacher/kodani/lecture/zemi-r2/matsubara.pdf

[3] Rosen, K. (2017). Handbook of Discrete and Combinatorial Mathematics. CRC Press.