Math::NumSeq::Primorials -- primorials 2*3*...*p[i]


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


The sequence of primorials, being the product of the first i many primes, 2*3*5*...*p[i].

    1, 2, 6, 30, 210, ...
    starting i=0


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

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

Create and return a new sequence object.

Random Access

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

Return 2*3*5*...*p[$i]. For $i==0 this is considered an empty product and the return is 1.

$bool = $seq->pred($value)

Return true if $value is equal to 2*3*5*...*p[i] for number of primes.

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

Return the index i of $value or of the next primorial below $value.

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

Return an estimate of the i corresponding to $value.


Math::NumSeq, Math::NumSeq::Factorials

"pn_primorial" in Math::Prime::Util



Copyright 2010, 2011, 2012, 2013, 2014, 2016, 2019, 2020 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 <>.