Binomial Theorem Proof by Induction
HTML-код
- Опубликовано: 9 фев 2025
- Talking math is difficult. :)
Here is my proof of the Binomial Theorem using indicution and Pascal's lemma. This is preparation for an exam coming up.
Please let me know if I made any errors.
Finally, a proof that isn't just 2 lines of math and then jumps to a conclusion, condensing all assumptions and steps in one go. Very neat to see you go through each step diligently!
Thank you! The proof was well explained, however, if you had said "representeded" one more time I would have gone crazy haha.
You're awesome! I finally got it. No many instructors/authors are explicit about the requirement to distributing Σf into (x + y) at the inductive step.
Was never taught Pascal's rule so I stumbled hard on that step when I was doing this problem on my own. Most explanations didn't point out that step and moved right along. Thank you so much for explaining every step in detail!
Best explanation on the web. Great work
Godsend wizard man! Thanks for the help on my modern alg and number theory hw that's due in the morning 😂
Very elegant proof, well done.
great explanation thanks a lot! One question: if we shift the summation index from k=0 to k=1 and m to m+1, wouldnt we also have to reduce the terms in the brackets to (m-1 *over* k-1)?
First of all , you are AMAZING I’ve been looking for this proof for a really long time. second of all is it possible for you to make a video on the proof of the inclusion exclusion theorem using the sigma notations ? Thank you
11:03 - Explanation of Factoring k = 0 and k = m + 1
Thank you so much, i really needed the verbal explanation, textbooks just don't explain this problem well enough for me.
What are the text books your referring to ?
Names please
@@hussainfawzer im referring to Czech textbooks, written by my professor - i dont think theyre translated into english
@@nikoka2980
Do you have suggestions for rigorous proof based math books on these topics…
I’m mainly interested in topics such as
Binomial theorem
Series and sequences
Polynomials and rational functions
I want some suggestions to proof based books…
@@hussainfawzer im sorry, none written in english come to mind - but i will let you know if i ever find any
@@nikoka2980
Okay
Why is the shifting of index still needed if the original index starts with 0? I'm sorry I don't understand that part very well.
I really love your videos, and I needed a favor. I need you to prove a bunch of things for me. I need you to prove the commutative property of addition for all real numbers, the multiplication of fractions, the addition of fractions, the commutative property of multiplication for all real numbers, and the distributive property for all real numbers including irrational numbers please. What I love about math is that it is always consistent and that properties are not made from thin air, and if you prove all these properties for me I will feel much better about that fact.
Please I have searched in so many places and never found a satisfying answer. Please out of the kindness of your heart answer my questions
6:58 Why is it k=1 and m+1? How to prove it is correct to transform from k=0 to k=1 and m to m+1? I still don't understand this.
Thank you, you Absolute KING !
insane, really well explained, thanks man
You just heave to expand a binomial to a power (x+b)^n as a Taylor expansion to get the binomial theorem.
Elegant proof. Thank you.
Thanks!! The explanation is very clear. Awesome work!
For the base case. Why don't you chose n=0 ?
what is pascal theorem you used
Really helpful. Thanks for the awesome explanation!
I'm not sure what justifies changing the index at 10:50. If I'm showing that LHS=RHS how can I just change what RHS is?
he doesn't change RHS at all. He only middling with LHS I think.
we didn't change RHS, we only manipulated LHS using three things.
- Summation identities
- Index shifting property
- Pascal's rule
explained very well thank you.
Can you explain the rationale of how you added the x^(n+1) and y^(n+1) into the summation
Like why can we add them into the summation
Specifically why does k then begin at 0 and then n goes to n+1
a summation is just a sum of numbers, the x^n+1 and y^n+1 are just the first and last terms in that summation, that's why he rewrote them to look like the summation. You can "throw" them in because they are just terms that meet the criteria of the summation. By adding the first and last terms, you add the case when k=0 and the case when k=n+1 into the summation, because again its just addition. That's why the indices increment.
thnx very helpful
you lost me at 7:45 :(
When you say "factor out" k=0 and k=m+1, isn't it rather that you are subtracting these terms from the sum? Because you are left with four terms and no multiplication signs in the next step, thus no factors.
Poor is very well explained and it is very help full for me
Fantastic thank u very much for the proof of binomial theorem.
why don't you upload these pics?
Come back to Red Alert 2. You are missed.
you're incredible thanks
Thank you! That was a very clear tutorial.
very good. thanks. Now if I can do it without watching...
Very useful . Thank you .
Al fin entiendo la prueba. Gracias
Can someone explain the place thing around 12:30?
He use Pascal rule which state that C(n,k)+C(n,k-1)=C(n+1,k). The goal of this is to combine the 2 summations together so we can go further in the proof. Notice that the summation have the same expression inside so now they are comparable.
normally it is n=k and n=0 and then you subsitute k+1
good explanation congrats
nice proof. no serious mistakes worth mentioning. handwriting a bit messy though. do you have a drawing tablet or are you using a mouse?
if it's a mouse, then props to you because it's better than my mouse-writing. but a drawing tablet might be awesome for you. i love mine. it's changed the way i teach.
very good
Pretty good proof.
brilliant
Awesome... but in the end it should be = RHS
Sarthak Hajirnis Ah, you are correct. Good catch.
Ron Joniak How did you obtain the summand inside the summation for the LHS to look different from the RHS.
Evan Urena Is there a time you are referring to?
-Ron
Ron Joniak Oh, never mind. You just muliplied both sides by (x+y) then simplified, am i correct?
@@evanurena8868 No he just broke down the exponents
Ross Geller does math
I love this!!!
why don't you start from 0 at basic step? coz your k starts at 0
+mukongshu because n is from 1, 1,2,3,4...
Good job, thanks! :)
Thanks !
You call summands factors...
It is "represented")))))
good & thank you
Wowww
thank you so much
Nice thank you
Thanks Ron it helps :)
Nice AMV
nice video brah ty
well done
wow
Im tired to this .....
Wtf how does anyone understand this?? So unfortunate just wasted 30 minutes trying to understand what's going on after 7 minutes into the video and no luck.
Amazing how many positive comments this guy's got for this non-explanation!! Noticing how horrible of an explanation this is, I wanted to glance through the notes. Based on what I read, I am sure that none of those people who claimed to have understood the train of thought presented here have done nothing except to confuse themselves...
Actually it is quite a good explanation. Even though I already knew the proof, this actually made it clearer to me.
Thank you so much