On Wed, 2007-02-14 at 17:14 +0100, RalfGesellensetter wrote:
> But when I calculate big integers (like 2^50)
> I still get a short output.
as Robert Dodier just said you could use maxima or xmaxima
instead of wxmaxima.
> BTW: If I have a recursive definition of a sequial like
>
> a[n]:=2+a[n-1];
>
> I fail to find a way to define a[0].
(%i1) a[n]:=2+a[n-1]$
(%i2) a[0]: 3$
(%i3) a[6];
(%o3) 15
Remember: if you change the value of a[0], then a[1],..., a[6] will
not change (unless you use kill) because they are cached in memory.
a(n):=2+a(n-1) does not have that problem, but it is slower since
each time you ask for a(n); a(1)...a(n-1) are recalculated.
Regards,
Jaime Villate