Math::Fibonacci (3pm)

    $Revision: 1.5 $

use Math::Fibonacci qw(term series decompose);

my $term = term ( 42 ); my @series = series ( 42 ); my @sum = decompose ( 65535 );

This module provides a few functions related to Fibonacci numbers.

term(), series() decompose(), isfibonacci()

term($n)

Returns the $n-th term of the Fibonacci sequence. The term is computed using the fast algorithm: \*(C`F(n) ~ g^n/sqrt(5)\*(C', where g is the golden ratio and ~ means \*(L"take the nearest integer\*(R".

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.

Vipul Ved Prakash, <[email protected]>

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