olymmath

KöMaL 2015 A634

    Let n≥2n\ge2 be a in integer and let f ⁣:R→[−1,1]f\colon \mathbb{R}\to[-1,1] be an nn times differentiable function. Show that the equation f(n)(x)=0f^{(n)}(x)=0 has at least n−1n-1 distinct solutions.

    Official text KöMaL. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2015/a634 · Tag Z9XSRTW0Z1 · Edit this page on GitHub · Keys: j next, k previous