The Fibonacci numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34, .
Chapter 0, Problem 34E(choose chapter or problem)
The Fibonacci numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34, . . . . In general, the Fibonacci numbers are defined by f1 = 1, f2 = 1, and for n ? 3, fn = fn–1 + fn–2. Prove that the nth Fibonacci number fn satisfies fn < 2n.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer