That document is not working on my computer.
After a quick read-through I think it's OK. There are many many ways of showing that the ratio of successive Fibonacci numbers tends to the Golden Ratio.
Let's establish some notation. Let be the Golden Ratio and the conjugate, so that are the roots of with and .
One way is to find an explicit expression for F_n. A recurrence relation of the form has a general solution of the form where are the roots of the auxiliary polynomial , and A,B are determined by two initial values. There is an exception when the auxiliary has repeated roots, in which case the general solution is : that case doesn't apply here.
From this is is easy to derive , and if you don't want to rely on the assertions just made about the theory of recurrence relations, you can prove it directly by induction (true for cases n=0 and 1, and check that the expression given on the RHS of that formula has the same recurrence relation as F_n). In turn, it's now easy to check that .
Other ways are based on the observation you already made, that if the sequence of ratios tends to a limit at all, that limit must be the Golden Ratio.
So you could directly consider . It's not too hard to show that = = = . In magnitude this is less than at least when n is larger than 6, say. That is, the difference is alternating in sign and diminishing in magnitude by a factor of at least 2 each step, which is easily enough for convergence.
The most difficult part of the proof is showing that the sequence is indeed convergent. Then once you have that you can manipulate it to get your result.
This is why I asked you in your other post if your studied countinued fractions, because all countinued fractions are convergent, thus that messy part is already proven.
---------
This is perhaps an easier way, if you would like. There is a formula for the fibonacci sequence in terms of an exponention function due to Binet. I can provide a proof if you would like.
Thanks for the offer but as I have never studied Binet, therefore I don't think I should use it. I'm trying hard on the other thread though the one on 'Proof by induction' to get an answer. To fill the gaps basically and it is due in tomorrow :-(Originally Posted by ThePerfectHacker
I am assuming you think that 'Binet' means some kind of theory/branch in math. No it is just a formula involving fibonacci numbers, (and its proof is based on induction). It is very simple nothing complicated if that was what frightened you.Originally Posted by Natasha1
As you know the 'divine proprtion' satisfies,Originally Posted by Natasha1
Now this equation has two roots,
called 'the divine proprtion'
and,
no special interest.
----
Therefore,
Multiply both sides by thus,
but, thus,
Multiply both sides by thus,
but, thus,
Multiply both sides by thus,
but, thus,
thus,
-----
Did you notice something?
Firstly that,
for some integers , that you probably saw. But that you see that,
?
I will leave that as an excerise to you that prove that this fibonacci pattern still holds (this is induction type proof).
Similarly we have that,
because it is developed in the same manner as for .
---------
As a result we have two equations, for .
From (1) subtract (2) to get,
Thus,
Thus,
-this is called binet's formula.
Anyways, you wish to demonstrate that the fibonaccis converge to you can do this by showing that,
Though this looks like a complicated limit it is not. Divide the numerator and denominator by thus,
But,
therefore as we have that,
Thus,