2^u•3^v+1 түріндегі жай сандар

Prime number of the form 2^u • 3^v + 1 for u, v > 0

In number theory, a Pierpont prime is a prime number of the form

for some nonnegative integers u and v. That is, they are the prime numbers p for which p − 1 is 3 smooth. They are named after the mathematician James Pierpont, who used them to characterize the regular polygons that can be constructed using conic sections. The same characterization applies to polygons that can be constructed using ruler, compass, and angle trisector, or using paper folding. Except for 2 and the Fermat primes, every Pierpont prime must be 1 modulo 6. The first few Pierpont primes are:

It has been conjectured that there are infinitely many Pierpont primes, but this remains unproven.

A Pierpont prime with 1=v = 0 is of the form , and is therefore a Fermat prime (unless 1=u = 0). If v is positive then u must also be positive (because would be an even number greater than 2 and therefore not prime), and therefore the non Fermat Pierpont primes all have the form 6k + 1, when k is a positive integer (except for 2, when 1=u = v = 0). Empirically, the Pierpont primes do not seem to be particularly rare or sparsely distributed; there are 42 Pierpont primes less than 106, 65 less than 109, 157 less than 1020, and 795 less than 10100. There are few restrictions from algebraic factorisations on the Pierpont primes, so there are no requirements like the Mersenne prime condition that the exponent must be prime. Thus, it is expected that among n digit numbers of the correct form , the fraction of these that are prime should be proportional to 1/n, a similar proportion as the proportion of prime numbers among all n digit numbers. As there are numbers of the correct form in this range, there should be Pierpont primes. Andrew M. Gleason made this reasoning explicit, conjecturing there are infinitely many Pierpont primes, and more specifically that there should be approximately 9n Pierpont primes up to 10^(n). According to Gleason's conjecture there are Pierpont primes smaller than N, as opposed to the smaller conjectural number of Mersenne primes in that range.

When , is a Proth number and thus its primality can be tested by Proth's theorem. On the other hand, when alternative primality tests for are possible based on the factorization of as a small even number multiplied by a large power of 3.

In the mathematics of paper folding, the Huzita axioms define six of the seven types of fold possible. It has been shown that these folds are sufficient to allow the construction of the points that solve any cubic equation. It follows that they allow any regular polygon of N sides to be formed, as long as N ≥ 3 and is of the form 2^(m)3^(n)ρ, where ρ is a product of distinct Pierpont primes. This is the same class of regular polygons as those that can be constructed with a compass, straightedge, and angle trisector. As Gleason later showed, these numbers are exactly the ones of the form 2^(m)3^(n)ρ given above. A generalized Pierpont prime is a prime of the form with k fixed primes p1 < p2 < p3 < < pk. A generalized Pierpont prime of the second kind is a prime of the form with k fixed primes p1 < p2 < p3 < < pk. Since all primes greater than 2 are odd, in both kinds p1 must be 2. The sequences of such primes in the OEIS are:

{p1, p2, p3, , pk} + 1 − 1{2}{2, 3}{2, 5}{2, 3, 5}{2, 7}{2, 3, 5, 7}{2, 11}{2, 13}