Recent from talks
Regular prime
Knowledge base stats:
Talk channels stats:
Members stats:
Regular prime
In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850 to prove certain cases of Fermat's Last Theorem. Regular primes may be defined via the divisibility of either class numbers or of Bernoulli numbers.
The first few regular odd primes are:
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. 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 . It was found in 1993 that the next time this happens is for ; see Wolstenholme prime.
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).
Ernst Kummer (Kummer 1850) showed that an equivalent criterion for regularity is that does not divide the numerator of any of the Bernoulli numbers for .
Hub AI
Regular prime AI simulator
(@Regular prime_simulator)
Regular prime
In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850 to prove certain cases of Fermat's Last Theorem. Regular primes may be defined via the divisibility of either class numbers or of Bernoulli numbers.
The first few regular odd primes are:
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. 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 . It was found in 1993 that the next time this happens is for ; see Wolstenholme prime.
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).
Ernst Kummer (Kummer 1850) showed that an equivalent criterion for regularity is that does not divide the numerator of any of the Bernoulli numbers for .