MathLabs

Problem 2

For a polynomial PP and a positive integer nn, define PnP_n as the number of positive integer pairs (a,b)(a,b) such that a<b≤na<b\le n and ∣P(a)∣−∣P(b)∣|P(a)|-|P(b)| is divisible by nn. Determine all polynomials PP with integer coefficients such that Pn≤2021P_n\le2021 for all positive integers nn.
Step 3 of 6: P must be linear
deg⁡P=1\deg P=1
Detailed analysis

A constant PP fails immediately since then Pn=(n2)→∞P_n=\binom n2\to\infty. If deg⁡P≥2\deg P\ge2, then P(k)−P(1)≥kP(k)-P(1)\ge k for some large kk; taking n=P(k)−P(1)≥kn=P(k)-P(1)\ge k, the values P(1)P(1) and P(k)P(k) (both among P(1),…,P(n)P(1),\ldots,P(n) since k≤nk\le n) satisfy P(k)−P(1)=n≡0(modn)P(k)-P(1)=n\equiv0\pmod n, contradicting the lemma. Hence deg⁡P=1\deg P=1.