A perfect square is a number of the form n2, where n20 is a whole number....

Transcribed Image Text:

A perfect square is a number of the form n2, where n20 is a whole number. The Fibonacci numbers are defined by the initial values F(0) = 0 and F(1) = 1 and the recursion F(n + 1) = F(n) + F(n – 1) for n 2 1. For example, F(2) = 1, F(3) = 2, F(4) = 3 and F(5) = 5. Determine all numbers less than 10,000 that are both a perfect square and a Fibonacci number. %3D %3D %3D A perfect square is a number of the form n2, where n20 is a whole number. The Fibonacci numbers are defined by the initial values F(0) = 0 and F(1) = 1 and the recursion F(n + 1) = F(n) + F(n – 1) for n 2 1. For example, F(2) = 1, F(3) = 2, F(4) = 3 and F(5) = 5. Determine all numbers less than 10,000 that are both a perfect square and a Fibonacci number. %3D %3D %3D