March 5, 2015Applied Discrete Mathematics Week 6: Counting 1 Recursively Defined Functions A famous example: The Fibonacci numbers f(0) = 0, f(1) = 1 f(n)