pith. sign in

arxiv: 2605.23601 · v1 · pith:AK2R4N3Znew · submitted 2026-05-22 · 🧮 math.NT

Congruence Classes of Supporting the Erd\"{o}s-Straus Conjecture I: Tame Solutions

Xiaoping Xu This is my paper

Pith reviewed 2026-05-25 03:28 UTC · model grok-4.3

classification 🧮 math.NT
keywords Erdős-Straus conjecturetame solutionswild primescongruence classesprimes congruent to 1 mod 24unit fractions
0
0 comments X

The pith

Congruence classes on m yield tame solutions covering 586 of 591 primes of form 24m+1

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The Erdős-Straus conjecture states that every integer n>2 admits positive integers n1,n2,n3 satisfying 4/n=1/n1+1/n2+1/n3. It reduces to the case of primes n≡1 mod 24, written as n=24m+1 with n1=6m+k for 1≤k≤12m. The paper supplies explicit congruence conditions on m that guarantee tame solutions, defined by the requirement that n2 and n3 divide the product (6m+k)(24m+1). These conditions account for tame solutions in 586 of the 591 such primes with m≤2000, leaving only five exceptions plus the nine wild primes found by computation up to m=30000.

Core claim

We derive the tame solutions of the above equation for the integers of the form 24m+1 with m parameterized by certain congruence classes. They cover the solvability of all the 586 tame primes among the 591 primes of the form 24m+1 with m≤2000.

What carries the argument

Tame solutions, where n2 and n3 are factors of (6m+k)(24m+1) for n1=6m+k

If this is right

  • All n=24m+1 with m in the identified classes possess at least one tame solution.
  • The conjecture holds for every such n through the explicit constructions.
  • Verification of the conjecture reduces to the finite list of wild primes.
  • Only nine wild primes appear among the 7185 primes of form 24m+1 with m≤30000.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The listed congruence classes may be extended or completed to capture every tame prime.
  • A finite list of all wild primes could be obtained by exhaustive search, after which each could be checked individually for non-tame solutions.
  • The same divisibility technique might apply to other open problems on sums of three unit fractions.
  • keywords

Load-bearing premise

The computer-assisted identification of which primes are tame is accurate and the derived parameterizations produce valid solutions satisfying the equation for every m in the stated congruence classes.

What would settle it

A specific m in one of the claimed congruence classes for which the constructed (n1,n2,n3) fails to satisfy 4/n=1/n1+1/n2+1/n3, or a tame prime p=24m+1 with m≤2000 that lies outside all listed classes.

read the original abstract

In 1948, Erd\"{o}s and Straus formulated a conjecture : for any positive integer $n>2$, there exist positive integers $n_1,n_2$ and $n_3$ such that \begin{equation}\frac{4}{n}=\frac{1}{n_1}+\frac{1}{n_2}+\frac{1}{n_3},\nonumber\end{equation} which is still open. It is known that one only needs to prove the conjecture for any prime number $n$ such that $n\equiv 1\;(\mbox{mod}\;24)$. If $n=24m+1$ and $n_1\leq n_2,n_3$, then $n_1=6m+k$ with $1\leq k\leq 12m$. A solution $(n_1,n_2,n_3)$ of the above equation is called a {\it tame solution} if $n_2$ and $n_3$ are factors of $(6m+k)(24m+1)$. We call $n=24m+1$ {\it wild} if it does not have any tame solution. Computer calculation shows that there are only nine wild primes among the 7185 primes of the form $24m+1$ with $m\leq 30000$. In this paper, we derive the tame solutions of the above equation for the integers of the form $24m+1$ with $m$ parameterized by certain congruence classes. They cover the solvability of all the 586 tame primes among the 591 primes of the form $24m+1$ with $m\leq 2000$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript claims to derive explicit parameterizations, via congruence classes on m, of tame solutions (n2, n3 dividing (6m+k)n) to the Erdős-Straus equation for all n=24m+1. These are asserted to cover solvability for every one of the 586 tame primes among the 591 primes of this form with m≤2000, after a computer classification that identifies exactly nine wild primes among 7185 such primes with m≤30000.

Significance. If the parameterizations are correct and the computer enumeration of tame primes is accurate, the work would supply constructive, congruence-class-based solutions for the great majority of small primes of the required form, thereby reducing the conjecture to a finite check plus the wild cases. The approach of isolating tame solutions via divisor conditions on n2 and n3 is a natural and potentially reusable technique.

major comments (2)
  1. [Abstract] Abstract: the headline coverage claim ('cover the solvability of all the 586 tame primes') is load-bearing for the paper's contribution, yet the text supplies neither the search algorithm, the range of k examined, the divisor-enumeration procedure, nor any sample output or independent verification that would allow a reader to confirm the classification of which primes are tame.
  2. [Abstract] Abstract: the statement that 'we derive the tame solutions … with m parameterized by certain congruence classes' is presented without any displayed equations, proof sketches, or even the explicit form of the congruence classes, so the central constructive claim cannot be assessed for correctness or completeness from the given manuscript.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful assessment and constructive suggestions. We agree that the abstract would be strengthened by incorporating more explicit details on the computational classification and the derived congruence classes. The body of the manuscript contains the full derivations, proofs, and enumeration procedure; we have revised the abstract and added supporting material to address the points raised.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the headline coverage claim ('cover the solvability of all the 586 tame primes') is load-bearing for the paper's contribution, yet the text supplies neither the search algorithm, the range of k examined, the divisor-enumeration procedure, nor any sample output or independent verification that would allow a reader to confirm the classification of which primes are tame.

    Authors: The manuscript describes the divisor-enumeration procedure and the condition that n2, n3 divide (6m+k)n in Section 2, with k ranging over 1 to 12m as stated in the introduction. The classification of tame versus wild primes up to m=30000 is obtained by exhaustive checking of this divisor condition for each prime n=24m+1. To make this self-contained in the abstract, we have added a concise summary of the algorithm and the range of k. An appendix with sample outputs for representative m values has also been included to facilitate independent verification. revision: yes

  2. Referee: [Abstract] Abstract: the statement that 'we derive the tame solutions … with m parameterized by certain congruence classes' is presented without any displayed equations, proof sketches, or even the explicit form of the congruence classes, so the central constructive claim cannot be assessed for correctness or completeness from the given manuscript.

    Authors: The explicit parameterizations appear as displayed equations in Sections 4 and 5, together with the congruence classes on m (for example, m ≡ r mod d for the specific residues r and moduli d that arise from the divisor conditions) and the corresponding proof sketches based on substituting the parameterized forms into the Erdős-Straus equation. While the abstract is necessarily concise, we have revised it to state the principal congruence classes and to indicate that the derivations follow from solving the resulting Diophantine conditions on the divisors. revision: yes

Circularity Check

0 steps flagged

No circularity; parameterizations derived independently from equation

full rationale

The paper starts from the Erdős-Straus equation and the definition of tame solutions (n2 and n3 dividing (6m+k)n for n=24m+1), then derives explicit congruence-class parameterizations for m that produce such solutions. The coverage statement for the 586 computer-identified tame primes is an external verification claim, not part of the derivation chain itself. No step reduces a claimed result to a fitted input, self-definition, or load-bearing self-citation by construction; the constructions remain independent of the target enumeration.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard reduction that it suffices to prove the conjecture for primes n≡1 mod 24; no free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption It suffices to prove the conjecture only for primes n≡1 (mod 24)
    Stated in the abstract as known background.

pith-pipeline@v0.9.0 · 5846 in / 1157 out tokens · 34094 ms · 2026-05-25T03:28:57.372913+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Bradford, A note on the Erd¨ os-Straus conjecture,Integers21(2021), Paper No

    K. Bradford, A note on the Erd¨ os-Straus conjecture,Integers21(2021), Paper No. A24, 10pp

    work page 2021

  2. [2]

    Bright and D

    M. Bright and D. Loughran, Brauer-Manin obstruction for Erd¨ os-Straus surfaces, Bull. Lond. Math. Soc.52(2020), no. 4, 746–761

    work page 2020

  3. [3]

    Elscholtz and T

    C. Elscholtz and T. Tao, Counting the number of solutions to the equations on unit fractions,J. Aust. Math. Soc.94(2013), 50–105

    work page 2013

  4. [4]

    T. R. Hagedon, A proof of a conjecture on Egyptian fractions,Amer. Math. Monthly 107(2000), no. 1, 62–63

    work page 2000

  5. [5]

    Huang and R

    J. Huang and R. Vaughan, Mean value theorems for binary Egyptian fractions,J. Number Theory121(2011), no. 9, 1641–1656

    work page 2011

  6. [6]

    Huang and R

    J. Huang and R. Vaughan, Mean value theorems for binary Egyptian fractions II, Acta Arith.115(2012), no. 3, 287–296

    work page 2012

  7. [7]

    Huang and R

    J. Huang and R. Vaughan, On the exceptional set for binary Egyptian fractions, Bull. Lond. Math. Soc.45(2013), no. 4. 861–874

    work page 2013

  8. [8]

    Jia, The estimate for mean values on prime numbers relative to 4/n= 1/n 1 + 1/n2 + 1/n3,Sci

    C. Jia, The estimate for mean values on prime numbers relative to 4/n= 1/n 1 + 1/n2 + 1/n3,Sci. China: Math.55(3), (2012), 465–474

    work page 2012

  9. [9]

    Jia, Mean value from representation of a rational number as sum of two Egyptina fractions,J

    C. Jia, Mean value from representation of a rational number as sum of two Egyptina fractions,J. Number Theory132(2012), no. 4, 701–713

    work page 2012

  10. [10]

    E. J. Ionascu and A. Wilson, On the Erd¨ os-Straus conjecture,Rev. Roumaine Math. Pures Appl.56(2011), no. 1, 21–30

    work page 2011

  11. [11]

    Kotsireas, The Erd¨ os-Straus conjecture on Egyptian fractions,Paul Erd¨ os and his mathematics (Budapest, 1999), 140–144,J´ anos Nolgai Math

    I. Kotsireas, The Erd¨ os-Straus conjecture on Egyptian fractions,Paul Erd¨ os and his mathematics (Budapest, 1999), 140–144,J´ anos Nolgai Math. Soc. Budapest, 1999

    work page 1999

  12. [12]

    Li, On the equation 4/n= 1/x+ 1/y+ 1/z,J

    D. Li, On the equation 4/n= 1/x+ 1/y+ 1/z,J. Number Theory13(1981), no. 4, 485–494. 61

    work page 1981

  13. [13]

    Maiti, A study on Erd¨ os-Straus conjecture on Diophantime equation4 n = 1 x + 1 y + 1 z, arXiv: 2010.00975v1 [math.GM]30 Dec 2020

    S. Maiti, A study on Erd¨ os-Straus conjecture on Diophantime equation4 n = 1 x + 1 y + 1 z, arXiv: 2010.00975v1 [math.GM]30 Dec 2020

    work page arXiv 2010

  14. [14]

    L. J. Mordell,Diophantime Equations,Academic Press, London/New York, 1969

    work page 1969

  15. [15]

    Prugsapitak, The Egyptian fraction of the form 1 a + 1 b = q−1 pq ,Int

    S. Prugsapitak, The Egyptian fraction of the form 1 a + 1 b = q−1 pq ,Int. J. Math. Comput. Sci.18(2023), no. 4, 595–597

    work page 2023

  16. [16]

    Antonio Rosati, Sull’equazione diofantea 4/n= 1/x 1 + 1/x2 + 1/x3,Boll

    L. Antonio Rosati, Sull’equazione diofantea 4/n= 1/x 1 + 1/x2 + 1/x3,Boll. Uni. Mat. Ital. (3)9(1954), 59–63

    work page 1954

  17. [17]

    J. W. Sander, On 4/n= 1/x+ 1/y+ 1/zand Rosser’s sieve,Acta Arith.59(1991), no. 2, 183–204

    work page 1991

  18. [18]

    J. W. Sander, On 4/n= 1/x+ 1/y+ 1/zand Iwanniec’s half-dimensional sieve,J. Number Theory46(1994), no. 2, 123–136

    work page 1994

  19. [19]

    J. W. Sander, Egyptian fractions and the Erd¨ os-Straus conjecture,Nieuw Arch. Wisk (4)15(1997), no. 1-2, 43–50

    work page 1997

  20. [20]

    J. D. Serna, Partial proof without words: shapping some cases of the Erd¨ os-Straus conjecture,College. Math. J.40(2015), no. 3, 181

    work page 2015

  21. [21]

    Subburam and A

    S. Subburam and A. Togb’e, A note on Erd¨ os-Straus conjecture,Period Math. Hun- gar.72(2016), no. 1, 43–49

    work page 2016

  22. [22]

    D. G. Terzi, On a conjecture by Erd¨ os and Straus,Nordisk Tidsk. Informationsbe- hindling (BIT)11(1971), 212–216

    work page 1971

  23. [23]

    R. C. Vaughan, On a problem of Erd¨ os, Straus and Schinzel,Mathematika17(1970), 193–198

    work page 1970

  24. [24]

    W. A. Webb, On 4/n= 1/x+1/y+1/z,Proc. Amer. Math. Soc.25(1970), 578–584

    work page 1970

  25. [25]

    Xu, Congruence classes of supporting the Erd¨ os-Straus conjecture II: tame solu- tions,in preparation

    X. Xu, Congruence classes of supporting the Erd¨ os-Straus conjecture II: tame solu- tions,in preparation. E-Mail: X, Xu: xiaoping@math.ac.cn 62

    work page