Hi,
I'm trying to calculate the following recursions which involves two variables.
I'm using FriCAS 1.1.8:
(1) -> W(0,1)==1
Type: Void
(2) -> W(1,0)==1
Type: Void
(3) -> W(n,m)==W(n,m-1)+W(n-1,m)
Type: Void
(4) -> W(2,3)
Compiling function W with type (Integer,Integer) -> PositiveInteger
Fatal error in "AXIOMsys" : Stack overflow on value stack.
I remember (but not very clearly) I've succeeded in doing this by using an
old version of FriCAS a couple of months ago.
Could you help me on this?
Thanks!
Best,
XJ
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/fricas-devel?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
