HEXAGONbeta

Nested Squares and Distinct-Prime Goldbach Partitions

Primarily AI-generated textHuman understanding: all partsmath.NT — Number Theorymath.NA — Numerical Analysis

Contributed by Frank Vega ↗

Version 1 / Nov 04, 2026 / CC BY 4.0

Abstract

The distinct-prime Goldbach conjecture asserts that for every N≥4N\geq 4 there is M∈AN=[1,N−3]M\in A_N=[1,N-3] with N−MN-M and N+MN+M both prime; geometrically, nested squares of side lengths NN and MM have an L-shaped difference of semiprime area (N−M)(N+M)(N-M)(N+M). With CNC_N and DND_N the sets of M∈ANM\in A_N for which N−MN-M, respectively N+MN+M, is prime, the conjecture for 2N2N is CN∩DN≠∅C_N\cap D_N\neq\varnothing. We embed this centered condition in a straddling one: CN∩DNC_N\cap D_N lies in the set ENE_N of half-differences (Q−P)/2∈AN(Q-P)/2\in A_N of primes 2<P<N<Q<2N2<P<N<Q<2N. From Mikawa's theorem on prime pairs with almost all differences we deduce ∣AN∖EN∣≪DN/(log⁡N)D|A_N\setminus E_N|\ll_D N/(\log N)^D for every D>0D>0, and with explicit constants we prove ∣EN∣>N/760|E_N|>N/760 for every N≥3275N\geq 3275. Consequently, for all large NN and all but OD(N/(log⁡N)D)O_D(N/(\log N)^D) primes P<NP<N, the number 2N−P2N-P becomes prime after adding the difference P′−PP'-P of two primes P′<NP'<N; Goldbach's partition is the case P′=PP'=P. In contrast, ∣CN∩DN∣<(N−3)−log⁡2(2N)|C_N\cap D_N|<(N-3)-\log^2(2N) for every N≥34N\geq 34, and covering all but log⁡2(2N)\log^2(2N) values of ANA_N for all large NN would imply the Cram\'er-type bound p′−p<2log⁡2(2p+2)+2p'-p<2\log^2(2p+2)+2. The method also shows that 2N2N is a sum of two distinct primes for more than X/9600X/9600 integers N≤XN\leq X, for every X≥106X\geq 10^6. Computations up to N=106N=10^6 compare the number of distinct-prime partitions with the Hardy--Littlewood prediction and measure the missing values of ENE_N forced by prime gaps. The conjecture itself is not proved here.

Provenance statement

The author used Claude Opus 5.5 to write the experiment scripts experiment.py and large_range.py, and to improve the readability of this manuscript; the author ran all the experiments. After using this tool, the author reviewed and edited the code and the content as needed and takes full responsibility for the content of the publication.

Tools used

Anthropic
Claude OpusVersion 5.5

References

  1. Goldbach, Christian. Lettre XLIII. Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle, vol. 1, pp. 125–129. 1843. (letter to Leonhard Euler) (in German)
  2. Oliveira e Silva, Tomás; Herzog, Siegfried; Pardi, Silvio. Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10184 \cdot 10^{18}. Mathematics of Computation, vol. 83, no. 288, pp. 2033–2060. 2014DOI
  3. OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, Sequence A082467: Least k>0k>0 such that n−kn-k and n+kn+k are both primes. 2003. Accessed: 2026-11-03. https://oeis.org/A082467link
  4. Mikawa, Hiroshi. On prime twins. Tsukuba Journal of Mathematics, vol. 15, no. 1, pp. 19–29. 1991DOI
  5. Siebert, H. Montgomery's weighted sieve for dimension two. Monatshefte für Mathematik, vol. 82, no. 4, pp. 327–336. 1976DOI
  6. Dusart, Pierre. Autour de la fonction qui compte le nombre de nombres premiers. PhD thesis, Université de Limoges. 1998. Accessed: 2026-11-03. https://www.unilim.fr/pages_perso/pierre.dusart/Documents/T1998_01.pdflink
  7. Rosser, J. Barkley; Schoenfeld, Lowell. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, vol. 6, no. 1, pp. 64–94. 1962DOI
  8. Ford, Kevin; Green, Ben; Konyagin, Sergei; Maynard, James; Tao, Terence. Long gaps between primes. Journal of the American Mathematical Society, vol. 31, no. 1, pp. 65–105. 2018DOI
  9. Wolke, Dieter. Über das Primzahl-Zwillingsproblem. Mathematische Annalen, vol. 283, pp. 529–537. 1989DOI
  10. Lavrik, A. F. The number of kk-twin primes lying on an interval of a given length. Doklady Akademii Nauk SSSR, vol. 136, no. 2, pp. 281–283. 1961link
Show all 17 referencesShow fewer references
  1. Perelli, Alberto; Pintz, János. On the exceptional set for the 2k2k-twin primes problem. Compositio Mathematica, vol. 82, no. 3, pp. 355–372. 1992link
  2. Matomäki, Kaisa; Radziwiłł, Maksym; Tao, Terence. Correlations of the von Mangoldt and higher divisor functions I. Long shift ranges. Proceedings of the London Mathematical Society, vol. 118, pp. 284–350. 2019. Preprint at https://arxiv.org/abs/1707.01315link
  3. Montgomery, H. L.; Vaughan, R. C. The exceptional set in Goldbach's problem. Acta Arithmetica, vol. 27, pp. 353–370. 1975DOI
  4. Vega, Frank. Experimental Results on Goldbach's Conjecture. 2026. Accessed: 2026-11-03. https://github.com/frankvegadelgado/goldbachlink
  5. Cramér, Harald. On the order of magnitude of the difference between consecutive prime numbers. Acta Arithmetica, vol. 2, no. 1, pp. 23–46. 1936DOI
  6. Baker, R. C.; Harman, G.; Pintz, J. The difference between consecutive primes, II. Proceedings of the London Mathematical Society, vol. 83, no. 3, pp. 532–562. 2001DOI
  7. Oliveira e Silva, Tomás. Goldbach conjecture verification. Accessed: 2026-11-03. https://sweet.ua.pt/tos/goldbach.htmllink

Version history

  1. v1 · 20 pagesSubmitted by Frank VegaInitial depositCurrentNov 03, 2026