Difference between revisions of "2007 OIM Problems/Problem 6"
(Created page with "== Problem == Let <math>F</math> be the family of all convex hexagons <math>H</math> such that the opposite sides of <math>H</math> are parallel, and any three vertices of <ma...") |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | Let <math>F</math> be the family of all convex hexagons <math>H</math> such that the opposite sides of <math>H</math> are parallel, and any three vertices of <math>H</math> can be covered with a strip of width 1. Find the smallest real number <math>l</math> such that each of the hexagons of family <math>F</math> can be covered with a strip of width | + | Let <math>F</math> be the family of all convex hexagons <math>H</math> such that the opposite sides of <math>H</math> are parallel, and any three vertices of <math>H</math> can be covered with a strip of width 1. Find the smallest real number <math>l</math> such that each of the hexagons of family <math>F</math> can be covered with a strip of width <math>l</math>. |
'''Note:''' A strip of width <math>l</math> is the region of the plane included between two parallel lines that | '''Note:''' A strip of width <math>l</math> is the region of the plane included between two parallel lines that | ||
Latest revision as of 16:53, 14 December 2023
Problem
Let 
be the family of all convex hexagons 
such that the opposite sides of are parallel, and any three vertices of can be covered with a strip of width 1. Find the smallest real number 
such that each of the hexagons of family can be covered with a strip of width .
Note: A strip of width is the region of the plane included between two parallel lines that
are at a distance (including both parallel lines).
~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.
