-1^n by -n choose k-1 equals -1^k by -k choose n-1
Jump to navigation
Jump to search
Theorem
Let $n, k \in \Z_{\ge 0}$.
Then:
- $\paren {-1}^n \dbinom {-n} {k - 1} = \paren {-1}^k \dbinom {-k} {n - 1}$
Proof
\(\ds \paren {-1}^n \dbinom {-n} {k - 1}\) | \(=\) | \(\ds \paren {-1}^n \paren {\paren {-1}^{-n - \paren {k - 1} } \binom {- \paren {k - 1 + 1} } {- n - \paren {k - 1} } }\) | Moving Top Index to Bottom in Binomial Coefficient | |||||||||||
\(\ds \) | \(=\) | \(\ds \paren {-1}^{- \paren {k - 1} } \binom {- k} {- \paren {n - 1} - k}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \paren {-1}^k \binom {- k} {- k - \paren {n - 1} }\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \paren {-1}^k \binom {- k} {n - 1}\) | Symmetry Rule for Binomial Coefficients |
The validity of the material on this page is questionable. In particular: Can someone explain the disappearance of a factor of $-1$? Seems to have to do with a negative bottom index You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues. 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 {{Questionable}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
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 $16$