IMC 2008 · Problem 3

Day 115th IMC · Blagoevgrad, Bulgaria

Statement

Let pp be a polynomial with integer coefficients and let a1<a2<⋯<aka_1 < a_2 < \dots < a_k be integers.

a) Prove that there exists a∈Za \in \mathbb{Z} such that p(ai)p(a_i) divides p(a)p(a) for all i=1,2,…,ki = 1, 2, \dots, k.

b) Does there exist an a∈Za \in \mathbb{Z} such that the product p(a1)⋅p(a2)⋅⋯⋅p(ak)p(a_1) \cdot p(a_2) \cdot \dots \cdot p(a_k) divides p(a)p(a)?

Official solution

Hidden so you can work on the problem first.