So I had asked a question prior to this one about recurrence relations, but apparently it was a bad one to ask. So I'm trying again to understand how to solve these babies… Here it is:
$$
3a_{n+1}-4a_n=0, n>=0, a_1=5
$$
What is the general process for solving a relation like this?
Best Answer
When you only have two terms, it just becomes a power law like the last one. In this case you get $a_n=\left(\frac34\right)^na_0$
Probably you are looking for relations with three terms, like the Fibonacci one: $F_{n+1}=F_n+F_{n-1}$ You might look at Wikipedia