Art of Problem Solving
Art of Problem Solving
Art of Problem Solving
Binomial Theorem
The Binomial Theorem states that for real or complex , , and non-negative integer ,
where is a binomial coefficient. In other words, the coefficients when is expanded and like
terms are collected are the same as the entries in the th row of Pascal's Triangle.
, etc.
Contents
1 Proof
1.1 Proof via Induction
2 Generalizations
2.1 Proof
3 Usage
4 See also
Proof
There are a number of different ways to prove the Binomial Theorem, for example by a straightforward application of mathematical
induction. The Binomial Theorem also has a nice combinatorial proof:
that for a term , we must choose of the terms to contribute an to the term, and then each of the other
terms of the product must contribute a . Thus, the coefficient of is the number of ways to choose objects from a set of
as claimed.
Similarly, the coefficients of will be the entries of the row of Pascal's Triangle. This is explained further in the Counting
and Probability textbook [AoPS].
Given the constants are all natural numbers, it's clear to see that . Assuming that
https://artofproblemsolving.com/wiki/index.php/Binomial_Theorem 1/3
2/6/2021 Art of Problem Solving
Generalizations
The Binomial Theorem was generalized by Isaac Newton, who used an infinite series to allow for complex exponents: For any real or
complex , , and ,
Proof
. Then, we have .
Usage
Many factorizations involve complicated polynomials with binomial coefficients. For example, if a contest problem involved the
polynomial , one could factor it as such:
. It is a good idea to be familiar with binomial expansions, including knowing
the first few binomial coefficients.
https://artofproblemsolving.com/wiki/index.php/Binomial_Theorem 2/3
2/6/2021 Art of Problem Solving
See also
Combinatorics
Multinomial Theorem
https://artofproblemsolving.com/wiki/index.php/Binomial_Theorem 3/3