Concepts · 3 min read

Fibonacci Sequence and the Golden Ratio, Computed

Fibonacci Sequence and the Golden Ratio, Computed — illustration
In short: Each Fibonacci number is the sum of the previous two: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … Their ratios approach φ = (1 + √5)/2 ≈ 1.618033989.

The sequence

Start with 0 and 1 and keep adding.

nF(n)nF(n)
001055
111189
2112144
3213233
4314377
5515610
6816987
713171597
821182584
934194181

Ratios converge to φ

nF(n+1) ÷ F(n)
51.6
81.619047619
101.618181818
151.618032787
201.618033999
251.618033989

φ itself is 1.618033989, and it satisfies φ² = φ + 1 (check: φ² = 2.618033989). The convergence is very fast.

Binet’s formula

F(n) = (φⁿ − ψⁿ)/√5 where ψ = (1 − √5)/2. For n = 10: 55, matching F(10) = 55.

φ^10 ≈ 122.99 (the dominant term)
Answer122.99186938
Step-by-step working 3 steps
  1. 1
    Write it as a power
    1.618034^10
  2. 2
    Repeated multiplication

    1.618034 is multiplied by itself 10 times.

  3. 3
    Result
    1.618034^10 = 122.99186938

Connections

  • Sums: F(1) + … + F(n) = F(n+2) − 1.
  • Fibonacci numbers appear as sums along the diagonals of Pascal’s triangle.
  • Consecutive Fibonacci numbers are coprime.

Check coprimality with the LCM and GCF calculator: LCM 33552 · GCF 1.

Frequently asked questions

What is the golden ratio?

About 1.6180339887, the positive solution of x² = x + 1.

Is the sequence infinite?

Yes, and it grows exponentially: F(30) = 832,040.

Written and reviewed by Mateuss M.

Mateuss M. writes and reviews mathematical content for CalcSolver, focusing on online calculators, formulas, equations, and practical math tools. He reviews calculator functionality, calculation methods, formulas, examples, and explanations to help ensure that each tool is clear, useful, and easy to understand.

Keep reading