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
- This resource is only available on an unencrypted HTTP website.It should be fine for general use, but don’t use it to share any personally identifiable information