No. I don't mean I want to get a value of T(3) or T(1000), ...
I want the result: T(n)=2^n-1;
That's the answer to the recurence
T(n)=2*T(n-1)+1, T(0)=0
Please tell me how to get the MAXIMA book.
On Mon, Jan 20, 2003 at 09:17:18AM +0800, Valerij Pipin wrote:
> On Sunday 19 January 2003 00:21, wang yin wrote:
> > Hi,
> >
> > I want to use MAXIMA to solve simple recurances such as
> >
> > T(n)=2*T(n-1)+1
> >
> > What function should I use? I just can't find a better book that this
> > tiresome manual.
> In example above you might use the simple construction given in maxima book at cvs.like
> C1) T(n):=if n<1 then 1 else 2*T(n-1)+1;
> (D1) T(n) := IF n < 1 THEN 1 ELSE 2 T(n - 1) + 1
> (C2) T(3);
> (D2) 15
> For more complicated cases type example(functions)
> rgds,
> V
--
Wang Yin
DA Lab, Tsinghua University,
100084
Beijing China