Erdős Problem #361 — Let c>0 and n be some large integer. What is the size of the largest A⊆ 1,…,⌊ cn⌋ such that n is not a sum of a subset of A?
Statement
Let and be some large integer. What is the size of the largest such that is not a sum of a subset of ? Does this depend on in an irregular way?
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.