Math::Fibonacci(3pm)

Math::Fibonacci3pm

Fibonacci numbers.

Usage

    use Math::Fibonacci qw(term series decompose);
    my $term = term ( 42 );
    my @series = series ( 42 );
    my @sum = decompose ( 65535 );

Version

    $Revision: 1.5 $

Overview

This module provides a few functions related to Fibonacci numbers.

Exports on request

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

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.

Releases

10 releases since Debian 4.0 (Etch); the text changed 4 times.

  1. 4.0
  2. 5.0–8
  3. 9–10
  4. 11
  5. 12–13

Author

Vipul Ved Prakash, <[email protected]>

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.

From libmath-fibonacci-perl 1.5-7 in Debian 13 (Trixie). Parsed by carta from the page's man source.