NAME

Math::NumSeq::PrimitiveRoot -- smallest primitive root

SYNOPSIS

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

DESCRIPTION

In progress ...

This is ...

    starting i=1
    3, 3, 5, 4, 4, 3, 5, 5, 4, 3, 6, 6, 8, 8, 7, 7, 9, 8, 8, ...

FUNCTIONS

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

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

Create and return a new sequence object.

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

Return the first primitive root to modulus $i.

$i = $seq->i_start ()

Return 1, the first term in the sequence being at i=1.

SEE ALSO

Math::NumSeq, Math::NumSeq::LongFractionPrimes

HOME PAGE

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

LICENSE

Copyright 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/>.