Erdős Problem #327 — Divisibility-avoiding sets for pair sums
Let , and for define
The first question asks whether such a set for can be “substantially more” than the odd integers. The odd integers provide a lower bound of ; “substantially more” is not quantified in the question. The second question asks whether every set has size as , equivalently whether . Here means that is an integer multiple of . Erdős Problem #327 Yu Leon Liu, Upper Bounds for Erdős Problem #327 and Its k-Variant
Background
Erdős and Graham posed these questions in Old and New Problems and Results in Combinatorial Number Theory (1980). Their unit-fraction connection follows from
which is a unit fraction exactly when . Likewise, the average of and is a unit fraction exactly when . Thus the two variants ask for large sets of unit fractions avoiding, respectively, a pair whose sum or whose average is a unit fraction. The odd integers give the stated lower bound for the first variant, since the sum of two odd integers is even while their product is odd. Erdős and Graham (1980) Erdős Problem #327
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.