SICP exercise 1.13
From Drewiki
Problem
Prove that Fib(n) is the closest integer to
,
where
.
Hint: Let
and use induction and the definition of the Fibonacci numbers to prove that
.
Solution
This exercise is off-topic, having little or nothing to do with the subject of the book, but a proof by induction follows. We must show that the equality holds true for n=0 and n=1, and then show that if we assume it's true for n=i, it must also be true for n=i+1.
Fib(0) = 0
and
Also:
Fib(1) = 1
and
Now, by induction, we assume that
is true for all n up to and including n = i + 1. We must now show that
We know, by the definition of Fib(n), that
Fib(i + 2) = Fib(i + 1) + Fib(i)
Then by substitution:
Observe that
and also
Similarly, we can also easily prove that
1 + ψ = ψ2
Then, substituting back into the original equation we get:
which proves, by induction, that
Credits
Hank Meuret pointed out a missing square in the φ2 equation.

