Erdős Problem #1211 — Logarithmic density of subset sums in a two-colouring
Partition , and let and be the sets of finite sums of distinct elements of and . If , how small can be?
References
Additional references
P. Erdős, Some new problems and results in number theory, in Number Theory (Mysore, 1981), Lecture Notes in Mathematics 938 (1982), 50–74.
Progress summary
Never refreshed
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.