Let $a_0=1,$ $a_{n+1}=10a_n-3$
Find an explicit formula for $a_n$
I took this from a book called "A Walk Through Combinatorics" that I found online to practise combinatorics and induction proofs.
So, supposedly, I'm to try and guess the formula and then try to prove with it with an induction, so this is what I found:
$$a_1=10*1-3=7$$ $$a_2=10*7-3=67$$ $$a_3=10*67-3=667$$ $$....$$
So it looks like a function that adds a 6 from the left side each time but I have no idea how can I formulate it into an explicit formula...
You can express the number$$\overbrace{66\ldots66}^{n-1\text{ times}}7$$as$$7+\sum_{k=1}^{n-1}6\times10^k.$$So, your conjecture is$$(\forall n\in\mathbb{N}):a_n=7+\sum_{k=1}^{n-1}6\times10^k.$$This is clearly true if $n=1$. Now, if $n\in\mathbb N$ is such that $a_n=7+\sum_{k=1}^{n-1}6\times10^k$, then\begin{align}a_{n+1}&=10a_n-3\\&=70-3+\sum_{k=1}^{n-1}6\times10^{k+1}\\&=67+\sum_{k=2}^n6\times10^k\\&=7+60+\sum_{k=2}^n6\times10^k\\&=7+\sum_{k=1}^n6\times10^k.\end{align}