Max/Min Puzzles in Geometry
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912186486489088 |
|---|---|
| author | Parks, James M |
| author_facet | Parks, James M |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2201_02050 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Max/Min Puzzles in Geometry Parks, James M History and Overview 51-08 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. |
| title | Max/Min Puzzles in Geometry |
| topic | History and Overview 51-08 |
| url | https://arxiv.org/abs/2201.02050 |