Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Three Erdős–Straus congruence families modulo 103

Proved
ErdosStraus242.family_mod103

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

egyptian-fractionsnumber-theory

For every integer n>2n>2n>2 with n mod 103∈{99,95,51}n\bmod 103\in\{99,95,51\}nmod103∈{99,95,51} there are natural numbers 1≤x<y<z1\le x<y<z1≤x<y<z with 4/n=1/x+1/y+1/z4/n=1/x+1/y+1/z4/n=1/x+1/y+1/z in Q\mathbb QQ. The three classes are the (a,c,d)=(1,α/g,g)(a,c,d)=(1,\alpha/g,g)(a,c,d)=(1,α/g,g) specializations of the Bloom–Elsholtz parametrization at modulus 4α−1=1034\alpha-1=1034α−1=103, where α=26\alpha=26α=26 and g∈{1,2,13}g\in\{1,2,13\}g∈{1,2,13} runs over the divisors of 262626; a class is n≡−4g(mod103)n\equiv -4g\pmod{103}n≡−4g(mod103). The modulus 103 is coprime to 840840840 and absent from the existing 39-family frontier; each class contains hard-core primes surviving all 39 sieves. The statement keeps the mission's strict distinct-denominator convention.

Preamble
import Definitions.Def_ErdosStraus242
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Finset.Insert
Formal statement
namespace ErdosStraus242
theorem family_mod103 (n : ℕ) (hn : 2 < n)
    (hmod : n % 103 ∈ ({99, 95, 51} : Finset ℕ)) :
    IsErdosStraus n := by sorry
end ErdosStraus242
Source
Bloom–Elsholtz, Theorem 1, pp. 239–240, https://www.math.tugraz.at/~elsholtz/WWW/papers/bloom-elsholtz-naw5-2022-23-4-237.pdf; cf. Erdős Problem 242, https://www.erdosproblems.com/242. Classes at modulus 103=4⋅26−1103=4\cdot 26-1103=4⋅26−1 from the triples (a,c,d)=(1,26,1),(1,13,2),(1,2,13)(a,c,d)=(1,26,1),(1,13,2),(1,2,13)(a,c,d)=(1,26,1),(1,13,2),(1,2,13).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me