ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an integer d≥2d\geq2. For a monic polynomial f(x)∈Z[x]f(x)\in\mathbb Z[x], consider integers bb such that whenever p2p^2 divides bb, the prime pp does not divide the discriminant of ff. The polynomial congruence conjecture. For every ϵ>0\epsilon>0, there is a constant N(d,ϵ)N(d,\epsilon) such that there are at most N(d,ϵ)N(d,\epsilon) integers nn with

0≤n<b1−ϵ,f(n)≡0(modb).0\le n<b^{1-\epsilon},\qquad f(n)\equiv0\pmod b.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.