[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Axiom-math] solving recurrence relations
|
From: |
Andrea Bedini |
|
Subject: |
Re: [Axiom-math] solving recurrence relations |
|
Date: |
Thu, 7 Oct 2004 00:07:30 +0200 |
|
User-agent: |
Mutt/1.5.6+20040818i |
On Wed, Oct 06, 2004 at 01:50:42PM +0000, Martin Rubey wrote:
> does anybody know how to solve recurrence relations in Axiom. In Maple I can
> say, for example
>
> rsolve(a(n)+n*a(n-1)=0,a(n));
>
> to obtain
> n
> (-1) GAMMA(n + 1) a(0)
just declare it and use it. i think you have to supply the initial
value a(0) :
(1) -> a(0) == 1
Type: Void
(2) -> a(n) == - n * a(n-1)
Type: Void
(3) -> a(5)
Compiling function a with type Integer -> Integer
Compiling function a as a recurrence relation.
(3) - 120
Type: Integer
(4) ->
--
Andrea Bedini <address@hidden>
signature.asc
Description: Digital signature