Linear Recurrence Relations I'm having trouble understanding the process of solving simple linear recurrence relation problems. The problem in the book is this:
$$
0=a_{n+1}-1.5a_n,\ n \ge 0
$$
What is the general process, and purpose, of solving this? Unfortunately there is a very large language barrier between my professor and myself, which is quite a problem.

The general solution to the equation
$$a_{n+1} = k a_n$$
is
$$a_n = B \cdot k^n$$
for some constant $B$, which is related to an initial condition.
