As part of the curriculum, we have recently been working on proofs by induction. During the exercises I encountered an exercise that I do not know how to solve, I would be happy to help. Sorry beforehand that I am attaching a picture, I could not raise the question as a built-in code on the site.
problem To the best of my understanding, there is a need to prove by induction of n, on the one hand, and on the other hand to prove that there is n0 so that the argument will be correct. I'm pretty lost..
I tried to prove for N + 1 organs, but then I did not understand how to proceed to exclude the existence of the n0 requested .
Any help will be appreciated
I guess you could write: $a_{n+1}=2a_n + a_{n-1}$. Then you apply the induction hypothesis $a_n \leq 2a_{n-1} + a_{n-2}$. This gives $$a_{n+1} \leq 2[(\frac{5}{2})^n +(\frac{5}{2})^{n-1}] = \frac{5^{n} + 2\cdot 5^{n-1}}{2^{n+1}} \leq (\frac{5}{2})^{n+1}$$ Using the $n_0$ Noble Mushtak found, this should complete the proof by induction.