Max/Min Puzzles in Geometry III

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Parks, James M
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910796479463424
author Parks, James M
author_facet Parks, James M
contents The first two installments of this series of papers dealt with the maximum area polygons: Parallelogram, Rectangle, Square or Equilateral Triangle, in given triangles. Minimum area polygons were also considered in the second paper on Equilateral Triangles. In this paper the puzzle will be turned the other way around. Given the regular unit polygons, a Square, Pentagon, or Hexagon, we searched for the smallest area triangle(s) which contains it. The Dynamic Software Sketchpad v5.10 BETA was used for all examples and figures throughout the work.
format Preprint
id arxiv_https___arxiv_org_abs_2202_11211
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Max/Min Puzzles in Geometry III
Parks, James M
History and Overview
51-08
The first two installments of this series of papers dealt with the maximum area polygons: Parallelogram, Rectangle, Square or Equilateral Triangle, in given triangles. Minimum area polygons were also considered in the second paper on Equilateral Triangles. In this paper the puzzle will be turned the other way around. Given the regular unit polygons, a Square, Pentagon, or Hexagon, we searched for the smallest area triangle(s) which contains it. The Dynamic Software Sketchpad v5.10 BETA was used for all examples and figures throughout the work.
title Max/Min Puzzles in Geometry III
topic History and Overview
51-08
url https://arxiv.org/abs/2202.11211