Skip to content

Erdős problem 13

Start work

If A⊆{1,...,N}A \subseteq \{1, ..., N\} is a set with no a,b,c∈Aa, b, c \in A such that a∣(b+c)a | (b+c) and a<min⁡(b,c)a < \min(b,c), then ∣A∣≤N/3+O(1)|A| \le N/3 + O(1). This has been solved by Bedert [Be23].

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:883e7cac40c469d57c458b09d024ebf5ab17efb0cb3776ab69dda186ab953540
Metadata
sha256:53b8a5ab60bd4918b72ac9fcd131aefabf15951efee3b1f918b640a5a061f9aa
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:29660b3f391b2aae05369449321f2c892d052b1f4342dc13ca365d143ecae501
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON