Erdős Problem #963 — Let f(n) be the maximal k such that in any set A⊂ R of size n there is a subset B⊆ A of size lvert Brvert≥ k which is dissociated that is, the sums…
Statement
Let be the maximal such that in any set of size there is a subset of size which is dissociated that is, the sums are distinct for all . Estimate - in particular, is it true that
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.