Library / /33 of 151

, 2015

Algebra Difficulty 6.0 National Olympiad Prove it Hungary

Let $n\ge2$ be a in integer and let $f\colon \mathbb{R}\to[-1,1]$ be an $n$ times differentiable function. Show that the equation $f^{(n)}(x)=0$ has at least $n-1$ distinct solutions.
(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.