My favorite proof of the n choose k formula!

preview_player
Показать описание
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!

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.

Mrcloc
Автор

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.

azzeddinebekkari
Автор

Really elegant and clearly communicated. You're underrated. Thanks

vanishmanesh
Автор

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.

reshmabhagwat
Автор

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

ianyu
Автор

Sorry babe you’ll have to wait mu prime math just uploaded

dr.mikelitoris
Автор

Very good, as ever. Thanks for your efforts to bring this science to everybody. From Salzburg, Jorge

jorgeuliarte
Автор

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

frankyin
Автор

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

chandansinghdhami
Автор

Lovely proof.

This video can be enjoyed by any level of student.

DirtyHuman
Автор

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

farrukhazfar
Автор

Amazing proof! Very easily digestible, great content

tny
Автор

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

mrigayu
Автор

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

tomkerruish
Автор

This was extremely clever! Thanks for the explanation 👍

eldestisland
Автор

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?

deathstorm
Автор

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?

jfcrow
Автор

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

fromhua
Автор

What a perfect explanation, well presented as well

Couldyanot
Автор

Clearly stated.
luved it!
Bravo'

MrsBostic-hi