Thursday, 18 August 2016

combinatorics - Proving sum2mk=0(1)kbinom2mk3=(1)mbinom2mmbinom3mm (Dixon's identity)



I found the following formula in a book without any proof:



2mk=0(1)k(2mk)3=(1)m(2mm)(3mm).




I don't know how to prove this at all. Could you show me how to prove this? Or If you have any helpful information, please teach me. I need your help.



Update : I crossposted to MO.


Answer



I'm posting an answer just to inform that the question has received an answer by Igor Rivin on MO.



https://mathoverflow.net/questions/143334/proving-sum-k-02m-1k-binom2mk3-1m-binom2mm-binom3mm



Mark Wildon mentioned that this is Dixon's identity.




http://en.wikipedia.org/wiki/Dixon%27s_identity


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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