A least Egyptian-fraction length at lower bound 18 exists and is at most 35
ProvedEgyptianFractions.exists_minimum18_le_35egyptian-fractionserdos-295known-result-reproductionnumber-theorysodelin-egyptian295
For distinct positive integers , consider representations . There exists an attained least length among all such representations, and
The bound reproduces an existing 35-term construction. It does not assert that35 is minimum, give a33- or34-term construction, establish the externally reported lower bound, or settle the asymptotic Erdős problem295.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_EgyptianFractions_Baseline18 import Definitions.Def_EgyptianFractions_Certificate import Theorems.Thm_EgyptianFractions_exists_minimum_of_representation
Formal statement
theorem EgyptianFractions.exists_minimum18_le_35 :
∃ minimum, IsMinimumLength 18 minimum ∧ minimum ≤ 35 := by sorry
Source