Combinatorial and automated proofs of certain identities

Abstract

This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machine- assisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.