← All problems

The discriminant-controlled polynomial congruence conjecture

19 years old · documented by

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.

References
  1. Javier Cilleruelo and Andrew Granville, “Lattice points on circles, squares in arithmetic progressions and sumsets of squares”, arXiv:math/0608109 (2006).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.