Maths Olympiad Prep

Library / /16 of 151

, 2017

Geometry Difficulty 6.0 National Olympiad Prove it Hungary

Let AA and BB be two vertices of a convex polygon P\mathcal{P} with maximum distance from each other. Let the perpendicular bisector of the segment ABAB meet the boundary of P\mathcal{P} at points CC and DD. Show that the perimeter of P\mathcal{P} is less than 2(AB+CD)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.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.