How to Use
Enter n:
- n: Index
- F(n): Fibonacci number
- Sequence: First n+1 terms
Identities
- Cassini: F(n−1)F(n+1)−F(n)² = (−1)ⁿ
- Sum: ΣF(k) = F(n+2)−1
- gcd(F(m),F(n)) = F(gcd(m,n))
Applications
- Nature: phyllotaxis, spirals
- Art: golden ratio proportions
- CS: Fibonacci heaps, search
- Finance: Fibonacci retracements
Step-by-Step Instructions
- 1Enter n.
- 2Get F(n).
- 3View sequence.
- 4Check Binet.
- 5Verify identities.