## Problem of the Day #231: The Chocolate Shop
*November 5, 2011*

*Posted by Saketh in : potd , trackback*

Alex is visiting a chocolate shop with a rather unusual process for purchasing chocolate. He starts by selecting a slab of chocolate in the shape of any convex hexagon of area $1$.

The shopkeeper then selects three adjacent vertices of the hexagon and cuts off a triangle-shaped wedge of chocolate for Alex. What is the greatest amount of chocolate Alex can guarantee himself?

## Comments»

no comments yet - be the first?