There is a triangle being inscribed in a square.
Can the triangle cover up more than 50% of the square?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, recall that the area of a triangle is 2 1 b h where b denotes the length of the base and h the height. Keeping h fixed, we may increase b to increase the area of the triangle. Similarly, keeping b fixed, we may increase h to increase the area of the triangle. This shows that the vertices must lie along the boundary of the square.
Now, we claim that one vertex lies at the corner of the square. Suppose not. Then, pick any edge of the triangle. Consider the vertex not along this edge. By moving this vertex away from the edge, we may increase the height of the triangle, by the remarks above. Since a corner of the square will be the furthest distance from our selected edge, moving the opposite vertex to the corner of the square maximizes the area.
Now, let S be a square in the plane. Let s denote the length of the edges of S . Without loss of generality, we may suppose that S lies in the first quadrant with one vertex at the origin. Consider a triangle in S that maximizes area. By the above remarks, we may suppose that one vertex of the triangle lies at the origin.
By the above remarks on the construction of the triangle, b = s . Similarly, h = s . So the area of the triangle is 2 1 b h = 2 1 s 2 = 2 1 A r ( Square ) . (You may want to argue these points more carefully, but they can be argued by using the ideas of the first two paragraphs.)
Note that the second statement is not true: Let the vertices of the sqaure be ( 0 , 0 ) , ( 1 , 0 ) , ( 0 , 1 ) , and ( 1 , 1 ) . Let the vertices of the triangle be ( 0 , 0 ) , ( 1 , 0 )
and ( 2 1 , 1 ) . Then we still have A r ( △ ) = 2 1 A r ( □ ) .