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 statement18 of 18

An upper bound of 25\frac 2 5. See [Minimal overlapping under translation.](https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society/volume-62/issue-6) by *T. S. Motzkin*, *K. E. Ralston* and *J. L. Selfridge*, in "The summer meeting in Seattle" by *V. L. Klee Jr.*, Bull. Amer. Math. Soc.62, p. 558, 1956

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

Search problems.science

Find a Problem, Result, source, or page