Max/Min Puzzles in Geometry

Abstract

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is all vertices of the polygon are on the sides of the triangle. This concept will be generalized later to include wedged polygons.