Did you know that combinations, which is the unordered selection of objects, is also called the binomial coefficient?
Yep!
The combinations of n elements taken k at a time without repetition often stated as “n choose k” is equal to the binomial coefficient or the combinatorial number.
What this means is that we quickly find the expanded form of any binomial by applying combinations.
The binomial theorem states that if a and b are variables and n is a nonnegative integer, then:
Let’s see the binomial theorem in action with the following problem:
Using combinations, we can quickly find the binomial coefficients (i.e., n choose k) for each term in the expansion.
But the real power of the binomial theorem is its ability to quickly find the coefficient of any particular term in the expansions.
Example
For instance, suppose you wanted to find the coefficient of x^5 in the expansion (x+1)^304. All we have to do is apply combinations!
Gosh, aren’t you glad you didn’t need to multiply the binomial 304 times just to find that coefficient? Me too!
Together we will look at how to successfully wield this unique “superpower” to find the expansion of such questions as:
Throughout this lesson, we work through various examples and successfully apply the binomial theorem to multiple instances, focusing predominately on more challenging expansions.
We will also see how the binomial coefficient and Pascal’s triangle are efficient and straightforward ways to find indicated coefficients. Additionally, we will use proof by mathematical induction to aid us in deriving formulas for various series while using the binomial coefficient.
Let’s jump right in.
Video Tutorial w/ Full Lesson & Detailed Examples (Video)
1 hr 34 min
Get access to all the courses and over 450 HD videos with your subscription
Monthly and Yearly Plans Available
Still wondering if CalcWorkshop is right for you?
Take a Tour and find out how a membership can take the struggle out of learning math.