betaFeedback

WorksMathematics

Consecutive primes at distance 122,290

Abstract

We exhibit two consecutive primes whose difference is exactly 122 290122\,290. Both primes have 8 2628\,262 decimal digits. Every integer strictly between them has a prime divisor at most 32 46732\,467. We give the covering argument and the elliptic-curve criterion that certify the result. The proof is computer-assisted and uses finite arithmetic checks to establish endpoint primality and the compositeness of every interior integer.

The result and the covering argument

A prime gap of length hh is a pair of primes pp, p+hp+h such that every integer between them is composite. We prove the following statement.

Theorem 1.1. Let pp be the integer written in Appendix § 3. Then pp and p+122 290p+122\,290 are consecutive primes, each with 8 262 decimal digits. Moreover, every integer nn with p<n<p+122 290p<n<p+122\,290 has a prime divisor at most 32 467.

The full residue table and the two primality chains form the supplementary arithmetic appendix. Their mathematical format is specified below.

A covering congruence supplies one small divisor for each interior integer.

Lemma 1.2. Let h≥2h\ge2, let QQ be a finite set of primes, and choose a residue bqb_q modulo each q∈Qq\in Q. Put

W=∏q∈Qq,W=\prod_{q\in Q}q,

and let 0≤a<W0\le a<W satisfy a≡bq(modq)a\equiv b_q\pmod q for every q∈Qq\in Q. Suppose that

{1,…,h−1}⊆⋃q∈Q{j:j≡−bq(modq)}.\{1,\ldots,h-1\}\subseteq\bigcup_{q\in Q}\{j:j\equiv-b_q\pmod q\}.

If m≥1m\ge1, p=a+mW>max⁡Qp=a+mW>\max Q, and pp, p+hp+h are prime, then they are consecutive primes.

Proof. For 1≤j<h1\le j<h, choose q∈Qq\in Q with j≡−bq(modq)j\equiv-b_q\pmod q. Since p≡a≡bq(modq)p\equiv a\equiv b_q\pmod q, we have q∣p+jq\mid p+j. The inequalities 1<q<p+j1<q<p+j show that p+jp+j is composite. □

For the integer pp in Theorem 1.1, the residue table has 2 180 pairs (q,bq)(q,b_q) and satisfies

bq≡p(modq),bq≠0,−122 290(modq).b_q\equiv p\pmod q,\qquad b_q\ne0,-122\,290\pmod q.

Every qq is prime and q≤32 467q\le32\,467. The Chinese remainder construction is p=a+530 520Wp=a+530\,520W, where W=∏qW=\prod q, 0≤a<W0\le a<W, and a≡bq(modq)a\equiv b_q\pmod q. The integer WW has 8 256 decimal digits.

To check the interior directly, start with S={1,…,122 289}S=\{1,\ldots,122\,289\}. For each prime q≤Bq\le B, remove the offsets j≡−p(modq)j\equiv-p\pmod q. The successive numbers of remaining offsets are

BBRemainingBBRemaining
261 14414 983818
9714 57719 997126
9978 66524 98926
4 9994 67329 9893
9 9732 34232 4670

Table 1.

Thus every interior integer has a proper prime divisor at most 32 467.

Endpoint primality and completion of the proof

We use the following form of the elliptic-curve primality criterion [1]. All group operations in the statement are performed modulo NN.

Lemma 2.1. Let N>3N > 3 be coprime to 6, and let E:y2=x3+Ax+BE : y^2 = x^3 + Ax + B satisfy gcd⁡(4A3+27B2,N)=1\gcd(4A^3 + 27B^2,N) = 1. Suppose that rr is prime, r>(N1/4+1)2r > (N^{1/4} + 1)^2, and an affine point RR on EE satisfies [r]R=O[r]R = O. If the computation uses only denominators coprime to NN, then NN is prime.

Proof. If NN were composite, it would have a prime divisor ℓ≤N\ell\le\sqrt{N}. Reduction modulo ℓ\ell gives a nonsingular elliptic curve, and RR reduces to an affine point. This point has order rr, since it is nonzero and is annihilated by the prime rr. Hasse’s bound therefore gives

r≤#E(Fℓ)≤(ℓ+1)2≤(N1/4+1)2,r \le\#E(\mathbb{F}_{\ell}) \le(\sqrt{\ell} + 1)^2 \le(N^{1/4} + 1)^2,

a contradiction. □

For each endpoint, the certificate is a finite chain of integers NiN_i and tuples (ti,si,Ai,Xi,Yi)(t_i,s_i,A_i,X_i,Y_i), with

Ni+1=Ni+1−tisi,Bi≡Yi2−Xi3−AiXi(modNi).N_{i+1} = \frac{N_i + 1 - t_i}{s_i}, \qquad B_i \equiv Y_i^2 - X_i^3 - A_iX_i \pmod{N_i}.

For 0≤i<k0 \le i < k, Ni>3N_i > 3, si>0s_i > 0, and Ni+1N_{i+1} is an integer. At each step we have

gcd⁡(Ni,6)=gcd⁡(4Ai3+27Bi2,Ni)=1,\gcd(N_i,6) = \gcd(4A_i^3 + 27B_i^2,N_i) = 1,
Ni+1>(Ni1/4+1)2,Ri=[si](Xi,Yi)≠O,[Ni+1]Ri=O.(1)N_{i+1} > (N_i^{1/4} + 1)^2, \qquad R_i = [s_i](X_i,Y_i) \ne O, \qquad[N_{i+1}]R_i = O. \tag*{(1)}

The point RiR_i is affine and every division in its computation, and in that of [Ni+1]Ri[N_{i+1}]R_i, has denominator coprime to NiN_i. These are exact modular arithmetic checks. The two chains have the following endpoints.

Starting integerNumber of stepsTerminal integer
pp64777 611 968 613
p+122 290p + 122\,29065978 278 019 539

Table 1 (PDF p. 2).

Both terminal integers are prime. For a direct order check, their factorizations and bases are

77 611 968 613−1=22⋅34⋅937⋅255 649,g=6,77\,611\,968\,613 - 1 = 2^2 \cdot3^4 \cdot937 \cdot255\,649,\qquad g = 6,
78 278 019 539−1=2⋅389⋅5 531⋅18 191,g=2.78\,278\,019\,539 - 1 = 2 \cdot389 \cdot5\,531 \cdot18\,191,\qquad g = 2.

Every displayed factor is prime by trial division. In each row, gN−1≡1(modN)g^{N-1} \equiv1 \pmod N and gcd⁡(g(N−1)/r−1,N)=1\gcd(g^{(N-1)/r} - 1,N) = 1 for every prime r∣N−1r \mid N-1. Consequently gg has order N−1N-1 modulo every prime divisor ℓ\ell of NN, so N−1∣ℓ−1N-1 \mid\ell-1 and ℓ≥N\ell\ge N. This proves the claim.

Proof of Theorem 1.1. The finite modular checks (1), starting from the two terminal primes and applying Lemma 2.1 backwards along each chain, prove that pp and p+122 290p + 122\,290 are prime. The covering calculation in Section 1 proves every intermediate integer composite. Thus the primes are consecutive. The decimal representation of pp and addition of 122 290 give 8 262 digits in both cases. □

Acknowledgment

Acknowledgment. The authors acknowledge OpenAI’s AI systems for assistance with the construction, finite arithmetic verification, and preparation of this paper.

The starting prime

The decimal expansion of pp is displayed below. The lines are concatenated and spaces separate blocks of ten digits. The integer p+122 290p + 122\,290 is then determined by addition.

2524630355 5392095200 6849031818 2436336455 8705070412 1679587043 2398027747 9814213567 5465079894 0493256636 4749901363 7823525575 4209929759 9738020881 7752842148 3859541993 4209196681 4556241831 2586384700 5663906315 1839543596 7260996320 6698569079 2712486548 1453992286 7309146566 4147352403 1034075473 0932486503 7771948675 0538956940 2856290174 5774135130 8828043496 4853408946 0162269581 4061115880 3828627806 0403256665 7074998453 7470356071 3668275390 8061279014 2506972619 0119303941 2589965001 5584117686 9475615343 6449533093 2910451236 1220951615 2184713873 2797330447 6485527212 2577310486 5208352493 4033071492 6223893449 5446224729 9128489789 0064275766 6889877248 3321933151 8539283669 5896459721 0204974914 1353610729 4232034593 9209438523 9061891081 3827634985 7887852391 0418366629 1542255791 1958492222 4598665039 5249055786 2846777088 8395643767 5937390640 5292674126 2373670525 4827389933 0732408098 6939913760 1274338263 7517970302 1828395992 8627815024 5649001329 3631552984 9105155093 4575288391 0177794671 8860046765 0792351466 3655060518 8431946824 8646326914 5199183796 4304679065 2821823293 0006079496 1699777199 0824081861 5185650275 0386743802 5538811771 5051917928 6453527121 4754385031 2847869816 3076786496 1782064058 3458729594 5550585916 0437474672 4563880450 4628050102 8610642121 9866783775 7677493203 4046536681 6758671044 9913134478 4319417191 2897639301 3038574757 3431939458 9607257413 4622799655 1751800158 4631126739 7168658370 9542877343 5317690685 0814908329 5618131314 3676935022 7382996028 3689035536 6199596159 8289943849 7166392882 1564506423 4457934027 8485098886 4962041472 1612544564 9886958936 1334402470 7084549558 7622917919 2961450426 9004069963 9871721950 5722466388 2694631561 4433503669 4076733685 8200918093 6378514843 8447287804 2669665725 5067558074 3328222114 6997480992 3679095266 7723035108 1543450869 0659923574 6056699848 3716076746 7548415275 1995726963 8028406666 9346759480 9127972023 3445401568 2522725532 1694552698 2850467545 0582666679 1607539513 3020682543 9156668990 7317750218 7161752500 1719007676 3169499758 0549738598 5240661090 0997728324 5796817404 6771303866 3422757322 7197426540 4856247458 6210122019 9373992050 8173168442 1709024318 7223754580 3730348402 2597790757 0 …

Email address: [email protected]

Email address: [email protected]

Email address: [email protected]

Email address: [email protected]

References

  1. [1]A. O. L. Atkin and F. Morain, Elliptic curves and primality proving, Math. Comp. 61 (1993), no. 203, 29–68.DOI

Paper details

vlnc:W_4jurua2m
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI Codex

View statement
Looking for related papers…
Contents