Distances in rectangles and parallelograms

DOI10.4171/EM/352MaRDI QIDQ670713zbMATH OpenOpenAlexWikidataFDO

Authors D. Ş. Marinescu, Monea Mihai, G. Wanner

Publication date 20 March 2019

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/em/352

zbMATH Keywords

Apollonius' theoremextremal rectangleparallelogram identity

Mathematics Subject Classification ID

Elementary problems in Euclidean geometries (51M04) Inequalities and extremum problems in real or complex geometry (51M16)

Review text

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.

Recommendations

• Note on rectangles with vertices on prescribed circles
• Generalized Popoviciu's problem
• The parallelogram with maximum perimeter for given diagonals is the rhombus -- a proof without words and a corollary
• Proof without words: the parallelogram with maximum perimeter for given diagonals is the rhombus
• scientific article; zbMATH DE number 6675698

Cites work

• Extreme values for the area of rectangles with vertices on concentrical circles
• Note on rectangles with vertices on prescribed circles

Cited in

(2)

• Extreme values for the area of rectangles with vertices on concentrical circles
• Note on rectangles with vertices on prescribed circles

This page was built for publication: Distances in rectangles and parallelograms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670713)