Book contents
- Frontmatter
- Note to the Reader
- Preface
- Contents
- 1 Transformations and their Iteration
- 2 Arithmetic and Geometric Means
- 3 Isoperimetric Inequality for Triangles
- 4 Isoperimetric Quotient
- 5 Colored Marbles
- 6 Candy for School Children
- 7 Sugar Rather Than Candy
- 8 Checkers on a Circle
- 9 Decreasing Sets of Positive Integers
- 10 Matrix Manipulations
- 11 Nested Triangles
- 12 Morley's Theorem and Napoleon's Theorem
- 13 Complex Numbers in Geometry
- 14 Birth of an IMO Problem
- 15 Barycentric Coordinates
- 16 Douglas-Neumann Theorem
- 17 Lagrange Interpolation
- 18 The Isoperimetric Problem
- 19 Formulas for Iterates
- 20 Convergent Orbits
- 21 Finding Roots by Iteration
- 22 Chebyshev Polynomials
- 23 Sharkovskii's Theorem
- 24 Variation Diminishing Matrices
- 25 Approximation by Bernstein Polynomials
- 26 Properties of Bernstein Polynomials
- 27 Bézier Curves
- 28 Cubic Interpolatory Splines
- 29 Moving Averages
- 30 Approximation of Surfaces
- 31 Properties of Triangular Patches
- 32 Convexity of Patches
- Appendix A Approximation
- Appendix B Limits and Continuity
- Appendix C Convexity
- Bibliography
- Hints and Solutions
- Index
Preface
- Frontmatter
- Note to the Reader
- Preface
- Contents
- 1 Transformations and their Iteration
- 2 Arithmetic and Geometric Means
- 3 Isoperimetric Inequality for Triangles
- 4 Isoperimetric Quotient
- 5 Colored Marbles
- 6 Candy for School Children
- 7 Sugar Rather Than Candy
- 8 Checkers on a Circle
- 9 Decreasing Sets of Positive Integers
- 10 Matrix Manipulations
- 11 Nested Triangles
- 12 Morley's Theorem and Napoleon's Theorem
- 13 Complex Numbers in Geometry
- 14 Birth of an IMO Problem
- 15 Barycentric Coordinates
- 16 Douglas-Neumann Theorem
- 17 Lagrange Interpolation
- 18 The Isoperimetric Problem
- 19 Formulas for Iterates
- 20 Convergent Orbits
- 21 Finding Roots by Iteration
- 22 Chebyshev Polynomials
- 23 Sharkovskii's Theorem
- 24 Variation Diminishing Matrices
- 25 Approximation by Bernstein Polynomials
- 26 Properties of Bernstein Polynomials
- 27 Bézier Curves
- 28 Cubic Interpolatory Splines
- 29 Moving Averages
- 30 Approximation of Surfaces
- 31 Properties of Triangular Patches
- 32 Convexity of Patches
- Appendix A Approximation
- Appendix B Limits and Continuity
- Appendix C Convexity
- Bibliography
- Hints and Solutions
- Index
Summary
Transformation and iteration are two of the most basic notions in mathematics.
The three parts of this book discuss a variety of transformations and their iterations, arranged in order of sophistication. Chapters one through nineteen discuss iterations in elementary mathematics. Most problems in this part come from mathematical olympiads of different countries, many from China, drawn largely from the first author's extensive experience as coach of the Chinese delegation at the International Mathematical Olympiads (IMO).
We give special attention to transformations with a smoothing property. A variety of measures of smoothness occurs in our discussions. For example, for ordered n-tuples (a1, a2, …, an) we have occasion to consider the difference maxi{ai} - maxi{ai} or the number of sign changes in the sequence; these can be regarded as measures of smoothness. Equilateral triangles can be considered the smoothest of all triangles. Similarly, the regular n-gon can be regarded as the smoothest of all n-sided polygons. In the set of all curve segments having given initial and terminal points, it is reasonable to identify the line segment joining these two points as the smoothest. Circles are considered the smoothest of all closed curves.
Two theorems contained in the first part should be spotlighted. The first (in Chapter 16) is the beautiful theorem discovered by Douglas and Neumann independently in the early 1940's; it gives a process for constructing a regular n-gon from an arbitrary n-gon by means of a sequence of transformations.
- Type
- Chapter
- Information
- Over and Over Again , pp. ix - xiiPublisher: Mathematical Association of AmericaPrint publication year: 1997