Binomial Theorem and Expansions
The binomial theorem gives you a formula for expanding expressions like without multiplying the binomial by itself over and over. It connects algebra with combinatorics through binomial coefficients, and it shows up constantly in probability, series work, and later calculus topics.

Binomial theorem application
The theorem expands any expression of the form , where is a non-negative integer, into a sum of terms.
The general formula:
Here's what each piece means:
- tells you to add up all the terms as goes from 0 to
- is the binomial coefficient, calculated as
- (read "n factorial") means , with by definition
Each individual term follows a predictable pattern:
- The exponent on starts at and decreases by 1 each term
- The exponent on starts at 0 and increases by 1 each term
- The exponents on and always add up to
For example, .
This works for any binomial raised to a power, including expressions like or . When a term is negative, like , treat it as so the signs alternate correctly.

Specific term calculation
You can find any single term in a binomial expansion without expanding the whole thing. This saves a ton of time when is large.
Steps to find a specific term:
- Identify which term you need. The th term corresponds to the value in the formula. So the 1st term uses , the 2nd term uses , the 4th term uses , and so on.
- Calculate the binomial coefficient .
- Build the term: .
- Simplify by evaluating any powers and multiplying everything together.
Example: Find the 4th term in the expansion of .
-
The 4th term means .
-
Compute the coefficient:
-
Build the term:
-
Simplify each piece:
- (odd exponent keeps the negative)
-
Result:
Watch the signs carefully. When the binomial has a subtraction, the terms with odd powers of will be negative.

Pascal's triangle interpretation
Pascal's Triangle is a triangular array where each entry is the sum of the two entries directly above it. The first few rows look like this:
| Row () | Entries |
|---|---|
| 0 | 1 |
| 1 | 1 ย 1 |
| 2 | 1 ย 2 ย 1 |
| 3 | 1 ย 3 ย 3 ย 1 |
| 4 | 1 ย 4 ย 6 ย 4 ย 1 |
Every row starts and ends with 1. Rows are numbered starting from 0.
The number in row , position (also starting from 0) equals the binomial coefficient . So the entry in row 4, position 2 is , which you can verify from the table above.
This means Pascal's Triangle gives you the coefficients for any binomial expansion at a glance. For , just read row 4: the coefficients are 1, 4, 6, 4, 1.
Key properties:
- The sum of all entries in row equals (for example, row 3: )
- The triangle is symmetric:
- Each entry represents a combination: counts the number of ways to choose items from items when order doesn't matter
For small values of , reading coefficients off Pascal's Triangle is faster than computing factorials. For larger values, the formula becomes more practical.
Additional Concepts in Binomial Expansion
- Polynomial expansion: The binomial theorem is a specific case of expanding polynomials. Multinomial expansion generalizes the idea to expressions with more than two terms, like .
- Combinations vs. permutations: Binomial coefficients count combinations (order doesn't matter). Permutations, where order does matter, use the formula and come up in more complex counting and probability problems.
- Connection to probability: Binomial coefficients appear directly in the binomial probability distribution, which models the number of successes in independent trials. You'll see this in statistics and in AP-level probability work.