Skip to content

Erdős problem 36

This example calculates the value of M1M 1. The set is {1,2}\{1, 2\}, so the only partition is A={1},B={2}A = \{1\}, B = \{2\} (or vice versa). The possible differences are 12=11 - 2 = -1 and 21=12 - 1 = 1. The Overlap for k=1k=-1 is 1 (if A={1},B={2}A=\{1\}, B=\{2\}) and for k=1k=1 also 1 (if A={2},B={1}A=\{2\}, B=\{1\} ). The MaxOverlap is 11, since the Overlap is 00 for other kk. Thus, M1=1M 1 = 1.

Sources

Browse retained paths and inspect the exact material available for this Problem.

18 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

36.lean

Retained formal statement17 of 18

An upper bound of 0.38092685343308700.3809268534330870. See [The minimum overlap problem](https://www.neutreeko.net/mop/index.htm) by *Jan Kristian Haugland*

FormalConjectures/ErdosProblems/36.leanErdos36.minimum_overlap.variants.upper.haugland_20221 lineExact file
Filter.limsup Erdos36.MinOverlapQuotient Filter.atTop ≤ 0.3809268534330870
SolvedStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page