Erdős Problem #531 — Let F(k) be the minimal N such that if we two-colour 1,…,N there is a set A of size k such that all subset sums ∑_a∈ Sa (for ∅≠ S⊆ A) are monochromatic…
Statement
Let be the minimal such that if we two-colour there is a set of size such that all subset sums (for ) are monochromatic. Estimate .
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.