Search⌘ K
AI Features

Solution: Fibonacci Number

Discover how to calculate Fibonacci numbers efficiently by applying Binet’s formula and the golden ratio. This lesson helps you move beyond slow recursion to a method that computes results in logarithmic time with constant space.

Statement

The Fibonacci sequence is a famous series of numbers in which each value is created by adding the two preceding numbers. The sequence begins with:

  • F(0)=0F(0) = 0

  • F(1)=1F(1) = 1

From that point on, every term is defined as:

  • F(n)=F(n1)+F(n2)F(n) = F(n - 1) + F(n - 2), for any nn greater than 11 ...