Maths Olympiad Prep

Library / /111 of 151

, 2017

Algebra Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

Let f(x)f(x) and g(x)g(x) be nonzero polynomials such that the degree of f(x)f(x) is higher than that of g(x)g(x). Suppose that for infinitely many prime numbers pp, the polynomial pf(x)+g(x)pf(x)+g(x) also has a rational root. Show that f(x)f(x) has a rational root.

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.