Erdős Problem #360 — Partitions preventing monochromatic subset sums
Statement
Let be the least number of classes needed to partition so that is not a sum of distinct elements from one class. How quickly does grow?
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.