benchmarks.wiki / Public workspace

Omni-MATH / For integral m, let p(m) be the greatest prime divisor of m. By convention, we set p(±1)=1 and p(0)=∞. Find all polynomials f with integer coefficients such that the sequence …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For integral mm, let p(m)p(m) be the greatest prime divisor of m.m. By convention, we set p(±1)=1p(\pm 1) = 1 and p(0)=∞.p(0) = \infty. Find all polynomials ff with integer coefficients such that the sequence {p(f(n2))−2n}n≥0 \{p \left( f \left( n^2 \right) \right) - 2n \}_{n \geq 0} is bounded above. (In particular, this requires f(n2)≠0f \left (n^2 \right ) \neq 0 for n≥0.n \geq 0.)
Plain-text mathematical notation (without MathML)
For integral m, let p(m) be the greatest prime divisor of m. By convention, we set p(±1)=1 and p(0)=∞. Find all polynomials f with integer coefficients such that the sequence
{p(f(n²))−2n}_(n≥0) is bounded above. (In particular, this requires f(n²)≠0 for n≥0.)
Original LaTeX notation
For integral $m$, let $p(m)$ be the greatest prime divisor of $m.$ By convention, we set $p(\pm 1) = 1$ and $p(0) = \infty.$ Find all polynomials $f$ with integer coefficients such that the sequence
\[ \{p \left( f \left( n^2 \right) \right) - 2n \}_{n \geq 0}  \] is bounded above. (In particular, this requires $f \left (n^2 \right ) \neq 0$ for $n \geq 0.$)

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import