On Monday 20 January 2003 10:15, wang yin wrote:
> 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;
Right now, I've no idea how to get with maxima. The simple answer does not
mean the simple way to get it. To symbolic solution of the recurence
equations need either some kind of the induction method or some tricks, e.g.,
symbolically to sum expression like 2*(2*(*.....2*T(1)+1)+1)+1) However, in
any case, the numerical value of T(n) have to be known.
>
> 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.
You shoud use the cvs. Please, find instructions on Maxima.sf.net. Keep in
mind the book is not finished, though a lot of the usefull info there. I
guess there is some book in English where the commercial Macsyma was
described.
I'm not sure about it.
rgds,V
>
> 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