In 1850, Kummer proved that Fermat's Last Theorem is true for a prime exponent if is regular. This focused attention on the irregular primes.[1] In 1852, Genocchi was able to prove that the first case of Fermat's Last Theorem is true for an exponent , if is not an irregular pair. Kummer improved this further in 1857 by showing that for the "first case" of Fermat's Last Theorem (see Sophie Germain's theorem) it is sufficient to establish that either or fails to be an irregular pair. (As applied in these results, is an irregular pair when is irregular due to a certain condition, described below, being realized at .)
Kummer found the irregular primes less than 165. In 1963, Lehmer reported results up to 10000 and Selfridge and Pollack announced in 1964 to have completed the table of irregular primes up to 25000. Although the two latter tables did not appear in print, Johnson found that is in fact an irregular pair for and that this is the first and only time this occurs for .[2] It was found in 1993 that the next time this happens is for ; see Wolstenholme prime.[3]
Definition
Class number criterion
An odd prime number is defined to be regular if it does not divide the class number of the th cyclotomic field, where is a primitive th root of unity.
The prime number 2 is often considered regular as well.
The class number of the cyclotomic
field is the number of ideals of the ring of integers up to equivalence. Two ideals and are considered equivalent if there is a nonzero in so that . The first few of these class numbers are listed in (sequence A000927 in the OEIS).
Kummer's proof that this is equivalent to the class number definition is strengthened by the Herbrand–Ribet theorem, which states certain consequences of dividing the numerator of one of these Bernoulli numbers.
Taking Kummer's criterion, the chance that one numerator of the Bernoulli numbers , , is not divisible by the prime is
so that the chance that none of the numerators of these Bernoulli numbers are divisible by the prime is
By the definition of ,
giving the probability
It follows that about of the primes are regular by chance. Hart et al.[4] indicate that of the primes less than are regular.
Irregular primes
An odd prime that is not regular is an irregular prime (or Bernoulli irregular or B-irregular to distinguish from other types of irregularity discussed below). The first few irregular primes are:
K. L. Jensen (a student of Niels Nielsen[5]) proved in 1915 that there are infinitely many irregular primes of the form .[6]
In 1954 Carlitz gave a simple proof of the weaker result that there are in general infinitely many irregular primes.[7]
Metsänkylä proved in 1971 that for any integer , there are infinitely many irregular primes not of the form ,[8] and later generalized this.[9]
Irregular pairs
If is an irregular prime and divides the numerator of the Bernoulli number for , then is called an irregular pair. In other words, an irregular pair is a bookkeeping device to record, for an irregular prime , the particular indices of the Bernoulli numbers at which regularity fails. The first few irregular pairs (when ordered by ) are:
For a given prime , the number of such pairs is called the index of irregularity of .[10] Hence, a prime is regular if and only if its index of irregularity is zero. Similarly, a prime is irregular if and only if its index of irregularity is positive.
It was discovered that is in fact an irregular pair for , as well as for .. There are no more occurrences for .
Irregular index
An odd prime has irregular indexif and only if there are values of for which divides and these s are less than . The first irregular prime with irregular index greater than 1 is 157, which divides and , so it has an irregular index 2. Clearly, the irregular index of a regular prime is 0.
The irregular index of the th prime starting with , or the prime 3 is
2, 3, 37, 157, 491, 12613, 78233, 527377, 3238481, ... (sequence A061576 in the OEIS).
(This sequence defines "the irregular index of 2" as −1, and also starts at .)
Generalizations
Euler irregular primes
Similarly, we can define an Euler irregular prime (or E-irregular) as a prime that divides at least one Euler number with . The first few Euler irregular primes are
Vandiver proved in 1940 that Fermat's Last Theorem (that has no solution for integers , , with ) is true for prime exponents that are Euler-regular. Gut proved that has no solution if has an E-irregularity index less than 5.[11]
Granville, A.; Monagan, M. B. (1988), "The First Case of Fermat's Last Theorem is True for All Prime Exponents up to 714,591,416,091,389", Transactions of the American Mathematical Society, 306 (1): 329–359, doi:10.1090/S0002-9947-1988-0927694-5, MR0927694
Gardiner, A. (1988), "Four Problems on Prime Power Divisibility", American Mathematical Monthly, 95 (10): 926–931, doi:10.2307/2322386, JSTOR2322386