More sophisticated implementation of Fibonacci(n), using Lucas sequence (idea stolen from Pari/GP). Would be interesting to try to have simplification work in such a way that one could simply use the analytic formula for the nth Fibonacci number, eliminating all recursion.
More sophisticated implementation of Fibonacci(n),
using Lucas sequence (idea stolen from Pari/GP).
Would be interesting to try to have simplification
work in such a way that one could simply use the
analytic formula for the nth Fibonacci number,
eliminating all recursion.

qwert2003/yacas,MateuszSnamina/yacas,grzegorzmazur/yacas,MateuszSnamina/yacas,qwert2003/yacas,martanoga/yacas,MateuszSnamina/yacas,martanoga/yacas,grzegorzmazur/yacas,grzegorzmazur/yacas,MateuszSnamina/yacas,tomaszkrysiuk/yacas,grzegorzmazur/yacas,tomaszkrysiuk/yacas,qwert2003/yacas,qwert2003/yacas,qwert2003/yacas,martanoga/yacas,qwert2003/yacas,martanoga/yacas,martanoga/yacas,grzegorzmazur/yacas,martanoga/yacas,grzegorzmazur/yacas,tomaszkrysiuk/yacas,MateuszSnamina/yacas,tomaszkrysiuk/yacas,qwert2003/yacas,MateuszSnamina/yacas,martanoga/yacas,MateuszSnamina/yacas,grzegorzmazur/yacas,tomaszkrysiuk/yacas,tomaszkrysiuk/yacas,tomaszkrysiuk/yacas