++ed by:
Kevin Ryde
and 1 contributors

# NAME

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

# SYNOPSIS

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

# DESCRIPTION

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``````

# FUNCTIONS

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`.

"pn_primorial" in Math::Prime::Util