IMC / 2018 / Problems / Day 2, P9
IMC 2018 · Day 2 · P9
very hardDetermine all pairs , of complex polynomials with leading coefficient 1 such that divides and divides .
(Proposed by Rodrigo Angelo, Princeton University and Matheus Secco, PUC, Rio de Janeiro)
Solution (official)
The answer is all pairs and , , where is a non-constant monic polynomial in and is the imaginary unit.
Notice that if and then and are coprime and the condition is equivalent with .
Lemma. If are monic polynomials such that is divisible by , then .
Proof. Assume for the sake of contradiction that there is a pair with . Among all these pairs, take the one with smallest sum and let be such pair. Without loss of generality, suppose that . Let be the polynomial such that Notice that a solution of the polynomial equation , in variable . By Vieta's formulas, the other solution is . By , the is indeed a polynomial, and because are monic, is also monic. Therefore the pair satisfies the conditions of the Lemma. Notice that , which contradicts the minimality of . This contradiction establishes the Lemma.
By the Lemma, we have that and therefore is a constant polynomial. If and are constant polynomials, we have . Assuming that , as and are monic, the leading coefficient of is 2 and the leading coefficient of is 1, which give us . Finally we have that and therefore , i.e or . It's easy to check that these pairs are indeed solutions of the problem.
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.