NAME

Math::NumSeq::Totient -- Euler's totient function, count of coprimes

SYNOPSIS

 use Math::NumSeq::Totient;
 my $seq = Math::NumSeq::Totient->new;
 my ($i, $value) = $seq->next;

DESCRIPTION

Euler's totient function, being the count of integers coprime to i, starting i=1,

    1, 1, 2, 2, 4, 2, 6, 4, etc

For example i=6 has no common factor with 1 or 5, so the totient is 2.

FUNCTIONS

See "FUNCTIONS" in Math::NumSeq for the behaviour common to all path classes.

$seq = Math::NumSeq::Totient->new ()

Create and return a new sequence object.

$value = $seq->ith($i)

Return totient(i).

SEE ALSO

Math::NumSeq, Math::NumSeq::TotientCumulative, Math::NumSeq::TotientPerfect, Math::NumSeq::TotientSteps

HOME PAGE

http://user42.tuxfamily.org/math-numseq/index.html

LICENSE

Copyright 2011, 2012 Kevin Ryde

Math-NumSeq is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version.

Math-NumSeq is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with Math-NumSeq. If not, see <http://www.gnu.org/licenses/>.