Erdős Problem #131 — Let F(N) be the maximal size of A⊆1,…,N such that no a∈ A divides the sum of any distinct elements of Abackslasha.
Statement
Let be the maximal size of such that no divides the sum of any distinct elements of . 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.