Maths Olympiad Prep

Library / /82 of 151

, 2023

Algebra Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

Let p(x)p(x) be a monic integer polynomial (polynomial with integer coefficients and leading coefficient 1) of degree nn that has nn real roots, α1,α2,,αn\alpha_1, \alpha_2,\ldots, \alpha_n. Let q(x)q(x) be an arbitrary integer polynomial that is relatively prime to polynomial p(x)p(x) (i.e. it's not possible to find an integer polynomial different from constant 1 and 1-1 that divides both p(x)p(x) and q(x)q(x)). Prove that i=1nq(αi)n\sum\limits_{i=1}^{n} \big|q(\alpha_i)\big|\ge n.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.