Recurrence relations in mathematics form a very powerful and compact way of looking at a wide range of relationships. Traditionally, the concept of recurrence has often been a difficult one for the secondary teacher to convey to students. Closely related to the powerful proof technique of mathematical induction, recurrences are able to capture many relationships in formulas much simpler than so-called direct or closed formulas. In computer science, recursive coding often has a similar compactness property, and, perhaps not surprisingly, suffers from similar problems in the classroom as recurrences: the students often find both the basic concepts and practicalities elusive. Using models designed to illuminate the relevant principles for the students, we offer a range of examples which use the modern spreadsheet environment to powerfully illustrate the great expressive and computational power of recurrences.
Abramovich, Sergei and Sugden, Stephen J.
"Revisiting Polya's summation techniques using a spreadsheet: from addition tables to Bernoulli polynomials,"
Spreadsheets in Education (eJSiE):
3, Article 4.
Available at: http://epublications.bond.edu.au/ejsie/vol2/iss3/4