Fibonacci Calculator

Compute the n-th Fibonacci number F_n where F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}. Uses BigInt for exact answers up to n = 200.

Frequently Asked Questions

What is the Fibonacci sequence?

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... where each term is the sum of the previous two.

Why is the golden ratio related?

Because F sub n divided by F sub n minus 1 converges to phi as n grows. The closed-form Binet formula expresses F sub n exactly in terms of phi.

How big can n be?

This calculator handles n up to 200, returning the exact value via BigInt. For larger n, matrix exponentiation or modular arithmetic is recommended.

Important Disclaimer: Estimates for informational purposes only.

This calculator provides estimates for informational purposes only. Results are based on assumptions and may not reflect actual outcomes. Consult qualified professionals in relevant fields before making important decisions based on these results.