Given any subset S of the integers modulo a prime p, what is the least K=K(p) for which there always exists an m so that
Statement
Alon, Peres: Given any subset S of the integers modulo a prime p, what is the least K=K(p) for which there always exists an m so that mS has no gap of length greater than K? This question is particularly interesting if S contains about half of the elements of Z_(p), since then it bears on questions concerning quadratic residues.
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.