Originally Posted by

**natarajchakraborty** Perhaps my question was not exact..

here is a problem.

Solve the recurrence

$\displaystyle Q_0 = \alpha;$

$\displaystyle Q_1 = \beta;$

$\displaystyle Q_n = (1 + Q_ {n-1}\ )/Q_ {n-2} $, for $\displaystyle n \geq 1.$

Assume that $\displaystyle Q_n \ != 0$ for all $\displaystyle n \geq 0$.

How do you do this, specifically I need to do this usuing 'repertoire method', that is assuming

$\displaystyle Q_n = A(n)\alpha + B(n)\beta + C(n) \gamma$

Although what equation I wrote above may not be right, since I don't understand such assumption, amd thus I need help....

Please...