Binomial Theorem/Extended
Jump to navigation
Jump to search
This theorem requires a proof..
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
Let $r, \alpha \in \C$ be complex numbers.
Let $z \in \C$ be a complex number such that $\cmod z < 1$.
Then:
- $\ds \paren {1 + z}^r = \sum_{k \mathop \in \Z} \dbinom r {\alpha + k} z^{\alpha + k}$
where $\dbinom r {\alpha + k}$ denotes a binomial coefficient.
Proof
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
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 $42$ (Solution)