Let p(x) be a monic integer polynomial (polynomial with integer coefficients and leading coefficient 1) of degree n that has n real roots, α1,α2,…,αn. Let q(x) be an arbitrary integer polynomial that is relatively prime to polynomial p(x) (i.e. it's not possible to find an integer polynomial different from constant 1 and −1 that divides both p(x) and q(x)). Prove that i=1∑nq(αi)≥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.