Erdős Problem #1211 — Logarithmic density of subset sums in a two-colouring
Statement
Partition , and let and be the sets of finite sums of distinct elements of and . If , how small can be?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.