Abstract
Many inequalities are difficult to discover but easy to prove, just as many proofs are difficult to motivate but easy to follow. Ignoring the problems of discovery and motivation, we give simple new proofs for a variety of important inequalities.
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. Beckenbach and Richard Bellman, Inequalities. Springer-Verlag, Berlin, 1961.
Ky Fan, Olga Taussky, and John Todd, Discrete analogs of inequalities of Wirtinger. Monatsh. f. Math 59 (1955), 73–90.
G.H. Hardy, J.E. Littlewood, and G. Pólya, Inequalities. Cambridge Univ. Press, London and New York, 1952.
R.M. Redheffer, Recurrent Inequalities. Proc. Lond. Math. Soc. 17 (1967), 683–699.
The William Lowell Putnam Mathematical Competition. Amer. Math. Monthly 72 (1965), 732–739.
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
Redheffer, R.M. (1983). Easy Proofs of Hard 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-0348-6290-5_8
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-6292-9
Online ISBN: 978-3-0348-6290-5
eBook Packages: Springer Book Archive