Binomial Theorem/Abel's Generalisation/Proof 2

Theorem

$\ds \paren {x + y}^n = \sum_k \binom n k x \paren {x - k z}^{k - 1} \paren {y + k z}^{n - k}$

Proof

From this formula:

$(1): \quad \ds \sum_{k \mathop \in \Z} \binom n k x \paren {x + k z}^{k - 1} y \paren {y + \paren {n - k} z}^{n - k - 1} = \paren {x + y} \paren {x + y + n z}^{n - 1}$

The given formula:

$\ds \paren {x + y}^n = \sum_k \binom n k x \paren {x - k z}^{k - 1} \paren {y + k z}^{n - k}$

can then be transformed into $(1)$ by

This needs considerable tedious hard slog to complete it. In particular: somehow To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Finish}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

This article needs to be linked to other articles. In particular: to the specific result quoted above You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{MissingLinks}} from the code.

Sources

• 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.6$: Binomial Coefficients: Exercise $51$