My favorite proof of the n choose k formula!
Вставка
- Опубліковано 28 вер 2024
- The binomial coefficient shows up in a lot of places, so the formula for n choose k is very important. In this video we give a cool combinatorial explanation of that formula!
Challenge Problems playlist: • Challenge Problems
Subscribe to see more new math videos!
Music: OcularNebula - The Lopez
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.
Really elegant and clearly communicated. You're underrated. Thanks
Sorry babe you’ll have to wait mu prime math just uploaded
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.
Nicely done! Still waiting for you to start lecturing from 201 Bridge or 22 Gates.😁
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.
I am learning from nepal. I love the way you teach.
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?
Beautiful and intuitive proof
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.
Amazing proof! Very easily digestible, great content
Great video bro
where can i get that shirt?
Clearly stated.
luved it!
Bravo'
Thanks. Should help with my test.
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.
sorry but i couldnt get it after 1:30, maybe it was just me
Thanks for explanation
That was great.
So well explained, thanks
Well explained. Thanks!
So nice!
beautiful
Nice video!
first time ive noticed someone writing overhanded, with a functional hand
Holy shit dude I get it
perfect
😊
Legends watching before Exams
Travith B.I.B.L.E
Excellent video sir
Tama Bayan ang answer
Very good, as ever. Thanks for your efforts to bring this science to everybody. From Salzburg, Jorge
😊
Tama Bayan ang answer
why do we have to multiply n choose k at the end to make n!😢😢
Another lefty🎉
bravo 👏🏻 i’ll never forget the induction of that formula
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
Love the t-shirt! And that is indeed a great proof
This was extremely clever! Thanks for the explanation 👍
Cool intuitive proof!
This is a cool proof! Thanks :)
Lovely proof.
This video can be enjoyed by any level of student.
What a perfect explanation, well presented as well
Awesome!
😊
Fantastic!
Very nice!
ACT student here. had a question that needed this equaiton for a question. Explanation really made it clear how this works. Thanks
mathematical bible
😂 literally
Best proof of this I've ever seen - I wish you had been my high school teacher
Hello im a professer! This is amazing how its proved!
Yooo thats pretty goood
Really well explained, thanks.
Very helpfull!
That was a cool
Whaou😊
You make this look so easy..m thanks