fib1:= proc(min,max) > local i; > for i from min to max do > if i = 0 then 1; > elif i = 1 then x; > else > x*(fib1(i-1))+fib1(i-2); > fi; > od; > end;

fib1:= proc(min,max) > local i; > for i from min to max do > if i = 0 then 1; > elif i = 1 then x; > else > x*(fib1(i-1))+fib1(i-2); > fi; > od; > end;

Thank you

Thank you

I'm so sorry!I'm not in US,i'm from spain and in here it's 13 o'clock...and I'm new at the forum i didn't know exactly what I was doing...sorry for bothering you..and thanks for the help...can you help me with my second question please? Ps: it's not that urgente,it's for a project that i have to send only on january,but i have many things to do till then, so I'm trying to finish it most quickly as possible. Sorry again.

thank you! but I didn't explained me correctly I have to do a algorithm where are given 2 values I have to find the polinomies between this two values... and i don't know how to do that...do you have any idea?

thank you! but I didn't explained me correctly I have to do a algorithm where are given 2 values I have to find the polinomies between this two values... and i don't know how to do that...do you have any idea?

How can I write a recursive algorithm on maple wich gives me the fibonacci polinomies knowing that: F1(x) = 1 F2(x) = x Fn+1(x) = xFn(x) + Fn−1(x), n = 2, 3, ... i think it's easy but still can't do it...if anyone knows help me please