Questions LLC
Login
or
Sign Up
Ask a New Question
Fibonacci sequence properties
Questions (1)
The Fibonacci sequence, (fn) n∈N, is defined recursively as follows:
f0 = f1 = 1, fn = fn-2 + fn-1 (n ≥ 2) Demonstrate for
1 answer
asked by
Michelle
568 views
Parent Categories (1)
Number Theory
