- #1
andrew1
- 20
- 0
Hi,
I'm currently having trouble with using strong induction to prove a recursive sequence and don't know where to begin, any help would be great thanks.
Define a recursive sequence f(0), f(1), f(2),... by
f(0) = 0
f(1) = 1
f(n+1) = 3f(n) + 10f(n-1), for all integers n>=1
Prove by strong induction that f(n) < 5^n for all integers n>=0
I'm currently having trouble with using strong induction to prove a recursive sequence and don't know where to begin, any help would be great thanks.
Define a recursive sequence f(0), f(1), f(2),... by
f(0) = 0
f(1) = 1
f(n+1) = 3f(n) + 10f(n-1), for all integers n>=1
Prove by strong induction that f(n) < 5^n for all integers n>=0