Fibonacci Number Checker

About Fibonacci Number Checker

Welcome to the Fibonacci Number Checker — an instant, mathematically rigorous way to determine whether any positive integer belongs to the Fibonacci sequence. Instead of generating the sequence term by term, the tool applies Gessel's perfect-square theorem for an O(1) verdict, then enriches the answer with the exact index \(F_n\), the unique Zeckendorf representation, a golden-ratio convergence check, and a drawn Fibonacci spiral.

What Is the Fibonacci Sequence?

The Fibonacci sequence is defined by the simple recurrence relation:

The first twenty terms are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181. The sequence grows exponentially — roughly by a factor of the golden ratio \(\varphi = \frac{1+\sqrt{5}}{2} \approx 1.61803\) with each term.

How the Checker Works: Gessel's Theorem

Rather than iteratively building the sequence, this tool uses a stunning 1972 result by Ira Gessel:

So to check whether, say, 144 is Fibonacci, compute \(5 \times 144^2 + 4 = 103{,}684 = 322^2\) — a perfect square. Done. No generation required. The test is constant-time modulo arbitrary-precision square roots, making this checker blazingly fast even on 30-digit inputs.

Binet's Formula: The Closed Form

The same golden ratio also gives a closed-form expression for any Fibonacci number:

Because \(|\psi| < 1\), the term \(\psi^n\) decays rapidly and \(F_n \approx \varphi^n / \sqrt{5}\) rounded to the nearest integer. This is why the ratio \(F_{n+1} / F_n\) converges to \(\varphi\).

Zeckendorf's Theorem

Every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers (excluding \(F_1 = 1\), which would be redundant with \(F_2 = 1\)). This is the Zeckendorf representation and forms the basis of the Fibonacci numeral system:

• 100 = 89 + 8 + 3 = \(F_{11} + F_6 + F_4\)
• 50 = 34 + 13 + 3 = \(F_9 + F_7 + F_4\)
• 1000 = 987 + 13 = \(F_{16} + F_7\)

The tool computes this representation for any positive integer you enter — even if your number isn't Fibonacci itself, you still see its decomposition into Fibonacci atoms.

How to Use This Calculator

1. Enter a number: Type any non-negative integer up to \(10^{30}\). The tool uses Python's arbitrary-precision integers, so huge inputs work flawlessly.
2. Click Check Fibonacci Number: The Gessel test runs instantly.
3. Read the verdict banner: Gold means Fibonacci (with the exact index \(F_n\) displayed); gray means not.
4. Explore: Review the two Gessel test results, the highlighted sequence strip, the golden spiral, the Zeckendorf breakdown, and the step-by-step proof.

Interesting Facts About Fibonacci Numbers

• 144 is special: It's the largest Fibonacci number that is also a perfect square. In fact, 144 = \(12^2 = F_{12}\). The only other Fibonacci squares are 0 and 1 (Cohn, 1964).
• Every 3rd Fibonacci is even: \(F_3 = 2, F_6 = 8, F_9 = 34, F_{12} = 144, \ldots\) The parity pattern is strictly periodic: odd, odd, even, odd, odd, even, …
• Fibonacci and \(\gcd\): \(\gcd(F_m, F_n) = F_{\gcd(m,n)}\). This is Catalan's identity and it connects the sequence to number theory.
• Consecutive Fibonaccis are coprime: \(\gcd(F_n, F_{n+1}) = 1\) for all \(n\).
• Fibonacci in nature: The numbers of petals on many flowers (lily 3, buttercup 5, delphinium 8, daisy 21/34/55/89), the spirals of pinecones, sunflower seed heads, and nautilus shells all exhibit Fibonacci numbers.
• Honeybee ancestry: A male drone bee has 1 parent, 2 grandparents, 3 great-grandparents, 5, 8, 13, … Fibonacci.
• Only 4 Fibonacci triangular numbers: 1, 3, 21, 55 (Luo, 1989).

First 25 Fibonacci Numbers

Frequently Asked Questions

Is 0 a Fibonacci number?

Yes. By the standard convention used here, \(F_0 = 0\). Some textbooks start the sequence at \(F_1 = 1, F_2 = 1\), omitting zero, but the OEIS and most modern references include 0 as the zeroth Fibonacci number.

Is 1 a Fibonacci number?

Yes. In fact 1 appears twice: \(F_1 = F_2 = 1\). The tool reports the lower index (1) by convention.

Is 100 a Fibonacci number?

No. \(5 \times 100^2 + 4 = 50{,}004\) and \(5 \times 100^2 - 4 = 49{,}996\); neither is a perfect square, so 100 fails Gessel's test. 100 lies between \(F_{11} = 89\) and \(F_{12} = 144\).

Is 144 a Fibonacci number?

Yes — and famously so. 144 = \(F_{12}\), and it's the only Fibonacci number greater than 1 that is also a perfect square (\(144 = 12^2\)). Gessel's test: \(5 \times 144^2 + 4 = 103{,}684 = 322^2\). ✓

What's the largest Fibonacci number ever calculated?

Fibonacci numbers with over a million digits have been computed. The index of the largest known prime Fibonacci number changes over time; as of 2026, it's \(F_{201107}\) with more than 42,000 digits, found through ongoing collaborative prime search.

Can I enter huge numbers?

Yes, up to \(10^{30}\). The tool relies on Python's big-integer arithmetic and integer square root (isqrt), which stays exact and fast even for inputs with dozens of digits.

Additional Resources

• Fibonacci Number - Wikipedia
• Zeckendorf's Theorem - Wikipedia
• Golden Ratio - Wikipedia
• Binet's Formula - Wikipedia
• OEIS A000045: Fibonacci numbers

Related MiniWebtools:

Basic Math Operations:

• Common Factor Calculator
• Cube and Cube Root Calculator
• Cube Root Calculator
• Divide Into Two Parts
• Divisibility Test Calculator
• Factor Calculator
• Find Minimum and Maximum
• First n Digits of e
• First n Digits of Pi Featured
• Greatest Common Factor Calculator
• Is it a Prime Number?
• Least Common Multiple Calculator
• Modulo Calculator Featured
• Multiplication Calculator
• n-th Root Calculator
• Number of Digits Calculator Featured
• Prime Factor Calculator
• Prime Factorization Calculator
• Quotient and Remainder Calculator Featured
• Sort Numbers Featured
• Square Root (√) Calculator Featured
• Sum Calculator Featured
• Ratio Calculator New
• Long Division Calculator New
• Cross Multiplication Calculator New
• Multiplication Table Generator New
• Long Multiplication Calculator New
• Long Addition and Subtraction Calculator New
• Order of Operations Calculator (PEMDAS) New
• Place Value Chart Generator New
• Number Pattern Finder New
• Even or Odd Number Checker New
• Absolute Value Calculator New
• Ceiling and Floor Function Calculator New
• Unit Rate Calculator New
• Skip Counting Generator New
• Estimation Calculator New
• Perfect Number Checker New
• Amicable Number Checker New
• Mersenne Prime Checker New
• Goldbach Conjecture Verifier New
• Möbius Function Calculator New
• Fibonacci Number Checker New
• Digital Root Calculator New
• Random Math Problem Generator New