Sun's curious identity

In combinatorics, Sun's curious identity is the following identity involving binomial coefficients, first established by Zhi-Wei Sun in 2002:

Proofs

After Sun's publication of this identity, five other proofs were obtained by various mathematicians:

  • Panholzer and Prodinger's proof via generating functions;
  • Merlini and Sprugnoli's proof using Riordan arrays;
  • Ekhad and Mohammed's proof by the WZ method;
  • Chu and Claudio's proof with the help of Jensen's formula;
  • Callan's combinatorial proof involving dominos and colorings.
gollark: I don't consider this clear because it's not distinguished from the *other* religious books which also claim to be ultimate universal truth.
gollark: I don't think this justifies being punished forever, *infinitely*, especially since, as you said, part of it is a product of the environment. Guess which omnipotent god set up that environment?
gollark: No, this is also terrible. They only punish you *after* you do things, with no clear guide about what's acceptable and what isn't.
gollark: I mean, sure, but other people will be eternally tortured.
gollark: I don't think they should be supporting entirely avoidable eternal torture.

References

  • Callan, D. (2004), "A combinatorial proof of Sun's 'curious' identity" (PDF), INTEGERS: The Electronic Journal of Combinatorial Number Theory, 4: A05, arXiv:math.CO/0401216.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.