TheoremBase

Properties of the Falling Factorial

The falling factorial satisfies (n)nn)_n = n! and (n)kn)_k = k! C(n,k); it vanishes for k > n and is positive for k ≤ n.

Statement

In the setting of Finite Combinatorics: Notation, let n,k∈N0n,k\in\mathbb{N}_{0}.

Diagonal value.

(n)n=n!.(n)_{n}=n!.

Relation to binomial coefficients.

(n)k=k!(nk).(n)_{k}=k!\binom{n}{k}.

Vanishing. If k>nk>n, then (n)k=0(n)_{k}=0.

Positivity. If k≤nk\le n, then (n)k≥1(n)_{k}\ge1.

Proofs

Log in to submit a proof.

Loading...

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…