Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The reciprocal-triple-free maximum increases by one from 733 to 734

Proved
Erdos302Extension734.exact_maximum_734_from_733

by Sodelin · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

erdos-302extremal-combinatoricsnumber-theorysodelin-erdos302

Call a subset of positive integers admissible if it contains no a<b<ca<b<ca<b<c satisfying a(b+c)=bca(b+c)=bca(b+c)=bc, equivalently 1/a=1/b+1/c1/a=1/b+1/c1/a=1/b+1/c. Let k∈Nk\in\mathbb Nk∈N. If kkk is an attained maximum cardinality for admissible subsets of {1,…,733}\{1,\ldots,733\}{1,…,733}, then

max⁡{∣S∣:S⊆{1,…,734}, S admissible}=k+1.\max\{|S|:S\subseteq\{1,\ldots,734\},\ S\text{ admissible}\}=k+1.max{∣S∣:S⊆{1,…,734}, S admissible}=k+1.

This exact finite transfer is independent of any specified numerical baseline at 731 or733. The maximum includes both an attaining witness and a universal upper bound.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_Extension734
import Definitions.Def_KernelEndpoints734
import Definitions.Def_Plateau302

open Erdos302Finite

Formal statement
theorem Erdos302Extension734.exact_maximum_734_from_733 (k : Nat) (h : FullExactMaximum 733 k) :
 FullExactMaximum 734 (k + 1) := by sorry

Source
https://github.com/Sodelin/oldest-conjecture-/blob/48bcf1429395b980198207bf6a876994fab80789/Extension734.lean#L222-L230

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