Pierpont prime

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 v = 0 is of the form , and is therefore a Fermat prime (unless 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 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 10n. 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.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (19)

Related courses (2)

Related lectures (12)

1000 (number)

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000. A group of one thousand things is sometimes known, from Ancient Greek, as a chiliad. A period of one thousand years may be known as a chiliad or, more often from Latin, as a millennium. The number 1000 is also sometimes described as a short thousand in medieval contexts where it is necessary to distinguish the Germanic concept of 1200 as a long thousand.

5 (five) is a number, numeral and digit. It is the natural number, and cardinal number, following 4 and preceding 6, and is a prime number. It has garnered attention throughout history in part because distal extremities in humans typically contain five digits. The evolution of the modern Western digit for the numeral 5 cannot be traced back to the Indian system, as for the digits 1 to 4. The Kushana and Gupta empires in what is now India had among themselves several forms that bear no resemblance to the modern digit.

Pierpont prime

MATH-124: Geometry for architects I

Ce cours entend exposer les fondements de la géométrie à un triple titre : 1/ de technique mathématique essentielle au processus de conception du projet, 2/ d'objet privilégié des logiciels de concept

MATH-310: Algebra

This is an introduction to modern algebra: groups, rings and fields.

Complex Numbers: Equations and Constructibility MATH-110(a): Advanced linear algebra I

Explores polynomial equations in complex numbers, constructibility conditions, roots of unity, and Fermat primes.

Square Roots and Complex Numbers MATH-110(a): Advanced linear algebra I

Explores square roots in quadratic equations, complex numbers, Fermat prime numbers, and the Gauss-Wantzel theorem.

Complex Numbers: Group Morphisms and Fermat Primes MATH-110(a): Advanced linear algebra I

Explores group morphisms in complex numbers and the concept of Fermat primes.