uniolympiads Ελληνικά

IMC 2007, Day 1, Problem 1

Let ff be a polynomial of degree 22 with integer coefficients. Suppose that f(k)f(k) is divisible by 55 for every integer kk. Prove that all coefficients of ff are divisible by 55.

Original from the official PDFLet f be a polynomial of degree 2 with integer coefficients. Suppose that f (k) is divisible by 5 for every integer k. Prove that all coefficients of f are divisible by 5.

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution 1. Let f(x)=ax2+bx+cf(x)=ax^2+bx+c. Substituting x=0x=0, x=1x=1 and x=−1x=-1, we obtain that 5∣f(0)=c5|f(0)=c, 5∣f(1)=(a+b+c)5|f(1)=(a+b+c) and 5∣f(−1)=(a−b+c)5|f(-1)=(a-b+c). Then 5∣f(1)+f(−1)−2f(0)=2a5|f(1)+f(-1)-2f(0)=2a and 5∣f(1)−f(−1)=2b5|f(1)-f(-1)=2b. Therefore 5 divides 2a2a, 2b2b and cc and the statement follows.

Solution 2. Consider f(x)f(x) as a polynomial over the 5-element field (i.e. modulo 5). The polynomial has 5 roots while its degree is at most 2. Therefore f≡0(mod5)f\equiv0\pmod5 and all of its coefficients are divisible by 5.

Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?