You're a good teacher. You repeat things without sounding like you're repeating them. Gives time for things to sink in and gives a few ways to think about it.
I am a mathematics Ph.D. student, and I use this formula all the time I never thought of its proof, I really found this proof elegant and well explained. Thanks.
Very good, but need to watch this again and again to grasp it completely. Generalizations are always more difficult to prove than specific cases. Thank you.
this feels like factor groups in abstract algebra, each subset of permutations feel like a coset. but what is the normal subgroup? or is this just completely different?
k! is order mattering -> (n-k)! is order mattering. -> n! is number of orderings with ordering mattering -> n choose k is ordering not mattering Whattt?
when you group them in boxes, many orders go to a single point. you only have to figure out the total number of orders (n!), and the number on of orders per box (k!(n-k)!).Then you divide the total by the boxes' total and you get the amount of points.
Is there a simple algebraic proof for why these binomial coefficients are integers, given that formula? i can see why either (n-k)! or k! divide n!, but not why the product (n-k)!k! divides n! ... Seems spooky to me
This is brilliant. What I think though, is, you can add some specific example and explain it in the same way. I know that if you would have explained it with just an example, I would have asked about the generalization after that. But first general proof and then an example, I think is be better. Do not worry though, because I am trying an example myself. Thank you for a great explanation. Please let it be my favorite too.
You're a good teacher. You repeat things without sounding like you're repeating them. Gives time for things to sink in and gives a few ways to think about it.
I am a mathematics Ph.D. student, and I use this formula all the time I never thought of its proof, I really found this proof elegant and well explained. Thanks.
Really elegant and clearly communicated. You're underrated. Thanks
Very good, but need to watch this again and again to grasp it completely. Generalizations are always more difficult to prove than specific cases. Thank you.
Sorry babe you’ll have to wait mu prime math just uploaded
Very good, as ever. Thanks for your efforts to bring this science to everybody. From Salzburg, Jorge
ACT student here. had a question that needed this equaiton for a question. Explanation really made it clear how this works. Thanks
I am learning from nepal. I love the way you teach.
bravo 👏🏻 i’ll never forget the induction of that formula
Best proof of this I've ever seen - I wish you had been my high school teacher
Amazing proof! Very easily digestible, great content
this feels like factor groups in abstract algebra, each subset of permutations feel like a coset. but what is the normal subgroup? or is this just completely different?
Love the t-shirt! And that is indeed a great proof
Lovely proof.
This video can be enjoyed by any level of student.
This was extremely clever! Thanks for the explanation 👍
Beautiful and intuitive proof
where can i get that shirt?
What a perfect explanation, well presented as well
Clearly stated.
luved it!
Bravo'
why do we have to multiply n choose k at the end to make n!😢😢
sorry but i couldnt get it after 1:30, maybe it was just me
k! is order mattering -> (n-k)! is order mattering. -> n! is number of orderings with ordering mattering -> n choose k is ordering not mattering Whattt?
when you group them in boxes, many orders go to a single point. you only have to figure out the total number of orders (n!), and the number on of orders per box (k!(n-k)!).Then you divide the total by the boxes' total and you get the amount of points.
Nicely done! Still waiting for you to start lecturing from 201 Bridge or 22 Gates.😁
This is a cool proof! Thanks :)
Cool intuitive proof!
Is there a simple algebraic proof for why these binomial coefficients are integers, given that formula? i can see why either (n-k)! or k! divide n!, but not why the product (n-k)!k! divides n! ... Seems spooky to me
Great video bro
So well explained, thanks
Hello im a professer! This is amazing how its proved!
Another lefty🎉
This is brilliant. What I think though, is, you can add some specific example and explain it in the same way. I know that if you would have explained it with just an example, I would have asked about the generalization after that. But first general proof and then an example, I think is be better. Do not worry though, because I am trying an example myself. Thank you for a great explanation. Please let it be my favorite too.
Really well explained, thanks.
Thanks for explanation
Well explained. Thanks!
Thanks. Should help with my test.
So nice!
Awesome!
That was great.
Fantastic!
Very nice!
first time ive noticed someone writing overhanded, with a functional hand
Nice video!
Very helpfull!
You make this look so easy..m thanks
beautiful
are u a teacher in a uni?
No, I'm still a student!
perfect
Legends watching before Exams
Yooo thats pretty goood
Holy shit dude I get it
That was a cool
😊
Whaou😊
Travith B.I.B.L.E
Tama Bayan ang answer
mathematical bible
😂 literally
Excellent video sir
😊
Tama Bayan ang answer
😊