The inverse sieve conjecture in dimension one
Statement
Let . Suppose is a set of integers with , occupying fewer than residue classes modulo every prime , where . The inverse sieve conjecture. Most of is contained in the image of an integer polynomial whose degree is bounded in terms of and . This is a strong one-dimensional inverse sieve statement, attributed in the source to the work cited there; the precise meaning of “most” is not specified in the supplied statement.
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.