(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

The Fibonacci numbers are defined recusively by:

F(0) = 0, F(1) = 1, for n > 1, F(n) = F(n − 1) + F(n − 2).

Use strong induction to show that F(n) < 2^n for all n.

2. Relevant equations

n/a

3. The attempt at a solution

I use my base case as F(2) = F(1) + F(0) = 1 which is less than 2^n = 2^2 = 4. After that I am not sure where to go with strong induction...

**Physics Forums - The Fusion of Science and Community**

# Fibonacci Number Proof

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Fibonacci Number Proof

Loading...

**Physics Forums - The Fusion of Science and Community**