IMC 2008, Day 2, Problem 4
Let be the ring of polynomials with integer coefficients, and let be nonconstant polynomials such that divides in . Prove that if the polynomial has at least distinct integer roots, then the degree of is greater than .
Original from the official PDF
![Let Z[x] be the ring of polynomials with integer coefficients, and let f (x), g(x) ∈ Z[x] be nonconstant polynomials such that g(x) divides f (x) in Z[x]. Prove that if the polynomial f (x)−2008 has at least 81 distinct integer roots, then the degree of g(x) is greater than 5.](/archive/imc/imc-2008-d2-p4.png)
This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. Let where is a polynomial with integer coefficients.
Let be distinct integer roots of the polynomial . Then for , Hence, are integer divisors of 2008.
Since are primes) then 2008 has exactly 16 distinct integer divisors (including the negative divisors as well). By the pigeonhole principle, there are at least 6 equal numbers among (because ). For example, . So is a nonconstant polynomial which has at least 6 distinct roots (namely ). Then the degree of the polynomial is at least 6.
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?
Moves you mark come back sooner in triage.