Problem 2
For a polynomial and a positive integer , define as the number of positive integer pairs such that and is divisible by . Determine all polynomials with integer coefficients such that for all positive integers .
Step 6 of 6: Count the exact solutions and match the bound; the case c=-1 mirrors it
Detailed analysis
For no pair satisfies (as ), so for all . For , the pairs with , , number exactly when this is nonnegative, which equals once ; so . Requiring gives , i.e. , and this bound is also sufficient. Replacing by leaves every unchanged (since ), so the family works exactly when , i.e. , completing the classification.