Fibonacci Identities

Math 242 practice problems

Name: _________________

Learning Goals: Formulate precise mathematical conjectures supported by computational evidence.

Your task: Complete Exercises 2.21 and 2.22 from our Computational Mathematics text. These exercises are reprinted below.

Due: Wednesday, February 28, at 5:00pm. Upload your solution as a Mathematica notebook to the Fibonacci Identities assignment (Moodle link).

Grading: If you state a conjecture involving Fibonacci numbers and supported by your computational evidence, you will earn a Satisfactory grade for each problem.

Need help? Review the notes from class (which are posed on the course web site), talk with your classmates, email Prof. Wright, or visit the help session.

Problem 1: Exercise 2.21

Compute (Subscript[F, m])(Subscript[F, n+1])-(Subscript[F, m+1])(Subscript[F, n]) for lots of positive integers n and m>n. What patterns do you observe? Conjecture an identity whose left side is (Subscript[F, m])(Subscript[F, n+1])-(Subscript[F, m+1])(Subscript[F, n]).

Problem 2: Exercise 2.22

Investigate (Subscript[F, m])(Subscript[F, n+j])-(Subscript[F, m+j])(Subscript[F, n]) computationally (that is, for lots of positive integers n, m>n, and j). Based on your evidence, state a Fibonacci identity conjecture. 

(Hint: If you set j=1, then you’re back to the previous problem. So try j=2 first. Then try j=3. Then try other j.)