Library / /50 of 151
, 2015
Algebra Difficulty 6.0 National Olympiad Prove it Hungary
Let p(x) be a polynomial of degree at most n such that p(x)≤x1 for 0<x≤1. Prove that p(0)≤2n+1.
(5 pont)
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.