Q.954 and A.954, Quickie Problem and Solution

Authors

Arthur T. Benjamin, Harvey Mudd CollegeFollow
Michel Bataille

Document Type

Article

Department

Mathematics (HMC)

Publication Date

10-2005

Abstract

Problem and proof proposed by authors.

Another proof, using lattice paths, can be found in Robert A. Sulanke's article, Objects Counted by the Central Delannoy Numbers, The Journal of Integer Sequences, Vol 6, 2003. A proof by polynomials is in Michel Bataille's paper Some Identities about an Old Combinatorial Sum, The Mathematical Gazette, March 2003, pp. 144-8. A slight change in the above proof leads to m ≥ n, a generalization proved by Li Zhou using lattice paths in The Mathematical Gazette.

Comments

First published by Mathematics Magazine, vol. 78, no. 4 (October 2005), pg. 324, 329 by The Mathematical Association of America.

Rights Information

© 2005 Mathematical Association of America

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Recommended Citation

Benjamin, A.T., & Bataille, M. (2005). Q.954 and A.954, quickie problem and solution. Mathematics Magazine, 78(4): 324, 329.