My favorite proof of the n choose k formula! 

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

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

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.

ACT student here. had a question that needed this equaiton for a question. Explanation really made it clear how this works. Thanks

bravo 👏🏻 i’ll never forget the induction of that formula

I am learning from nepal. I love the way you teach.

Love the t-shirt! And that is indeed a great proof

This was extremely clever! Thanks for the explanation 👍

Clearly stated. luved it! Bravo'

Amazing proof! Very easily digestible, great content

Beautiful and intuitive proof

Lovely proof. This video can be enjoyed by any level of student.

What a perfect explanation, well presented as well

Thanks. Should help with my test.

Best proof of this I've ever seen - I wish you had been my high school teacher

Nicely done! Still waiting for you to start lecturing from 201 Bridge or 22 Gates.😁

This is a cool proof! Thanks :)

Cool intuitive proof!

Great video bro

So well explained, thanks

That was great.

Thanks for explanation

Really well explained, thanks.

So nice!

Well explained. Thanks!

Awesome!

Fantastic!

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?

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.

why do we have to multiply n choose k at the end to make n!😢😢

Another lefty🎉

Very nice!

beautiful

You make this look so easy..m thanks

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?

Hello im a professer! This is amazing how its proved!

Very helpfull!

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

Nice video!

sorry but i couldnt get it after 1:30, maybe it was just me

where can i get that shirt?

first time ive noticed someone writing overhanded, with a functional hand

perfect

Holy shit dude I get it

Yooo thats pretty goood

That was a cool

😊

Legends watching before Exams

Travith B.I.B.L.E

Whaou😊

Tama Bayan ang answer

mathematical bible

Excellent video sir

😊

Tama Bayan ang answer

😊