Samantha Dahlberg ACF Abstract FY10

“On Proofs of Summation Identities”

Conference Name: MathFest 2009

The problem of finding closed-form expressions for various sums and proving identities among them is among ancient and attractive mathematical problems. One of the most exciting discoveries in the early nineties, due to H. Wilf and D. Zeilberger, was that finding close-form expressions for various sums and proofs for special class of summation identities can be efficiently and elegantly handled by the computer. In this talk we explore and highlight the Wilf-Zeilberger (WZ) method and show various practical applications of Zeilberger’s algorithm. This work was done at the 2009 REU program at Grand Valley State University.

Page last modified November 24, 2010