Newton-Girard Formulas/Recurrence Formula

Theorem
Let $a, b \in \Z$ be integers such that $b \ge a$.

Let $U$ be a set of $n = b - a + 1$ numbers $\set {x_a, x_{a + 1}, \ldots, x_b}$.

Let $m \in \Z_{>0}$ be a (strictly) positive integer.

Let:

That is, $h_m$ is the product of all $m$-tuples of elements of $U$ taken $m$ at a time, excluding repetitions.

For $r \in \Z_{> 0}$, let:
 * $S_r = \ds \sum_{k \mathop = a}^b {x_k}^r$

A recurrence relation for $h_n$ can be given as:

for $n \ge 1$.