Curated and Reviewed by
Lesson Planet
In this Fibonacci activity, students prove by induction the Fibonacci numbers are recursive. They find a recursive definition for a given set of numbers. This two-page activity contains five multi-step problems that involve proofs.
10 Views
12 Downloads
Additional Tags
Resource Details