Fibonacci Calculator

Enter n to find the nth Fibonacci number.

A whole number from 0 to 10 000.

Try

Result

You enteredF10F_{10}

F10=55\displaystyle F_{10} = 55

Number of digits

2\displaystyle 2

Ratio to the previous

1.617647\displaystyle 1.617647
Show the work
  1. Fibonacci recurrence

    Each Fibonacci number is the sum of the two before it, starting from F0=0F_0 = 0 and F1=1F_1 = 1.

    Using Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2}

    0,  1,  1,  2,  3,  5,  8,  13,  21,  34,  55⇒F10=55\begin{gathered} 0,\; 1,\; 1,\; 2,\; 3,\; 5,\; 8,\; 13,\; 21,\; 34,\; 55 \\ \Rightarrow \\ F_{10} = 55 \end{gathered}
  2. Binet's formula as a check

    A closed formula gives the same number without the earlier terms. With φ=1+52\varphi = \frac{1 + \sqrt{5}}{2} and ψ=1−52\psi = \frac{1 - \sqrt{5}}{2}, the answer is the difference of the two powers over 5\sqrt{5}; it rounds to 55.

    Using Fn=φn−ψn5F_n = \frac{\varphi^n - \psi^n}{\sqrt{5}}

    φ10≈122.991869ψ10≈0.008131F10≈55→55\begin{gathered} \varphi^{10} \approx 122.991869 \\ \psi^{10} \approx 0.008131 \\ F_{10} \approx 55 \to 55 \end{gathered}
  3. Result

    So F10=55F_{10} = 55.

Worked examples