Muñoz-Fernández, Gustavo A.Sarantopoulos, YannisSeoane Sepúlveda, Juan Benigno2023-06-202023-06-2020080944-6532https://hdl.handle.net/20.500.14352/50212Given a trinomial of the form p(x) = ax(m) + bx(n) + c with a, b, c is an element of R, we obtain, explicitly, the best possible constant M.,,(x) in the inequality vertical bar p'(x)vertical bar <= M-m,M-n(x).parallel to p parallel to, where x is an element of [-1, 1] is fixed and parallel to p parallel to is the sup norm of p over [-1, 1]. This answers a question to an old problem, first studied by Markov, for a large family of trinomials. We obtain the mappings M-m,M-n(x) by means of classical convex analysis techniques, in particular, using the Krein-Milman approach.engjournal articlehttp://www.heldermann-verlag.de/jca/jca15/jca0740_b.pdfhttp://www.heldermann.de/restricted access519.6Bernstein and Markov inequaliestrinomialsextreme pointsAnálisis numérico1206 Análisis Numérico