Using the second principle of finite induction to prove $a^n -1 = (a-1)(a^{n-1} + a^{n-2} + ... + a + 1)$ for all $n \geq 1$ The hint for this problem is $a^{n+1} - 1 = (a + 1)(a^n - 1) - a(a^{n-1} - 1)$
I see that the problem is true because if you distribute the $a$ and the $-1$ the terms cancel out to equal the left side.  However, since it is telling me to use strong induction I am guessing there is more I am supposed to be doing.  On the hint I can see that it is a true statement, but I am not sure how to use that to prove the equation or how the right side of the hint relates to the right side of the problem.  Also, I do realize that in the case of the hint $n = 1$ would be the special case. 

HINT $\ \ $ Show that $\rm\ (a^{n+1}-1)/(a-1)\ $ and $\rm\ a^n+a^{n-1}+\:\cdots\:+1\ $ are both solutions of the recurrence $\rm\ f(n+2)\ = (a+1)\ f(n+1) - a\ f(n)\ $ with identical initial conditions $\rm\ f(1),\ f(0)\:.\ \ \ $
Now use strong induction to prove the uniqueness theorem for solutions of such difference equations (which is very easy). This is the essence of the calculation in my other answer.
As I've emphasized in many posts here uniqueness theorems provide powerful tools for proving equalities. Luckily, here, the uniqueness theorem for difference (vs. differential) equations has an absolutely trivial proof by way of (strong) induction.
Note that the corresponding first-order case is essentially telescopy, also known as the fundamental theorem of difference calculus.
