Given a sequence $$x_0=5$$ $$x_{n+1}=x_n*1.03+1$$ how does one find generalized formulae for:
- $x_n$
- $\sum_{n=a}^{b}x_n$ for a given pair of $a, b$ where $a{\leq}b$ and $a>0$
Interested in both the closed formulae and (a wonderful cherry on top!) a description on the methodology of solving these kinds of problems.
I can obviously do this recursively, but it feels like this is a common enough problem that has been solved many times over. I'm just unable to find the solution by googling (most likely due to lack of math education - what terms should I be looking for besides the "sequence" and "solve"?)
Your first problem may be solved by induction on $n \in \mathbb{N}$. The general formula is: $x_{n} = 5*(1.03)^{n} + \sum_{j=1}^{n}{(1.03)^{j-1}}$. Then you have to verify that: $(i)$ The formula holds for $n = 1$. $(ii)$ If the formula holds for $n \in \mathbb{N}$ then it holds for $n+1$. Which is not hard to verify. Your second problem is a sum of a geometric progression. Can you conclude from here?