AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

2006 USAMO Problems/Problem 3

From AoPSWiki

Problem

For integral \displaystyle m, let \displaystyle p(m) be the greatest prime divisor of \displaystyle m. By convention, we set p(\pm 1)=1 and p(0)=\infty. Find all polynomials \displaystyle 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

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us