When is a polygon circumscribing a regular polygon again regular?
Let \({\mathcal A}\) be a regular \(n\)-gon with vertices \(A_ 1,A_ 2,\ldots,A_ n\) and edge-length =1, which is inscribed in \({\mathcal P}\), an \(n\)-gon with vertices \(P_ 1,P_ 2,\ldots,P_ n\), in such a way that \(A_ 1P_ 1=A_ 2P_ 2=\cdots=A_ nP_ n\). The main results of this paper are given in the following theorem. Theorem 1. If \(n=3\) or 4 or \(\geq 7\) and odd, then \({\mathcal P}\) must be regular; while if \(n\geq 6\) is even, then \({\mathcal P}\) may be nonregular; for \(n\geq 8\), \({\mathcal P}\) has only two sizes of angles and these alternate, and the sides of \({\mathcal P}\) also alternate in size.
- A characterization of regular n-gons whose pairs of diagonals are either congruent or incommensurable
- Loops of Regular Polygons
- On the existence of inscribed polygons
- scientific article; zbMATH DE number 4067738 (Why is no real title available?)
- A unifying generalization of Turnbull's theorem
- Crop circles and Euclidean geometry
- Two hinged regular \(n\)-sided polygons
- The magic of cyclic polygons
- Pantographic polygons
- Inscribed circle of general semi-regular polygon and some of its features
- Zur Gitterpunktüberdeckung durch reguläre n-Ecke mit ungerader Eckenzahl. (On lattice-point-coverings by regular n-gons with an odd number of vertices)
- scientific article; zbMATH DE number 7644067 (Why is no real title available?)
- Inscribing a regular \(m\)-gon in a regular \(n\)-gon
- Counting perpendicularly inscribed polygons that intersect a given side in an odd sided regular polygon
- Polygonal distances theorems for two regular polygons
This page was built for publication: When is a polygon circumscribing a regular polygon again regular?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367758)
