I think it's easier to think about it as if you are just multiplying the original equations by some power of alpha or beta i.e.
alpha^(n-2)(alpha^2 - 6alpha - 2) = 0 = alpha^n - 6 alpha^(n-1) - 2 alpha^(n-2)
Hard to see without latex typing...
> Hard to see without latex typing...
MathJax to the rescue:
\[\alpha^{n-2}(\alpha^2-6\alpha-2)=0=\alpha^{n}-6\alpha^{n-1}-2\alpha^{n-2}\]
To render with MathJax, use the bookmarklet available here: http://checkmyworking.com/misc/mathjax-bookmarklet/
Then c[n] satisfies the recursion c[n] = a c[n-1] + b c[n-2].
For instance, if a = b = 1, then that sequence is the Fibonacci sequence, and the quadratic is x^2 - x - 1. r is then the golden ratio, s is -1/r, and (r^n - s^n)/(r-s) is the famous Binet formula for the n'th Fibonacci number.
This applies directly to the ITT problem, giving the recurrence a_{n} = 6 a_{n-1} + 2 a_{n-2} for the a_{n} sequence from the problem, which in turn readily yields the answer.