Question
Question: How do you expand \[{\left( {x + y} \right)^{10}}\] ?...
How do you expand (x+y)10 ?
Solution
Here we will apply the Binomial Expansion to solve the given problem.
The binomial theorem (or binomial expansion) describes the algebraic expansion of power of a binomial. According to the theorem, it is possible to expand the polynomial (x+y)n.
First we have to Put the given value in the place of n and use the formula. Then solving this with the help of combination rule and factorial n and simplifying the result we will get the solution.
Formula used: Combination rule: nCr=(n−r)!r!n!
Binomial expansion:
(x+y)n=nC0xn+nC1xn−1y1+nC2xn−2y2+......+nCn−1xyn−1+nCnyn
Where n⩾0, is an integer and each nCk is a positive integer known as binomial coefficient.
Complete step-by-step solution:
We need to expand (x+y)10.
Now we know that, according to binomial theorem it is possible to expand any nonnegative power of
x+y into a sum of the form
(x+y)n=nC0xn+nC1xn−1y1+nC2xn−2y2+......+nCn−1xyn−1+nCnyn, where n⩾0, is an integer and eachnCk is a positive integer known as binomial coefficient.
Now we can use the binomial expansion putting n=10 we get,
⇒(x+y)10=10C0x10y0+10C1x10−1y1+...+10C9x10−9y9+10C10x0y10
Solving we get,
⇒(x+y)10=10C0x10+10C1x9y1+...+10C9xy9+10C10y10,
[Using,x0=1].
Again, we can use the Combination rule,nCr=(n−r)!r!n!, we get,⇒(x+y)10=0!(10−0)!10!x10+1!(10−1)!10!x9y1+....+9!(10−9)!10!xy9+10!(10−10)!10!y10
Solving we get,
⇒(x+y)10=0!10!10!x10+1!9!10!x9y1+...+9!1!10!xy9+10!0!10!y10
Let us expanding the factorial term and we get
⇒(x+y)10=x10+1×9!10×9!x9y1+2×1×8!10×9×8!x8y2+...+8!×2×110×9×8!x2y8+9!×110×9!xy9+y10
[Using the definition of factorial n, n!=n(n−1)(n−2)(n−4).......2.1 and 0!=1]
Simplifying we get,
⇒(x+y)10=x10+10x9y1+210×9x8y2+...+2×110×9x2y8+10xy9+y10
Or,
⇒(x+y)10=x10+10x9y1+(5×9)x8y2+...+(5×9)x2y8+10xy9+y10
Solving we get,
⇒(x+y)10=x10+10x9y1+45x8y2+...+45x2y8+10xy9+y10
Hence expanding (x+y)10 we get,
⇒(x+y)10=x10+10x9y1+45x8y2+...+45x2y8+10xy9+y10
Note: In mathematics, a combination is a selection of items from a collection, such that the order of selection does not matter. For example, given three fruits, say an apple, an orange and a pear, there are three combinations of two that can be drawn from this set: an apple and a pear; an apple and an orange; or a pear and an orange.
A combination is the number of ways we can combine things, when the order does not matter.
For a combination,
C(n,r)=nCr=(n−r)!r!n!
Where, factorial n is denoted by n! and defined by
n!=n(n−1)(n−2)(n−4).......2.1