The number of perpendicularly inscribed polygons that intersect a given side in an odd sided regular polygon
Abstract
The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special cases are calculated via circulant matrices and the Binomial Theorem. A method for finding such polygons, based on Banach's Fixed Point Theorem, is also developed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.