Question
Prove that is the closest integer to , where .
Hint: Let .
Use induction and the definition of the Fibonacci numbers (see section 1.2.2) to prove that .
Answer
As instructed in the question, we are proving first.
First, assume a simple base case of .
Let us prove that the theorem holds:
Of course, :
Having proven the base case of , we should prove the base case as well, since these two numbers are not themselves the result of a Fibonacci operation.
We can now move on to proving the case .
Remember the definition of the Fibonacci sequence: .
Let us replace with :
We will use this definition to carry out the proof.
Remember the equation which we are trying to prove.
From this follows:
Remember that and :
This, of course, is equivalent to the function definition.
The equation is proven by induction.
Now, let’s prove that is always the closest integer to .
A mathematical way to phrase this would be as follows:
As we just proved, is equivalent to .
So let us rewrite the above equation accordingly:
The actual value of is .
So, taking the -th power of ( being a positive integer), the value of will approach .
This means that the maximum value that can hold is which is .
From this follows that the maximum value of the left side of our equation is .
This equates to , which is less than .
Since the result of the left side will only get smaller than this, the statement is proven.