Art of Problem Solving

2006 USAMO Problems/Problem 3: Difference between revisions

Ragnarok23 (talk | contribs)
No edit summary
Ragnarok23 (talk | contribs)
No edit summary
Line 1: Line 1:
== Problem ==
== Problem ==
For integral <math>m</math>, let <math>p(m)</math> be the greatest prime divisor of <math>m</math>. By convention, we set <math>p(\pm 1)=1</math> and <math>p(0)=\infty</math>. Find all polynomial <math>f</math> with integer coefficients such that the sequence
<math>(p(f(n^2))-2n)_{n\ge 0}</math>
is bounded above. (In particular, this requires <math>f(n^2)\neq 0</math> for <math>n\ge 0</math>)
== Solution ==
== Solution ==
== See Also ==
== See Also ==
*[[2006 USAMO Problems]]
*[[2006 USAMO Problems]]

Revision as of 11:03, 12 July 2006

Problem

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 polynomial $f$ with integer coefficients such that the sequence

$(p(f(n^2))-2n)_{n\ge 0}$

is bounded above. (In particular, this requires $f(n^2)\neq 0$ for $n\ge 0$)

Solution

See Also