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
An upper bound of . See [The minimum overlap problem](https://www.neutreeko.net/mop/index.htm) by *Jan Kristian Haugland*
Filter.limsup Erdos36.MinOverlapQuotient Filter.atTop ≤ 0.3809268534330870SolvedStatement only, no proof