Distances in rectangles and parallelograms (Q670713)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distances in rectangles and parallelograms |
scientific article; zbMATH DE number 7039080
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distances in rectangles and parallelograms |
scientific article; zbMATH DE number 7039080 |
Statements
Distances in rectangles and parallelograms (English)
0 references
20 March 2019
0 references
The paper under review gives a short and elegant solution to a problem that appeared in the Monthly in 2004, and that attracted long solutions. The problem asks for the largest and smallest rectangle whose vertices lie on four concentric circles. It also solves an extension of a problem of Klamkin that appeared in several journals, and that consists of an inequality among the distances from an arbitrary point to the vertices of a given parallelogram.
0 references
Apollonius' theorem
0 references
parallelogram identity
0 references
extremal rectangle
0 references
