Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Regular prime

From Wikipedia, the free encyclopedia
Type of prime number

Not to be confused withregular number.
Unsolved problem in mathematics
Are there infinitely many regular primes, and if so, is their relative densitye1/2{\displaystyle e^{-1/2}}?
More unsolved problems in mathematics

Innumber theory, aregular prime is a special kind ofprime number, defined byErnst Kummer in 1850 to prove certain cases ofFermat's Last Theorem. Regular primes may be defined via thedivisibility of eitherclass numbers or ofBernoulli numbers.

The first few regular odd primes are:

3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 43, 47, 53, 61, 71, 73, 79, 83, 89, 97, 107, 109, 113, 127, 137, 139, 151, 163, 167, 173, 179, 181, 191, 193, 197, 199, ... (sequenceA007703 in theOEIS).

History and motivation

[edit]

In 1850, Kummer proved thatFermat's Last Theorem is true for a prime exponentp{\displaystyle p} ifp{\displaystyle p} is regular. This focused attention on the irregular primes.[1] In 1852,Genocchi was able to prove that thefirst case of Fermat's Last Theorem is true for an exponentp{\displaystyle p}, if(p,p3){\displaystyle (p,p-3)} is not an irregular pair. Kummer improved this further in 1857 by showing that for the "first case" of Fermat's Last Theorem (seeSophie Germain's theorem) it is sufficient to establish that either(p,p3){\displaystyle (p,p-3)} or(p,p5){\displaystyle (p,p-5)} fails to be an irregular pair. (As applied in these results,(p,2k){\displaystyle (p,2k)} is an irregular pair whenp{\displaystyle p} is irregular due to a certain condition, described below, being realized at2k{\displaystyle 2k}.)

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(p,p3){\displaystyle (p,p-3)} is in fact an irregular pair forp=16843{\displaystyle p=16843} and that this is the first and only time this occurs forp<30000{\displaystyle p<30000}.[2] It was found in 1993 that the next time this happens is forp=2124679{\displaystyle p=2124679}; seeWolstenholme prime.[3]

Definition

[edit]

Class number criterion

[edit]

An odd prime numberp{\displaystyle p} is defined to be regular if it does not divide theclass number of thep{\displaystyle p}thcyclotomic fieldQ(ζp){\displaystyle \mathbb {Q} (\zeta _{p})}, whereζp{\displaystyle \zeta _{p}} is a primitivep{\displaystyle p}th root of unity.

The prime number 2 is often considered regular as well.

Theclass number of the cyclotomicfield is the number ofideals of thering of integersZ(ζp){\displaystyle \mathbb {Z} (\zeta _{p})} up to equivalence. Two idealsI{\displaystyle I} andJ{\displaystyle J} are considered equivalent if there is a nonzerou{\displaystyle u} inQ(ζp){\displaystyle \mathbb {Q} (\zeta _{p})} so thatI=uJ{\displaystyle I=uJ}. The first few of these class numbers are listed inOEISA000927.

Kummer's criterion

[edit]
Main article:Bernoulli number § The Kummer theorems

Ernst Kummer (Kummer 1850) showed that an equivalent criterion for regularity is thatp{\displaystyle p} does not divide the numerator of any of theBernoulli numbersBk{\displaystyle B_{k}} fork=2,4,6,,p3{\displaystyle k=2,4,6,\dots ,p-3}.

Kummer's proof that this is equivalent to the class number definition is strengthened by theHerbrand–Ribet theorem, which states certain consequences ofp{\displaystyle p} dividing the numerator of one of these Bernoulli numbers.

Siegel's conjecture

[edit]

It has beenconjectured that there areinfinitely many regular primes. More preciselyCarl Ludwig Siegel (1964) conjectured thate1/2{\displaystyle e^{-1/2}}, or about 60.65%, of all prime numbers are regular, in theasymptotic sense ofnatural density. Here,e2.718{\displaystyle e\approx 2.718} isthe base of the natural logarithm.

Taking Kummer's criterion, the chance that one numerator of the Bernoulli numbersBk{\displaystyle B_{k}},k=2,,p3{\displaystyle k=2,\dots ,p-3}, is not divisible by the primep{\displaystyle p} is

p1p{\displaystyle {\dfrac {p-1}{p}}}

so that the chance that none of the numerators of these Bernoulli numbers are divisible by the primep{\displaystyle p} is

(p1p)p32=(11p)p32=(11p)3/2{(11p)p}1/2.{\displaystyle \left({\dfrac {p-1}{p}}\right)^{\dfrac {p-3}{2}}=\left(1-{\dfrac {1}{p}}\right)^{\dfrac {p-3}{2}}=\left(1-{\dfrac {1}{p}}\right)^{-3/2}\cdot \left\lbrace \left(1-{\dfrac {1}{p}}\right)^{p}\right\rbrace ^{1/2}.}

By the definition ofe{\displaystyle e},limp(11p)p=1e{\displaystyle \lim _{p\to \infty }\left(1-{\dfrac {1}{p}}\right)^{p}={\dfrac {1}{e}}}giving the probabilitylimp(11p)3/2{(11p)p}1/2=e1/20.606531.{\displaystyle \lim _{p\to \infty }\left(1-{\dfrac {1}{p}}\right)^{-3/2}\cdot \left\lbrace \left(1-{\dfrac {1}{p}}\right)^{p}\right\rbrace ^{1/2}=e^{-1/2}\approx 0.606531.}

It follows that about60.6531%{\displaystyle 60.6531\%} of the primes are regular by chance. Hart et al.[4] indicate that60.6590%{\displaystyle 60.6590\%} of the primes less than231=2,147,483,648{\displaystyle 2^{31}=2,147,483,648} are regular.

Irregular primes

[edit]

An odd prime that is not regular is anirregular prime (or Bernoulli irregular or B-irregular to distinguish from other types of irregularity discussed below). The first few irregular primes are:

37, 59, 67, 101, 103, 131, 149, 157, 233, 257, 263, 271, 283, 293, 307, 311, 347, 353, 379, 389, 401, 409, 421, 433, 461, 463, 467, 491, 523, 541, 547, 557, 577, 587, 593, ... (sequenceA000928 in theOEIS)

Infinitude

[edit]

K. L. Jensen (a student ofNiels Nielsen[5]) proved in 1915 that there are infinitely many irregular primes of the form4n+3{\displaystyle 4n+3}.[6]In 1954Carlitz 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 integerT>6{\displaystyle T>6}, there are infinitely many irregular primes not of the formmT±1{\displaystyle mT\pm 1},[8] and later generalized this.[9]

Irregular pairs

[edit]

Ifp{\displaystyle p} is an irregular prime andp{\displaystyle p} divides the numerator of the Bernoulli numberB2k{\displaystyle B_{2k}} for0<2k<p1{\displaystyle 0<2k<p-1}, then(p,2k){\displaystyle (p,2k)} is called anirregular pair. In other words, an irregular pair is a bookkeeping device to record, for an irregular primep{\displaystyle p}, the particular indices of the Bernoulli numbers at which regularity fails. The first few irregular pairs (when ordered byk{\displaystyle k}) are:

(691, 12), (3617, 16), (43867, 18), (283, 20), (617, 20), (131, 22), (593, 22), (103, 24), (2294797, 24), (657931, 26), (9349, 28), (362903, 28), ... (sequenceA189683 in theOEIS).

The smallest evenk{\displaystyle k} such thatn{\displaystyle n}th irregular prime dividesB2k{\displaystyle B_{2k}} are

32, 44, 58, 68, 24, 22, 130, 62, 84, 164, 100, 84, 20, 156, 88, 292, 280, 186, 100, 200, 382, 126, 240, 366, 196, 130, 94, 292, 400, 86, 270, 222, 52, 90, 22, ... (sequenceA035112 in theOEIS).

For a given primep{\displaystyle p}, the number of such pairs is called theindex of irregularity ofp{\displaystyle p}.[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(p,p3){\displaystyle (p,p-3)} is in fact an irregular pair forp=16843{\displaystyle p=16843}, as well as forp=2124679{\displaystyle p=2124679}.. There are no more occurrences forp<109{\displaystyle p<10^{9}}.

Irregular index

[edit]

An odd primep{\displaystyle p} hasirregular indexn{\displaystyle n}if and only if there aren{\displaystyle n} values ofk{\displaystyle k} for whichp{\displaystyle p} dividesB2k{\displaystyle B_{2k}} and thesek{\displaystyle k}s are less than(p1)/2{\displaystyle (p-1)/2}. The first irregular prime with irregular index greater than 1 is157, which dividesB62{\displaystyle B_{62}} andB110{\displaystyle B_{110}}, so it has an irregular index 2. Clearly, the irregular index of a regular prime is 0.

The irregular index of then{\displaystyle n}th prime starting withn=2{\displaystyle n=2}, or the prime 3 is

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 2, 0, ... (sequenceA091888 in theOEIS).

The irregular index of then{\displaystyle n}th irregular prime is

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 2, 1, 1, 1, 3, 1, 2, 3, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, ... (sequenceA091887 in theOEIS).

The primes having irregular index 1 are

37, 59, 67, 101, 103, 131, 149, 233, 257, 263, 271, 283, 293, 307, 311, 347, 389, 401, 409, 421, 433, 461, 463, 523, 541, 557, 577, 593, 607, 613, 619, 653, 659, 677, 683, 727, 751, 757, 761, 773, 797, 811, 821, 827, 839, 877, 881, 887, 953, 971, ... (sequenceA073276 in theOEIS).

The primes having irregular index 2 are

157, 353, 379, 467, 547, 587, 631, 673, 691, 809, 929, 1291, 1297, 1307, 1663, 1669, 1733, 1789, 1933, 1997, 2003, 2087, 2273, 2309, 2371, 2383, 2423, 2441, 2591, 2671, 2789, 2909, 2957, ... (sequenceA073277 in theOEIS).

The primes having irregular index 3 are

491, 617, 647, 1151, 1217, 1811, 1847, 2939, 3833, 4003, 4657, 4951, 6763, 7687, 8831, 9011, 10463, 10589, 12073, 13217, 14533, 14737, 14957, 15287, 15787, 15823, 16007, 17681, 17863, 18713, 18869, ... (sequenceA060975 in theOEIS).

The least primes having irregular indexn{\displaystyle n} are

2, 3, 37, 157, 491, 12613, 78233, 527377, 3238481, ... (sequenceA061576 in theOEIS).

(This sequence defines "the irregular index of 2" as −1, and also starts atn=1{\displaystyle n=-1}.)

Generalizations

[edit]

Euler irregular primes

[edit]

Similarly, we can define anEuler irregular prime (or E-irregular) as a primep{\displaystyle p} that divides at least oneEuler numberE2n{\displaystyle E_{2n}} with0<2np3{\displaystyle 0<2n\leq p-3}. The first few Euler irregular primes are

19, 31, 43, 47, 61, 67, 71, 79, 101, 137, 139, 149, 193, 223, 241, 251, 263, 277, 307, 311, 349, 353, 359, 373, 379, 419, 433, 461, 463, 491, 509, 541, 563, 571, 577, 587, ... (sequenceA120337 in theOEIS).

The Euler irregular pairs are

(61, 6), (277, 8), (19, 10), (2659, 10), (43, 12), (967, 12), (47, 14), (4241723, 14), (228135437, 16), (79, 18), (349, 18), (84224971, 18), (41737, 20), (354957173, 20), (31, 22), (1567103, 22), (1427513357, 22), (2137, 24), (111691689741601, 24), (67, 26), (61001082228255580483, 26), (71, 28), (30211, 28), (2717447, 28), (77980901, 28), ... .

Vandiver proved in 1940 thatFermat's Last Theorem (thatxp+yp=zp{\displaystyle x^{p}+y^{p}=z^{p}} has no solution for integersx{\displaystyle x},y{\displaystyle y},z{\displaystyle z} withgcd(xyz,p)=1{\displaystyle \gcd(xyz,p)=1}) is true for prime exponentsp{\displaystyle p} that are Euler-regular. Gut proved thatx2p+y2p=z2p{\displaystyle x^{2p}+y^{2p}=z^{2p}} has no solution ifp{\displaystyle p} has an E-irregularity index less than 5.[11]

See also

[edit]

References

[edit]
  1. ^Gardiner, A. (1988), "Four Problems on Prime Power Divisibility",American Mathematical Monthly,95 (10):926–931,doi:10.2307/2322386,JSTOR 2322386
  2. ^Johnson, W. (1975),"Irregular Primes and Cyclotomic Invariants",Mathematics of Computation,29 (129):113–120,doi:10.2307/2005468,JSTOR 2005468
  3. ^Buhler, J.; Crandall, R.; Ernvall, R.; Metsänkylä, T. (1993), "Irregular primes and cyclotomic invariants to four million",Math. Comp.,61 (203):151–153,Bibcode:1993MaCom..61..151B,doi:10.1090/s0025-5718-1993-1197511-5
  4. ^Hart, William; Harvey, David; Ong, Wilson (2017), "Irregular primes to two billion",Mathematics of Computation,86 (308):3031–3049,arXiv:1605.02398,doi:10.1090/mcom/3211,MR 3667037
  5. ^Corry, Leo,Number Crunching vs. Number Theory: Computers and FLT, from Kummer to SWAC (1850–1960), and beyond(PDF)
  6. ^Jensen, K. L. (1915), "Om talteoretiske Egenskaber ved de Bernoulliske Tal",Nyt Tidsskrift for Matematik,26:73–83,JSTOR 24532219
  7. ^Carlitz, L. (1954),"Note on irregular primes"(PDF),Proceedings of the American Mathematical Society,5 (2),AMS:329–331,doi:10.1090/S0002-9939-1954-0061124-6,ISSN 1088-6826,MR 0061124
  8. ^Tauno Metsänkylä (1971), "Note on the distribution of irregular primes",Ann. Acad. Sci. Fenn. Ser. A I,492,MR 0274403
  9. ^Tauno Metsänkylä (1976),"Distribution of irregular prime numbers",Journal für die reine und angewandte Mathematik,1976 (282):126–130,doi:10.1515/crll.1976.282.126,S2CID 201061944
  10. ^Narkiewicz, Władysław (1990),Elementary and analytic theory of algebraic numbers (2nd, substantially revised and extended ed.),Springer-Verlag;PWN-Polish Scientific Publishers, p. 475,ISBN 3-540-51250-0,Zbl 0717.11045
  11. ^"The Top Twenty: Euler Irregular primes",primes.utm.edu, retrieved2021-07-21

Further reading

[edit]

External links

[edit]
Prime number classes
By formula
By integer sequence
By property
Base-dependent
Patterns
k-tuples
By size
Complex numbers
Composite numbers
Related topics
First 60 primes
Retrieved from "https://en.wikipedia.org/w/index.php?title=Regular_prime&oldid=1301704392"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp