Thank you for taking the time to put this together. I really appreciate it. I won’t tell you how many times I watched it before k-1 clicked, but the 💡 moment was worth it!
Thanks for another great explanation! I've found videos on graphing sin^2 x and cos^2 x, using the power reducing formulas, but I have yet to find a video for graphing tan^2 x. I would love a step-by-step video for that. Just a suggestion though, no pressure. I'll be watching all your videos either way.
Thanks for watching and for the request! That sounds like a good idea, I'm seriously rusty on trig, but I'll dive back in and take a look, could have some good lessons there! And I appreciate your support, got a real doozy of a video coming early this week if all goes well :)
It works every time with any size set and any subset selected, but I still don't see why. I'm missing some basic, fundamental understanding. Frustration!!!!!!
Thanks for watching and sorry if it was unclear! Do you mean you understand what the formula was saying but not the proof? Where did I lose you in the explanation? I think the trickiest part is the concept of arbitrarily focusing on a single element in our n-element set, in order to split our count into separate binomial coefficients. I’d be happy to try to explain that a little more here, or something else depending on what your confusion is.
If your confusion stems from not understanding the concept of double counting, I suggest reading the first paragraph and the subsection "Forming committees" on the Wikipedia page "Double counting (proof technique)." Once you can follow that proof, return here for another go.
Yeah I mention that in the video, it pretty much justifies that Pascal's triangle consists of binomial coefficients, based on how the triangle is built! Pretty sweet!
It’s cool. And I like this proof. However, it doesn’t quite work for n = 0, which cannot be expressed as a sum. Nor for the cases k = 0 and k = n. The case n = 0 corresponds to the tip of the triangle, while k= 0 and k = n are the sides of the triangle. The formula should be restricted to n > 1 and 0 < k < n. The cases n = 0 and k = {0, n} can serve as the terminating cases (return 1) in a computer program implementation of the recursion.
![Matt Explains: Binomial Coefficients [featuring: choose function, pascal's triangle]](http://i.ytimg.com/vi/Pcgvv6T_bD8/mqdefault.jpg)
![Matt Explains: Binomial Coefficients [featuring: choose function, pascal's triangle]](/img/tr.png)
Thank you for taking the time to put this together. I really appreciate it. I won’t tell you how many times I watched it before k-1 clicked, but the 💡 moment was worth it!
Of course, thanks so much for watching! It is tricky, your repetitions are only a sign of determination and persistence! Glad it clicked!
When you noticed that the letter h was too far from the rest of the word, you killed me. Nice video, thanks.
Haha thanks for watching! Sometimes the words just don't come out looking right!
Fantastic explaination! Thank you so much for this video!
Thanks a lot for watching, and I am glad it was clear!
Thank you so much. I was definitely searching for this kind of explanation. Keep it up!
Thank you, glad to help!
kjjjjumju b
@@WrathofMath
Great! Amazing! Incredible!
Thanx for sharing your knowledge in such a clear way!!!
Thank you! Gracias! Grazie! Merci!!!!!!!!!!!!!!!!!!
So glad to help, thanks for watching!
nice title : *wrath of math*
Thanks buddy. Good explaination
Glad to help! Thanks for watching!
Very clear explanation!
Thanks for watching!
Thank u sir ! U helped a lot.. much love from Malaysia ! 🇲🇾 ❤️
My pleasure, thanks for watching!
thank you for the video, but I have a question
Does the interval effect on this process? If yes explain how.
Helped. A lot. Thanks
Thanks for another great explanation! I've found videos on graphing sin^2 x and cos^2 x, using the power reducing formulas, but I have yet to find a video for graphing tan^2 x. I would love a step-by-step video for that. Just a suggestion though, no pressure. I'll be watching all your videos either way.
Thanks for watching and for the request! That sounds like a good idea, I'm seriously rusty on trig, but I'll dive back in and take a look, could have some good lessons there! And I appreciate your support, got a real doozy of a video coming early this week if all goes well :)
@@WrathofMath Looking forward to it!
@@WrathofMath pm loo kk ☺️
@@WrathofMath pml
@@WrathofMath ok oo lol.n mom mmm mom
Thank you!
You're welcome!
Please make a video about maximum number of directed triangle in a complete directed graph
Thanks for watching and for the request! Counting problems are always fun, especially with graph theory involved, I’ll do that lesson soon :)
I understood nothing
Thanks for watching and I am sorry it didn't help! Do you have any questions I can help clear up?
Beautiful
Excellent and intuitive which is always great
Thank you!
I could have figured this out by myself but could not why!! 😐 Nice video thanks!
It works every time with any size set and any subset selected, but I still don't see why. I'm missing some basic, fundamental understanding. Frustration!!!!!!
I understood the formula but it's not making any sense to me
Thanks for watching and sorry if it was unclear! Do you mean you understand what the formula was saying but not the proof? Where did I lose you in the explanation? I think the trickiest part is the concept of arbitrarily focusing on a single element in our n-element set, in order to split our count into separate binomial coefficients. I’d be happy to try to explain that a little more here, or something else depending on what your confusion is.
If your confusion stems from not understanding the concept of double counting, I suggest reading the first paragraph and the subsection "Forming committees" on the Wikipedia page "Double counting (proof technique)." Once you can follow that proof, return here for another go.
@@WrathofMath I didn't understand the proof
@@mike_the_tutor1166 Ok I will do that
Isn’t this just Pascals’s triangle. T(n,k) = T(n-1,k) + T(n-1,k-1)
Yeah I mention that in the video, it pretty much justifies that Pascal's triangle consists of binomial coefficients, based on how the triangle is built! Pretty sweet!
It’s cool. And I like this proof. However, it doesn’t quite work for n = 0, which cannot be expressed as a sum. Nor for the cases k = 0 and k = n. The case n = 0 corresponds to the tip of the triangle, while k= 0 and k = n are the sides of the triangle. The formula should be restricted to n > 1 and 0 < k < n. The cases n = 0 and k = {0, n} can serve as the terminating cases (return 1) in a computer program implementation of the recursion.
sorry but that's not the demonstration. It should be by operating one side till you get the original combinatory formula.