Combinatorial and Automated Proofs of Certain Identities

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.United States. National Security Agency (Grant H98230-10-1-0222