Mc Laughlin, James on Wed, 24 Mar 2004 17:23:00 +0100 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
RE: Solving recurrences. |
Try the page http://www.cis.upenn.edu/~wilf/AeqB.html Some of the packages (not translated into pari/gp as far as I know - just maple and mathematica) find solutions to these types of recurrences, if they exist. Jimmy. -----Original Message----- From: Marko Riedel [mailto:mriedel@neuearbeit.de] Sent: Wednesday, March 24, 2004 9:40 AM To: pari-users@list.cr.yp.to Cc: mriedel@neuearbeit.de Subject: Solving recurrences. Hi there, I read somewhere that there is a PARI package that can solve recurrences of the type P_2(n) a(n+2) + P_1(n) a(n+1) + P_0(n) a(n) = 0 where the P_i are polynomials in n or alternatively a(n+2) + Q_1(n) a(n+1) + Q_0(n) a(n) = 0 where the Q_i are rational functions in n. Where do I find this package? Can you recommend internet resources where I might find an algorithm to tackle this kind of recurrence? Best regards, -- +------------------------------------------------------------+ | Marko Riedel, EDV Neue Arbeit gGmbH, mriedel@neuearbeit.de | | http://www.geocities.com/markoriedelde/index.html | +------------------------------------------------------------+