Subject: stack overflow with recursive definitions (crash)
From: van.Nek at gmx
Date: Sat, 26 Nov 2005 20:02:42 +0100
Am 26 Nov 2005 um 10:50 hat Stavros Macrakis geschrieben:
Fibonacci sequence
>
> f[0]:1 $ f[1]:1 $
> f[i]:=f[i-1]+f[i-2] $
>
Hello Stavros,
are there any possibilities to define something like that in two dimensions?
Example: binomial coefficients.
bc[n,n]: 1$
bc[n,0]: 1$
bc[n,k]:= bc[n-1,k]+bc[n-1,k-1]$
Such an experiment does not work.
Any ideas?
Volker