Need help w/ Fibonnaci and Golden Ratio proof

Click For Summary
SUMMARY

The discussion focuses on the mathematical proof involving Fibonacci numbers and the Golden Ratio (Phi). It establishes that for successive Fibonacci numbers F_n and F_n+1, the inequality |(F_n+1)/(F_n) - Phi| < 1/(2(F_n)^2) holds true. The nth Fibonacci number is defined using the formula F_n = (1/sqrt(5)) * [Phi^n - (-1/Phi)^n]. The conversation also highlights that the formula does not apply to the first three Fibonacci numbers and poses questions about the behavior of the equation as n approaches infinity.

PREREQUISITES
  • Understanding of Fibonacci sequence and its properties
  • Knowledge of the Golden Ratio (Phi)
  • Familiarity with mathematical inequalities
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the derivation of the Fibonacci sequence formula
  • Explore the properties of the Golden Ratio in mathematical proofs
  • Investigate limits and asymptotic behavior in sequences
  • Learn about mathematical induction and its application in proofs
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in the relationship between Fibonacci numbers and the Golden Ratio.

billy2908
Messages
12
Reaction score
0
Let F_n and F_n+1 be successive Fibonnaci numbers. Then |(F_n+1)/(F_n) - Phi | < 1/(2(F_n)^2)

Where Phi is the Golden ratio.
 
Physics news on Phys.org
Just use the formula for nth fibonacci number.
 
It's not that simple. I tried fracturing it many times but every time it just seem to leave to the same result.
 
Remember that the nth Fibonacci number is:

F_n = \frac {1} {\sqrt{5}} \left [ \phi^n - \left ( \frac {-1}{\phi}\right)^n\right]

and you can multiply Fn2 through your equation:

\left | F_{n+1} \times F_{n} - \phi \times F^2_n \right | &lt; \frac {1}{2}

What happens when you set the whole equation to terms of \phi?

Note that for the first 3 Fibonacci numbers: 0,1,1 the formula doesn't work. Additionally, as we get deeper into the Fibonacci sequence, F_n as n \to \infty, what does \left | F_{n+1} \times F_{n} - \phi \times F^2_n \right | approach? hint: you might see the value first for a specific very low n
 
Last edited:

Similar threads

Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 14 ·
Replies
14
Views
2K