Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Elementary family: five modulo eight

Proved
ErdosStraus242.family_D

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

egyptian-fractionsnumber-theory

For a natural number n>2n>2n>2 with n≡5(mod8)n≡5\pmod8n≡5(mod8), put u=(n+3)/4u=(n+3)/4u=(n+3)/4. Then 1≤u<nu/2<nu1≤ u<nu/2<nu1≤u<nu/2<nu and 4/n=1/u+1/(nu/2)+1/(nu)4/n=1/u+1/(nu/2)+1/(nu)4/n=1/u+1/(nu/2)+1/(nu) in the rationals. The displayed quotients are computed in the natural numbers; the congruence makes both exact.

Preamble
import Definitions.Def_ErdosStraus242
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Finset.Insert
Formal statement
namespace ErdosStraus242
theorem family_D (n : ℕ) (hn : 2 < n) (hmod : n % 8 = 5) :
    let u := (n+3)/4
    1 ≤ u ∧ u < n*u/2 ∧ n*u/2 < n*u ∧
      (4 / n : ℚ) = 1 / u + 1 / (n*u/2 : ℕ) + 1 / (n*u : ℕ) := by sorry
end ErdosStraus242
Source
Bloom–Elsholtz (2022), p. 239, displayed 8t+58t+58t+5 identity, https://www.math.tugraz.at/~elsholtz/WWW/papers/bloom-elsholtz-naw5-2022-23-4-237.pdf. Reparameterized with u=2(t+1)u=2(t+1)u=2(t+1); all divisibility and order conditions proved locally.
Read-back

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

For every natural number nnn satisfying 2<n2<n2<n and having remainder 555 upon division by 888, let u=⌊(n+3)/4⌋u=\lfloor(n+3)/4\rflooru=⌊(n+3)/4⌋, where this is division in the natural numbers. Then 1≤u1\le u1≤u, u<⌊nu/2⌋u<\lfloor nu/2\rflooru<⌊nu/2⌋, and ⌊nu/2⌋<nu\lfloor nu/2\rfloor<nu⌊nu/2⌋<nu, and the following equality holds in the rational numbers: 4/n=1/u+1/⌊nu/2⌋+1/(nu)4/n=1/u+1/\lfloor nu/2\rfloor+1/(nu)4/n=1/u+1/⌊nu/2⌋+1/(nu). Here nununu is the natural-number product and ⌊nu/2⌋\lfloor nu/2\rfloor⌊nu/2⌋ is computed by natural-number division before being used as a rational denominator; all divisions in the rational equality use the natural-number denominators interpreted as rational numbers. The quantification includes n=5n=5n=5, the smallest permitted value, and the asserted inequalities make all three denominators positive and strictly increasing.

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