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