Where do the coefficients come from?
What happens when the same bracket is multiplied by itself many times, as in ? Writing out every product soon takes a long time, yet expansions like this keep appearing. For example, finding the slope of a curve such as needs , the same kind of expression that the derivative page uses for . Counting problems lead to the same structure, because each bracket offers a choice between two terms. To expand two brackets, we multiply every term in one bracket by every term in the other (the factorisation page uses this). Here we look for a quicker way to handle many brackets. That slope example is only one place where these expansions appear; if it is new to you, skip it for now. What follows starts from bracket multiplication and counting.
Let us begin with , which means . Why does this give rather than just ? We will write out the four products first, then add one more bracket. Keeping track of these choices will help us find the pattern for larger powers.
01Two brackets. Four selections.
The distributive law says : multiply by each term and add. Apply it to both brackets. Take a or b from the first bracket, then a or b from the second. Play the animation, pause it, or collect one product at a time.
The exponent 2 means 2 copies of (a+b), multiplied together. To expand, take one letter from every bracket and multiply those letters.
The selections ab and ba come from different bracket positions. But ordinary numbers satisfy ab = ba, so their products are equal. Adding them gives ab + ab = 2ab. The 2 in a² counts factors of a; the 2 in 2ab counts equal products being added.
02Three brackets. Count the positions.
Now each selection uses three letters, so its exponents always add to 3. To obtain , two brackets must supply a and the remaining bracket must supply . Watch all eight selections, then compare the three ways to obtain .
The exponent 3 means 3 copies of (a+b), multiplied together. To expand, take one letter from every bracket and multiply those letters.
Why does appear three times?
The brackets occupy three distinct positions. Choose two positions for a, and the remaining position must supply b. Equivalently, choose just that one b position.
Choose position 1, 2
Choose position 1, 3
Choose position 2, 3
These are two ways to count the same three selections, not six different selections. A combination counts which positions you choose; it does not count the order in which you click them.
Read this as “n choose r”. is the total number of available positions; is how many positions to choose. Here and (for ), or (for ).
03 brackets. Choose of them for .
Let count the brackets that supply a. Every other bracket supplies , giving copies of . The product is . Its coefficient is “n choose k”, because any selection of those positions produces that same product. now plays the role of in .
2 copies of a and 3 copies of b. Click any bracket above to change its choice.
= 10 different selections give this same product.
Choose 2 positions from 5 for a. The remaining 3 positions must supply b. There are 10 such choices, so the coefficient of a²b³ is 10.
The terms run from zero a’s to n a’s. Click a term to inspect every selection behind its coefficient. Reordering the terms does not change their sum.
Start with : take from every bracket, giving once. Increase one at a time, until : take a from every bracket, giving once. This lists every selection exactly once, grouped by its product.
means “add these terms”. The bottom tells you where to start; the top tells you where to stop. The powers tell you what was chosen; the coefficient tells you how many ways it could be chosen. This is the binomial theorem.
Here is a nonnegative integer. A factor with exponent zero is omitted; for the expansion is 1. The interactive display reaches , but the counting argument works for every nonnegative integer .
