Geometric inequalities. Methods of proving (Q516096)

From MaRDI portal
Revision as of 06:25, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Geometric inequalities. Methods of proving
scientific article

    Statements

    Geometric inequalities. Methods of proving (English)
    0 references
    0 references
    0 references
    20 March 2017
    0 references
    The book is divided into eight chapters, each of the chapters consists of more paragraphs. ``The goal of the book is to teach the reader new and classical methods for proving geometric inequalities.'' Chapter 1 is devoted to the applications of the triangle inequality and to the theorem on the length of the broken line, as a generalization of triangle inequality. Chapter 2 is devoted to the projection method, which ``is one of the fundamental methods applied in order to deal with geometric inequalities''. Some properties of convex polygon lying inside of another polygon are considered, a sufficient condition for comparison of lengths of two broken lines on the plane is proved, the problem of the inscribed polygons with the least perimeter is treated. Chapter 3 is devoted to the inequalities related to the areas of triangles, quadrilaterals, convex polygons etc. One of the methods of proving geometric inequalities is the use of vectors and their properties. In particular, the properties of the scalar product of two vectors (Chapter 4). In Chapter 5, the authors deduce many problems from trigonometric inequalities. Many problems are proved using the maximal (minimal) values of a quadratic polynomial. An important method of demonstration is based on modifications of trigonometric expressions. For this reason an section of this chapter is devoted to some identities related to triangles. In Chapter 6, selected problems related to the inequalities with radiuses of circles are proved. Among them, the most well-known inequalities \(R\geq 2r\), where \(R\) and \(r\) are the circumradius and inradius of a triangle. Problems with polygons, such that all of their vertices are the nodes of the integer lattice are considered. In Chapter 7, other methods are introduced to prove some inequalities: the complex numbers, the method of coordinates, the application of geometric transformations etc. Chapter 8 is devoted to geometric problems that can be solved applying geometric inequalities and is shown how algebraic inequalities can be proved using geometric inequalities. The book contains more than 1000 problems. The majority of them are non-standard problems and intended for mathematics competitions and Olympiads. Every chapter contains problems for self-study and solutions.
    0 references
    area
    0 references
    proving geometric inequalities
    0 references
    triangle inequality
    0 references
    trigonometric inequalities
    0 references

    Identifiers