The discriminant-controlled polynomial congruence conjecture
Statement
Fix an integer . For a monic polynomial , consider integers such that whenever divides , the prime does not divide the discriminant of . The polynomial congruence conjecture. For every , there is a constant such that there are at most integers with
The source presents this as an open variant of the bounded-residue-set conjecture, motivated by the obstruction from repeated roots modulo prime powers.
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.