## VERSION

$Revision: 1.5 $

## FUNCTIONS

**term($n)**-
Returns the
`$n`-th term of the Fibonacci sequence. The term is computed using the fast algorithm:`"``F(n) ~ g^n/sqrt(5)"`, where g is the golden ratio and ~ means ``take the nearest integer''. **series($n)**-
Computes and returns the first
`$n`Fibonacci numbers. **decompose($int)**-
Decomposes
`$int`into the sum of Fibonacci numbers. Returns the list of Fibonacci numbers. **isfibonacci($int)**-
Returns the sequence number of
`$int`if it is a Fibonacci number or a non-true value if it is not.

## LICENSE

Copyright (c) 1999-2001, Vipul Ved Prakash.This code is free software; you can redistribute it and/or modify it under the ARTISTIC license (a copy is included in the distribution) or under the same terms as Perl itself.