Let A and B be two vertices of a convex polygon P with maximum distance from each other. Let the perpendicular bisector of the segment AB meet the boundary of P at points C and D. Show that the perimeter of P is less than 2(AB+CD).
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.