  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.
