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.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:9f2a119ec92f49143687e82f173b97b675cb48406ef3a3b676c246db1247f0fc
Metadata
sha256:575fc72d3b3c7c8bddd738735fc34d74e9bceeb1d63dc02bcb29262b0b206202
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:da7c8a23b2dcc118bdd5c63954826436210c3bc7b6d024c4be0ebb4833d658fa
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb