✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
When doing this, we obtain lower bounds for the solutions of some special rational equations.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this study, the refinements of Maclaurin’s and Newton’s inequalities are given.
📊
Key Findings & Data:These refinements are obtained by applying the results on optimality conditions of abstract convex functions.
💡
Conclusion & Impact:When doing this, we obtain lower bounds for the solutions of some special rational equations.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
In this study, the refinements of Maclaurin’s and Newton’s inequalities are given. These refinements are obtained by applying the results on optimality conditions of abstract convex functions. When doing this, we obtain lower bounds for the solutions of some special rational equations.
🔖
Cite This Article
TINAZTEPE, G., TINAZTEPE, R. (2022). A refinement of Newton and Maclaurin inequalities through abstract convexity. Turkish Journal of Mathematics, Cilt: 46 - Sayı: 3, 699–709. https://ajindex.com/articles/607065