I am not able to solve this problem in order to find a explicit form for the recurrence relation (note: in the original text I can read "a with n" and "a with n-1", but I am not able to format here)
a(0) = 2
3 a(n) = a(n-1) + 6
I have to find the general expression of a(n)
Please note that this problem has been recognized as suitable to a student of the third year of secondary school, so you can't use Laplace Transforms or Differential Equations.
As a reference, the general solution is:
a(n) = (3^(n+1) -1) / (3^n)
Thank you for considering my question.
We can simplify the recursion by adding something to $a$ to eliminate that extra $+6$ term. Since I never just remember what the right thing to do is, we can solve for it.
We define $b(n) = a(n) + k$. Then $a(n) = b(n) - k$ and the recursion is
$$3 (b(n) - k) = (b(n-1)-k) + 6$$ $$ 3b(n) = b(n-1) + (6+2k) $$
So if we pick $k=-3$, then we would have the recursion
$$ 3b(n) = b(n-1) $$
which is pretty easy to solve.
For a more complicated recursion with a multiplier like that, there is a similar trick to eliminate the multiplier. To demonstrate with this example... again, I don't always remember the right thing so I solve for it:
If we set $c(n) = r^n b(n)$, so that $b(n) = r^{-n} c(n)$, then
$$ 3 r^{-n} c(n) = r^{-(n-1)} c(n-1) $$ $$ c(n) = \frac{r}{3} c(n-1) $$
so if we set $r=3$, we would get the recursion
$$ c(n) = c(n-1) $$
which is trivial to solve.