Erdős Problem #319 — Minimal vanishing signed reciprocal sums
For a positive integer , write . Define to be the largest cardinality of a set for which there is a sign assignment satisfying
and, for every nonempty proper subset ,
What is ? In particular, the condition requires the signed relation to vanish on all of but on no nonempty proper subset, using the signs assigned on . Erdős Problem #319
Background
Erdős and Graham posed the problem in their 1980 collection of problems in combinatorial number theory. It asks for a large relation among the reciprocals of distinct integers in that is minimal with respect to retaining its terms and their assigned signs: no nonempty proper selection of those signed terms may itself sum to zero. Erdős and Graham (1980) Erdős Problem #319
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.