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
A lower bound of . See [Erdős' minimum overlap problem](https://arxiv.org/abs/2201.05704) by *Ethan Patrick White*, 2022
0.379005 < Filter.liminf Erdos36.MinOverlapQuotient Filter.atTopSolvedStatement only, no proof