[Also presented at the 11th Fibonacci Conference, and published in its proceedings in Congressus Numerantium 194 (Jan. 2009), 263-264.]
Written: May 24 2004
When I was young and handsome, I couldn't see an identity without trying to prove it bijectively. Somehow, I weaned myself of this addiction. But the urge got rekindled, when I read Arthur Benjamin and Jennifer Quinn's masterpiece `Proofs that Really Count', that contained some challenges that the authors couldn't do (or so they said). This is the result. It was derived using a meta-algorithm that converts `ugly manipulatorics proofs' into `beautiful bijective proofs', that I hope to describe elsewhere (and program, so that Shalosh can start doing these bijective proofs).
.dvi version (for previewing)
The Personal Journal of Ekhad and Zeilberger
Doron Zeilberger's List of Other Papers
Doron Zeilberger's Home Page