Math::NumSeq::SophieGermainPrimes -- Sophie Germain primes p and 2*p+1 prime
use Math::NumSeq::SophieGermainPrimes; my $seq = Math::NumSeq::SophieGermainPrimes->new; my ($i, $value) = $seq->next;
The primes 2, 3, 5, 11, 23, etc, where both P and 2*P+1 are prime.
See "FUNCTIONS" in Math::NumSeq for the behaviour common to all path classes.
$seq = Math::NumSeq::SophieGermainPrimes->new ()
$bool = $seq->pred($value)
Return true if
$valueis a Sophie Germain prime, meaning both
Copyright 2010, 2011 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/>.