Global Information Lookup Global Information

Pierpont prime information


Pierpont prime
Named afterJames Pierpont
No. of known termsThousands
Conjectured no. of termsInfinite
Subsequence ofPierpont number
First terms2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, 1153, 1297, 1459, 2593, 2917, 3457, 3889
Largest known term81 × 220,498,148 + 1
OEIS indexA005109

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:

2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, 1153, 1297, 1459, 2593, 2917, 3457, 3889, 10369, 12289, 17497, 18433, 39367, 52489, 65537, 139969, 147457, 209953, 331777, 472393, 629857, 746497, 786433, 839809, 995329, ... (sequence A005109 in the OEIS)

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

and 21 Related for: Pierpont prime information

Request time (Page generated in 0.86 seconds.)

Pierpont prime

Last Update:

In number theory, a Pierpont prime is a prime number of the form 2 u ⋅ 3 v + 1 {\displaystyle 2^{u}\cdot 3^{v}+1\,} for some nonnegative integers u and...

Word Count : 1455

List of prime numbers

Last Update:

This is a list of articles about prime numbers. A prime number (or prime) is a natural number greater than 1 that has no positive divisors other than...

Word Count : 5782

Prime number

Last Update:

the prime factors of n {\displaystyle n} are any number of copies of 2 or 3 together with a (possibly empty) set of distinct Pierpont primes, primes of...

Word Count : 14107

2

Last Update:

regular polygons using basic tools (e.g., through the use of Fermat or Pierpont primes). 2 {\displaystyle 2} is the only number such that the sum of the reciprocals...

Word Count : 4297

Heptagon

Last Update:

approximately 0.8710 of its circumscribed circle. As 7 is a Pierpont prime but not a Fermat prime, the regular heptagon is not constructible with compass...

Word Count : 1742

Tridecagon

Last Update:

{13}{4}}a^{2}\cot {\frac {\pi }{13}}\simeq 13.1858\,a^{2}.} As 13 is a Pierpont prime but not a Fermat prime, the regular tridecagon cannot be constructed using a compass...

Word Count : 702

Hendecagon

Last Update:

is not a Fermat prime, the regular hendecagon is not constructible with compass and straightedge. Because 11 is not a Pierpont prime, construction of...

Word Count : 949

Fermat number

Last Update:

Fermat primes. Double exponential function Lucas' theorem Mersenne prime Pierpont prime Primality test Proth's theorem Pseudoprime Sierpiński number Sylvester's...

Word Count : 4579

Icositrigon

Last Update:

trisection, on account of the number 23 being neither a Fermat nor Pierpont prime. In addition, the regular icositrigon is the smallest regular polygon...

Word Count : 767

Neusis construction

Last Update:

"a not inconsiderable error". Angle trisection Constructible polygon Pierpont prime Quadratrix Steel square Tomahawk (geometry) Trisectrix Benjamin, Elliot;...

Word Count : 1343

Regular polygon

Last Update:

\mathbb {N} } , where each distinct p i {\displaystyle p_{i}} is a Pierpont prime. The symmetry group of an n-sided regular polygon is dihedral group...

Word Count : 3201

Straightedge and compass construction

Last Update:

non-negative integers and m is a product of zero or more distinct Pierpont primes (primes of the form 2r3s+1). Therefore, regular n-gon admits a solid, but...

Word Count : 4790

Mersenne prime

Last Update:

In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some...

Word Count : 6328

Megagon

Last Update:

trisector, as the number of sides is neither a product of distinct Pierpont primes, nor a product of powers of two and three. Like René Descartes's example...

Word Count : 826

Myriagon

Last Update:

trisector, as the number of sides is neither a product of distinct Pierpont primes, nor a product of powers of two and three. The regular myriagon has...

Word Count : 498

Chiliagon

Last Update:

trisector, as the number of sides is neither a product of distinct Pierpont primes, nor a product of powers of two and three. Therefore, construction...

Word Count : 1099

Constructible polygon

Last Update:

p_{k},} where r, s, k ≥ 0 and where the pi are distinct Pierpont primes greater than 3 (primes of the form 2 t 3 u + 1 ) . {\displaystyle 2^{t}3^{u}+1)...

Word Count : 2190

Wieferich prime

Last Update:

In number theory, a Wieferich prime is a prime number p such that p2 divides 2p − 1 − 1, therefore connecting these primes with Fermat's little theorem...

Word Count : 6935

9

Last Update:

{\displaystyle m} and n {\displaystyle n} with p {\displaystyle p} a product of Pierpont primes, a regular nonagon is constructed with a regular compass, straightedge...

Word Count : 4792

Primorial prime

Last Update:

mathematics, a primorial prime is a prime number of the form pn# ± 1, where pn# is the primorial of pn (i.e. the product of the first n primes). Primality tests...

Word Count : 421

Angle trisection

Last Update:

where the pi are distinct primes greater than 3 of the form 2 t 3 u + 1 {\displaystyle 2^{t}3^{u}+1} (i.e. Pierpont primes greater than 3).: Thm. 2  Bisection...

Word Count : 3070

PDF Search Engine © AllGlobal.net