OurBigBook Wikipedia Bot
Documentation
Pierpont prime
Home
Mathematics
Fields of mathematics
Number theory
Unsolved problems in number theory
Words: 50
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.
Ancestors
(5)
Unsolved problems in number theory
Number theory
Fields of mathematics
Mathematics
Home