Sunday, 12 June 2016

combinatorics - Prove by induction that sumlimitsnk=mnchoosekkchoosem=nchoosem2nm.


Prove by induction that  nk=m(nk)(km)=(nm)2nm.




I can't figure out what is the base case. Could someone show the steps?

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...