arXiv Analytics

Sign in

arXiv:1307.6693 [math.CO]AbstractReferencesReviewsResources

A short proof of a famous combinatorial identity

Rui Duarte, António Guedes de Oliveira

Published 2013-07-25Version 1

We explain how the identity $$\sum_{i+j=n}\binom{2i}{i}\binom{2j}{j}\;=\;\displaystyle4^n$$ is an easy consequence of the inclusion-exclusion principle.

Related articles: Most relevant | Search more
arXiv:1402.7326 [math.CO] (Published 2014-02-28)
Analysis of the parallel peeling algorithm: a short proof
arXiv:1605.04000 [math.CO] (Published 2016-05-12)
A short proof that NMF is NP-hard
arXiv:1710.10973 [math.CO] (Published 2017-10-30)
A short proof of a lower bound for Turán numbers