2000 OIM Problems/Problem 6

Revision as of 15:18, 13 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == A convex hexagon is called "''pretty''" if it has four diagonals of length 1, whose ends include all the vertices of the hexagon. 1. Given any number <math>k</m...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A convex hexagon is called "pretty" if it has four diagonals of length 1, whose ends include all the vertices of the hexagon.

1. Given any number $k$, greater than 0 and less than or equal to 1, find a pretty hexagon of area $k$.

2. Show that the area of any pretty hexagon is less than 3/2.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

https://www.oma.org.ar/enunciados/ibe15.htm