ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f∈Z[x]f\in \mathbb{Z}[x] be an irreducible polynomial of degree d≥2d\geq 2. Let Ff(n)F_f(n) be maximal such that there exists 1≤m≤n1\leq m\leq n with f(m)f(m) is divisible by a prime ≥Ff(n)\geq F_f(n). Equivalently, Ff(n)F_f(n) is the greatest prime divisor of ∏1≤m≤nf(m).\prod_{1\leq m\leq n}f(m). Estimate Ff(n)F_f(n). In particular, is it true that Ff(n)≫n1+cF_f(n)\gg n^{1+c} for some constant c>0c>0? Or even ≫nd\gg n^d?

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.