Abstract
In this paper, we give a summary of a new method for proving inequalities. For the sake of brevity, we omit the full proofs of the main theorems; however, we do give their principal ideas, along with a number of applications. For details, the reader is referred to [2], [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.F. Beckeribach and R. Bellman, Inequalities. J. Springer Verlag, Berlin, 1971.
A. Kovačec, Über den algorithmischen Nachweis von Ungleichungen I. Monaten, Math. 92 (1981), 19–35.
A. Kovačec, Über den algorithmischen Nachweis von Ungleichungen II, Submitted to: J. Reine Angew. Math.
A.W. Marshall and I. Olkin, Inequalities; Theory of Majorization and its Applications. Academic Press, 1979.
A.W. Marshall and I. Olkin, Inequalities via majorization — an introduction, pp. — in E.F. Beckenbach (ed.), General Inequalities 3. Birkhauser Verlag, Basel, Stuttgart, New York, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Basel AG
About this chapter
Cite this chapter
Kovačec, A. (1983). On an Algorithmic Method to Prove Inequalities. In: Beckenbach, E.F., Walter, W. (eds) General Inequalities 3. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 64. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-6290-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-0348-6290-5_5
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-6292-9
Online ISBN: 978-3-0348-6290-5
eBook Packages: Springer Book Archive