Fibonacci Calculator
Enter n to find the nth Fibonacci number.
A whole number from 0 to 10 000.
Try
Result
You entered
Number of digits
Ratio to the previous
Show the work
Lucas recurrence
Lucas numbers follow the Fibonacci rule (each term is the sum of the two before it) but start from and .
Using
Lucas numbers from Fibonacci numbers
Every Lucas number is the Fibonacci number just before it plus the one just after it.
Using
Binet's formula as a check
A closed formula gives the same number without the earlier terms. With and , the answer is the sum of the two powers; it rounds to 123.
Using
Result
So .