.\" Automatically generated by Pod::Man 4.07 (Pod::Simple 3.32)
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
.\" nothing in troff, for use with C<>.
.tr \(*W-
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
.    ds C`
.    ds C'
'br\}
.\"
.\" Escape single quotes in literal strings from groff's Unicode transform.
.ie \n(.g .ds Aq \(aq
.el       .ds Aq '
.\"
.\" If the F register is >0, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.\"
.\" Avoid warning from groff about undefined register 'F'.
.de IX
..
.if !\nF .nr F 0
.if \nF>0 \{\
.    de IX
.    tm Index:\\$1\t\\n%\t"\\$2"
..
.    if !\nF==2 \{\
.        nr % 0
.        nr F 2
.    \}
.\}
.\" ========================================================================
.\"
.IX Title "Math::Fibonacci 3pm"
.TH Math::Fibonacci 3pm "2016-10-21" "perl v5.24.1" "User Contributed Perl Documentation"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.if n .ad l
.nh
.SH "NAME"
Math::Fibonacci \- Fibonacci numbers.
.SH "VERSION"
.IX Header "VERSION"
.Vb 1
\&    $Revision: 1.5 $
.Ve
.SH "SYNOPSIS"
.IX Header "SYNOPSIS"
.Vb 1
\&    use Math::Fibonacci qw(term series decompose);
\&
\&    my $term = term ( 42 );
\&    my @series = series ( 42 );
\&    my @sum = decompose ( 65535 );
.Ve
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
This module provides a few functions related to Fibonacci numbers.
.SH "EXPORTS ON REQUEST"
.IX Header "EXPORTS ON REQUEST"
\&\fIterm()\fR, \fIseries()\fR \fIdecompose()\fR, \fIisfibonacci()\fR
.SH "FUNCTIONS"
.IX Header "FUNCTIONS"
.IP "\fBterm($n)\fR" 4
.IX Item "term($n)"
Returns the \f(CW$n\fR\-th term of the Fibonacci sequence. The term is computed
using the fast algorithm: \f(CW\*(C`F(n) ~ g^n/sqrt(5)\*(C'\fR, where g is the golden
ratio and ~ means \*(L"take the nearest integer\*(R".
.IP "\fBseries($n)\fR" 4
.IX Item "series($n)"
Computes and returns the first \f(CW$n\fR Fibonacci numbers.
.IP "\fBdecompose($int)\fR" 4
.IX Item "decompose($int)"
Decomposes \f(CW$int\fR into the sum of Fibonacci numbers. Returns the list of
Fibonacci numbers.
.IP "\fBisfibonacci($int)\fR" 4
.IX Item "isfibonacci($int)"
Returns the sequence number of \f(CW$int\fR if it is a Fibonacci number or a
non-true value if it is not.
.SH "AUTHOR"
.IX Header "AUTHOR"
Vipul Ved Prakash, <mail@vipul.net>
.SH "LICENSE"
.IX Header "LICENSE"
Copyright (c) 1999\-2001, Vipul Ved Prakash.
.PP
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.