Erdős problem 36
This example calculates the value of . The set is , so the only partition is (or vice versa). The possible differences are and . The Overlap for is 1 (if ) and for also 1 (if ). The MaxOverlap is , since the Overlap is for other . Thus, .
Sources
FormalConjectures/ErdosProblems/
36.lean
Retained formal statement
Find a better upper bound!
∃ c < 0.380926853433087, Filter.limsup Erdos36.MinOverlapQuotient Filter.atTop ≤ c ∧ c = sorryOpenStatement only, no proof