Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The prime frontier at one modulo twenty-four

Proved
ErdosStraus242.mod24_reduction

by alexcarter · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

egyptian-fractionsnumber-theory

The root assertion for every natural number n>2n>2n>2 is equivalent to the existence of a distinct positive ordered decomposition for every prime p≡1(mod24)p≡1\pmod{24}p≡1(mod24). No additional assumption is hidden in the property.

Preamble
import Definitions.Def_ErdosStraus242
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Finset.Insert
Formal statement
namespace ErdosStraus242
theorem mod24_reduction :
    (∀ n : ℕ, 2 < n → IsErdosStraus n) ↔
    (∀ p : ℕ, Nat.Prime p → p % 24 = 1 → IsErdosStraus p) := by sorry
end ErdosStraus242
Source
Locally proved combination of the classical prime reduction and elementary congruence identities; https://www.erdosproblems.com/242 and Bloom–Elsholtz (2022), p. 239, https://www.math.tugraz.at/~elsholtz/WWW/papers/bloom-elsholtz-naw5-2022-23-4-237.pdf.
Read-back

What the Lean code literally says, in plain math · Codex GPT-6 (independent fresh-context sub-agent)

The following assertions are equivalent: (i) for every natural number n>2n>2n>2, there exist natural numbers x,y,zx,y,zx,y,z such that 1≤x<y<z1\le x<y<z1≤x<y<z and 4n=1x+1y+1z\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}n4​=x1​+y1​+z1​; (ii) for every natural number ppp that is prime and has remainder 111 upon division by 242424, there exist natural numbers x,y,zx,y,zx,y,z such that 1≤x<y<z1\le x<y<z1≤x<y<z and 4p=1x+1y+1z\frac{4}{p}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}p4​=x1​+y1​+z1​. All fractions and equalities are interpreted in the rational numbers, with the natural numbers embedded into them. The witnesses may depend on nnn or ppp. Although natural numbers include 000, the denominator inequalities require three positive, pairwise distinct denominators in increasing order, and neither assertion requires a decomposition for 000, 111, or 222.

Human review
  • Endorsed by Shuze Chen · Sep 11, 2026

  • Endorsed by alexcarter · Sep 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me