# Math Help - Explaination for the 'repertoire method' for solving recurrences/sums?

1. ## Explaination for the 'repertoire method' for solving recurrences/sums?

Repertoire method to solve summation, where in you express the sum as a function of some constant times some function of n, like A(n) etc... I am trying to follow 'Concrete Mathematics', by Graham and Knuth, but having some difficulties in understanding these techniques which they applied to solve Josephus problem, could anybody explain please, giving an example....

3. Perhaps my question was not exact..
here is a problem.

Solve the recurrence
$Q_0 = \alpha;$
$Q_1 = \beta;$
$Q_n = (1 + Q_ {n-1}\ )/Q_ {n-2}$, for $n \geq 1.$

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

How do you do this, specifically I need to do this usuing 'repertoire method', that is assuming
$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....

4. Originally Posted by natarajchakraborty
Perhaps my question was not exact..
here is a problem.

Solve the recurrence
$Q_0 = \alpha;$
$Q_1 = \beta;$
$Q_n = (1 + Q_ {n-1}\ )/Q_ {n-2}$, for $n \geq 1.$

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

How do you do this, specifically I need to do this usuing 'repertoire method', that is assuming
$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....