The reciprocal-triple-free maximum increases by one from 733 to 734
ProvedErdos302Extension734.exact_maximum_734_from_733erdos-302extremal-combinatoricsnumber-theorysodelin-erdos302
Call a subset of positive integers admissible if it contains no satisfying , equivalently . Let . If is an attained maximum cardinality for admissible subsets of , then
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