Skip to content

Erdős problem 13

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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:29660b3f391b2aae05369449321f2c892d052b1f4342dc13ca365d143ecae501
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page