Hello folks , i wanted to discuss some really cool derivations and formulas related to binomial theorem . There is so much material on this topic that i will have to do a part 2 next week. For now , we will be focusing on proving one formula.
The Total number of terms in expansion of
(a1+a2+a3+⋯+ak−2+ak−1+ak)n
is equal to (nn+k−1) or (k−1n+k−1)
where n represents the power of the expression
and k represents the numbers of terms .
Now sit back tight and get some popcorn . Let's begin with the proof !
proof: From Multinomial theorem the general term of the expansion can be written as
∑n1!n2!⋯nk−1!nk!n!×a1n1⋅a2n2⋯ak−1nk−1⋅aknk
Where
It is important to observe that number of terms in the expansion is equal to different sets of values of (n1,n2,n3⋯,nk−1,nk) , which satisfies the above two conditions.
To calculate all the permutations . Let us denote all the possible values of the variables n1,n2 and so on as the powers of x.
x0+x1+x2+⋯+xn−1+xn
Multiply the possible values of all the variables
k times(x0+x1+x2+⋯+xn)⋅(x0+x1+x2+⋯+xn)⋯(x0+x1+x2+⋯+xn)
=(x0+x1+x2+⋯+xn−1+xn)k
We want the Sum of variables to be equal to n . Which means we are trying to find coefficient of xn . Using formula of G.P
(x0+x1+x2+⋯+xn−1+xn)k=(1−x)k(1−xn+1)kNow Expand (1−xn+1)k using binomial expansion
⎝⎜⎜⎜⎛1−These terms have power >n.We can ignore them(1n)⋅xn+1+(2n)⋅x2(n+1)−⋯+(nn)⋅(−1)kxk(n+1)⎠⎟⎟⎟⎞⋅(1−x)−k
This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
The ideas that you expressed here can be summarized using the stars and bars approach.
Like you mentioned, we are looking for the number of non-negative integer solutions to the equation
n1+n2+…+nk=n
Log in to reply
sweet
COOL