Pierpont prime (source code)

= Pierpont prime
{wiki=Pierpont_prime}

A Pierpont prime is a type of prime number that can be expressed in the form \\( P = 3 \\cdot 2^n + 1 \\) or \\( P = 2^n + 1 \\) for non-negative integers \\( n \\). The set of Pierpont primes includes numbers generated by these formulas.