Let f=aX2+bX+c∈Z[X] be a polynomial such that for every positive integer n, f(n) is a perfect square. Prove that f=g2 for some polynomial g∈Z[X].
Solution
The sequence xn=f(n+1)−f(n), n≥1, contains only integers. We have n→∞limxn=n→∞limf(n+1)+f(n)f(n+1)−f(n)=2a2a=a It follows that a is an integer, hence yn=f(n)−na∈Z for every n≥1. We have n→∞limyn=f(n)+nabn+c=2ab hence 2ab∈Z, and yn=2ab for any n≥n0. It follows f(n)=(an+d)2 for any n≥n0, and we get f=g2, where g=aX+d.
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.
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.