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 1−2=−11 - 2 = -1 and 2−1=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.

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.