Sandi Xhumari ACF Abstract FY10

“Generating Functions and their applications”

Conference Name: MathFest

A lot of problems turn into Recurrence Relations, where the next term depends on the previous ones. For example, every term in the Fibonacci sequence is defined as the sum of the two previous terms, which is a Recurrence Relation. One of the most powerful tools to solve Recurrence Relations is Generating Functions. In this presentation, I will introduce you to Generating Functions and apply them to some specific problems. Next time you are faced with a Recurrence Relation, you will have a brand new secret weapon up your sleeve!

Page last modified November 24, 2010