October 21, 2008
Recursively Defined Functions
We are familiar with the use of formulae to define
functions. But it is also possible to define some
functions using recursion.
f(n) = n2 for n ∈ Z≥0
f(0) = 0
f(n+1) = f(n) + (2n + 1), for n ∈ Z≥0