The Binomial Theorem is an extremely important and general (and totally sweet) result in the field of combinatorics (which is the branch of mathematics about counting things). Without further ado, here it is:
Wait! Don’t let all the fancy symbols and variables scare you; it’s actually not too complicated. Go back and read it again, carefully, and then let’s break it down a bit. It says that the nth power of the binomial (whence the theorem gets its name) can be found by a sum () which starts with , and each subsequent term of the sum is composed of the next binomial coefficient, one fewer x, and one more y. For example:
(Recall that anything to the zero power is 1.) Make sense? Another way to think about it is that , when expanded, consists of a number of terms of the form , where a and b always add up to n; the coefficients of the terms are determined by the entries in a row of Pascal’s Triangle. Why is this true? Expand out without collecting like terms; for example:
In general you get a total of terms, one corresponding to each possible way to choose a string of n x’s and y’s. Every term with exactly k x’s (and therefore (n-k) y’s) can be combined, since, for example, ; the number of such terms is the number of ways to choose k x’s out of n letters. Thus, the Binomial Theorem!
Now, why is the BT so sweet? Here are a few reasons, in the form of problems for you to try:
- Prove the binomial coefficient sum equation from last time in yet another way (hint: expand using the Binomial Theorem).
- Prove another interesting binomial coefficient identity by expanding .
- Compute , , , , . Notice anything interesting? Why does that happen? (Hint: 11 = 10 + 1.) What happens when you compute ? Can you think of a way to “fix” it?
- According to the BT, what is ? Does that look familiar?
- If you know some calculus, use the BT and the definition of the derivative
to prove the power rule for derivatives: