This Fibonacci calculator finds the nth Fibonacci number exactly — arbitrary precision, no floating-point drift — and prints the sequence up to it, with the golden-ratio connection shown.

–

Consecutive ratios Fₙ₊₁/Fₙ converge to φ ≈ 1.61803 — Binet’s formula (φⁿ − ψⁿ)/√5 gives the same integers through irrationals, a small miracle this tool instead honors by exact addition (fast doubling with BigInt).

Fₙ = Fₙ₋₁ + Fₙ₋₂ — Two Seeds, Infinite Growth

The most famous recurrence in mathematics: 0, 1, 1, 2, 3, 5, 8, 13… General recurrence/series territory is our Sequence Calculator. Part of our Math Calculators collection.

Worked Values (Verified)

  • F(20) = 6,765 (default) — the sequence reaching five digits' neighborhood; F(10) = 55, F(15) = 610 milestones on the way
  • F(50) = 12,586,269,025 — exact here, while double-precision floats start lying in the last digits past F(78) (2⁵³ territory); exactness is why this tool uses BigInt
  • Ratio convergence: F(21)/F(20) = 10,946/6,765 = 1.618034… — φ to six figures by the 20th term
  • Indexing honesty: conventions differ (some texts start F₁ = 1, F₂ = 1) — this page uses F₀ = 0, F₁ = 1, the modern standard; shift by one if your source differs

Where Fibonacci Actually Appears

  • Phyllotaxis: sunflower spirals and pinecone scales count in consecutive Fibonacci numbers — optimal packing angles (137.5°, the golden angle), not mysticism.
  • Algorithm analysis: naive recursive Fibonacci is the textbook exponential blowup; fast doubling (used here) computes Fₙ in O(log n) big multiplications.
  • Zeckendorf representation: every positive integer is a unique sum of non-consecutive Fibonacci numbers.
  • Art/design folklore vastly exceeds the evidence; the honest appearances (botany, math, CS) need no embellishment.

Related Tools

Frequently Asked Questions

What is the nth Fibonacci number?

Defined by F₀ = 0, F₁ = 1, Fₙ = Fₙ₋₁ + Fₙ₋₂: F(10) = 55, F(20) = 6,765, F(50) = 12,586,269,025. This calculator computes exact values to n = 1,000 via BigInt fast doubling — no floating-point rounding in the digits.

What is Binet's formula?

Fₙ = (φⁿ − ψⁿ)/√5 with φ = (1+√5)/2 ≈ 1.618 and ψ = (1−√5)/2. It produces integers from irrational parts that cancel — elegant for closed-form reasoning, numerically treacherous for large n, which is why exact integer methods (like this tool's) win in practice.

How does Fibonacci connect to the golden ratio?

Ratios of consecutive terms converge to φ: 8/5 = 1.6, 13/8 = 1.625, 10,946/6,765 ≈ 1.618034. The sequence is the ratio's best rational approximations unfolding — the same reason the golden angle optimizes seed packing in sunflowers.

Why do floats give wrong Fibonacci numbers?

IEEE doubles hold integers exactly only up to 2⁵³ ≈ 9.007 × 10¹⁵; F(79) exceeds that, so double-based calculators print approximations dressed as integers. BigInt arithmetic (arbitrary precision) keeps every digit honest at any n — at F(1000) that's 209 exact digits.

Are Fibonacci numbers used in trading?

"Fibonacci retracement" levels (23.6%, 38.2%, 61.8%…) derive from φ ratios and are ubiquitous on trading platforms. Their predictive power is contested — treat as market folklore with devoted followers; the mathematical sequence itself, meanwhile, is beyond dispute.

Is this Fibonacci calculator free?

Yes — free, instant, no sign-up.