On 10/27/11, Aleksas Domarkas <aleksasd873 at gmail.com> wrote:
> (%i6) solve_rec(d(n)=n*d(n-1)-d(n-2),d(n),d(1)=1,d(2)=1);
> (%o6) false
Unfortunately I really don't know about recurrence equations
so I can't be very helpful here. Actually I have some questions
of my own.
What is the general realm of solvable recurrences?
Can we tell by inspecting the equation that it is solvable or not?
I am guessing that the solve_rec function reduces the recurrence
to some related equation and then tries to solve that.
Does anyone know what is the form of that equation?
If so, we could figure out that solvability from that.
Thanks for any info --
Robert Dodier