In a book I found the following:
Consider a recurrence relation of the form $$ ax_{n+1}+bx_n+cx_{n-1}=0 $$ where $a$ and $c$ are both non-zero. Let us try a solution of the form $x_n=\lambda^n$; then $a\lambda^2+b\lambda+c=0$. Denote by $\alpha$ and $\beta$ the roots of this quadratic [...]
Sorry, but I do not understand what the author means with "let $\alpha$ and $\beta$ denote the roots of this quadratic".
What are $\alpha$ and $\beta$? What does he mean?
A quadratic equation in general has two roots (they may not be real numbers, and in the exceptional case there can be a double root).
Since there are two roots and we want to use them, we give them names, calling one root $\alpha$ and the other root $\beta$.
What we know about $\alpha$ and $\beta$ is that $$a\alpha^2+b\alpha+c=0\text{ and }a\beta^2+b\beta+c=0$$
Now we can multiply the first of these equations by $A\alpha^{n-1}$ and the second by $B\beta^{n-1}$ and add them to obtain$$a(A\alpha^{n+1}+B\beta^{n+1})+b(A\alpha^n+B\beta^n)+c(A\alpha^{n-1}+B\beta^{n-1})=0$$
And if we then set $x_n=A\alpha^n+B\beta^n$ we see that $$ax_{n+1}+bx_n+cx_{n-1}=0$$
So this choice of $x_n$ provides a solution to the recurrence.