TheoremBase

The Falling Factorial

The falling factorial (n)kn)_k is the value at (n,k) of the unique map satisfying the falling-factorial recursion.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let n,k∈N0n,k\in\mathbb{N}_{0}, and let FF be the map of Existence and Uniqueness of the Falling Factorials (i).

The falling factorial. The falling factorial (n)k(n)_{k} is the element F(n,k)F(n,k) of N0\mathbb{N}_{0}.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…