Up | Next | Prev | PrevTail | Tail |

The unary operator Fibonacci provides notation and computation for Fibonacci numbers. Fibonacci(n) evaluates to the nth Fibonacci number. If n is a positive or negative integer, it will be evaluated following the definition:

F_{0} = 0;F_{1} = 1;F_{n} = F_{n-1} + F_{n-2}

Fibonacci Polynomials are computed by the binary operator FibonacciP. FibonacciP(n,x) returns the nth Fibonaccip polynomial in the variable x. If n is a positive or negative integer, it will be evaluated following the definition:

F_{0}(x) = 0;F_{1}(x) = 1;F_{n}(x) = xF_{n-1}(x) + F_{n-2}(x)

Up | Next | Prev | PrevTail | Front |