This month’s problem is based on the following general question: If you draw a "loop" in the Cartesian plane, is it always possible to find four points on that loop that are the vertices of a square? For example, the diagram below has a loop (the solid line) and a square drawn (the dashed line) with its four vertices on the loop.
Although it is a bit informal, it should be sufficient to think of a "loop" as a curve that you could draw by starting your pencil somewhere on a page and moving the pencil around the page eventually ending up where it started. Such a loop could be "smooth" (like a circle), "jagged" (like a polygon), or some combination of the two.
In each of parts (i) through (v), find four points on the loop that are the vertices of a square.
the circle with equation
the ellipse with equation
the polygon with vertices
the boundary of the region enclosed by the parabola with equation
the boundary of the region enclosed by the parabolas with
equations
Show that for every acute triangle there are exactly three squares whose vertices all lie on the perimeter of the triangle.