In this Fibonacci learning exercise, students prove by induction the Fibonacci numbers are recursive. They find a recursive definition for a given set of numbers. This two-page learning exercise contains five multi-step problems that involve proofs.