Let be the smallest prime divisor of integer . Determine all polynomials with integer coefficients satisfying
for all integers for which .
Solution
The answer: .
We start with the case when . Let us take , where is prime: yields . Therefore, and (1). Now when increases the left hand side of (1) goes to , but right hand side goes to 1. Contradiction.
Now let and . Then again for we get and . If is sufficiently large we get that and which in turn yields . Thus, and (2).
If then for the left hand side of (2) is at least 3, while the right hand side of (2) is 2. If then for the left hand side of (2) is at most 1, while the right hand side of (2) is at least 2. Thus, and .
If then for we get , a contradiction.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.