# Max/Min Puzzles in Geometry

• Published in 2022
In the collections
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.

### BibTeX entry

@article{MaxMinPuzzlesinGeometry,
title = {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.},
url = {http://arxiv.org/abs/2201.02050v4 http://arxiv.org/pdf/2201.02050v4},
year = 2022,
author = {James M Parks},
comment = {},
urldate = {2022-02-16},
archivePrefix = {arXiv},
eprint = {2201.02050},
primaryClass = {math.HO},
collections = {geometry,puzzles}
}