Recursive programs in XCAS.

[Han]

Can you provide a bit more information on what you have tried? Perhaps a snippet of code might provide a better idea of what you are trying to achieve. Or even a better description of what you wan to do beyond a generic description of "recursive program."

Fibonnaci example

Code:


fibon(n):=
begin
  if (n == 1) then return(1); end;
  if (n == 2) then return(1); end;
  if (n > 2) then
    return( fibon(n-1) + fibon(n-2) );  
  end;
end;

In general, any CAS code on the HP Prime should port as easily as copy/paste -- WITH EXCEPTIONS FOR A FEW COMMANDS (e.g. idenmat() on xcas is identity() )