Erdős Problem #1179 — Uniform random subset-sum counts in finite abelian groups
Statement
Fix . Let be the least such that, for every abelian group of order , a uniformly random -element subset satisfies with probability tending to one that for every , where . Is ?
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.