CEMC Banner

Problem of the Month
Problem 2: November 2023

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.

  1. In each of parts (i) through (v), find four points on the loop that are the vertices of a square.

    1. the circle with equation x2+y2=1

    2. the ellipse with equation x2a2+y2b2=1 where a and b are fixed positive real numbers

    3. the polygon with vertices (1,0), (12,32), (12,32), (1,0), (12,32), and (12,32)

    4. the boundary of the region enclosed by the parabola with equation y=12x2+16x+169 and the line with equation y=x

    5. the boundary of the region enclosed by the parabolas with equations y=x2+23x43 and y=x2+23x+43

  2. Show that for every acute triangle there are exactly three squares whose vertices all lie on the perimeter of the triangle.