Question

Help on an attached proof by mathematical induction:
http://dl.dropbox.com/u/6717478/5.png
Help on an attached proof by mathematical induction:
http://dl.dropbox.com/u/6717478/5.png
@Mathematics

Answer 1

I need help on part b of this question. I just don't know what I should start with to work towards the inductive conclusion. Any help would be appreciated thanks!

Answer 2

i think you can start with the fact that since
\[\frac{f_n}{f_{n-1}}=2 \text{ or } 5\] you know that
\[f_n\geq 2f_{n-1}\] that should get your induction going. that and the fact that
\[2f_n=f_n+f_n\geq f_n+\sum_{i=1}^{n-1}f_i\] by induction

Answer 3

I was thinking that if you can divide to get 2 or 5 then \[f_{n+1} \ge f_{n}\]

Answer 4

alright I've got it, thanks again for your help!

Answer 5

yw, hope that gets you going