olymmath

TR-MO 1997 Problem 2

    Let FF be a point inside a convex pentagon ABCDEABCDE , and let a1a_{1} , a2a_{2} , a3a_{3} , a4a_{4} , a5a_{5} denote the distances from FF to the lines ABAB , BCBC , CDCD , DEDE , EAEA , respectively. The points F1F_{1} , F2F_{2} , F3F_{3} , F4F_{4} , F5F_{5} are chosen on the inner bisectors of the angles AA , BB , CC , DD , EE of the pentagon respectively, so that AF1=AFAF_{1} = AF , BF2=BFBF_{2} = BF , CF3=CFCF_{3} = CF , DF4=DFDF_{4} = DF and EF5=EFEF_{5} = EF . If the distances from F1F_{1} , F2F_{2} , F3F_{3} , F4F_{4} , F5F_{5} to the lines EAEA , ABAB , BCBC , CDCD , DEDE are b1b_{1} , b2b_{2} , b3b_{3} , b4b_{4} , b5b_{5} , respectively. Prove that a1+a2+a3+a4+a5≤b1+b2+b3+b4+b5a_{1} + a_{2} + a_{3} + a_{4} + a_{5} \leq b_{1} + b_{2} + b_{3} + b_{4} + b_{5}

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator tr-mo/1997/p2 · Tag K0K7MYJ64H · Edit this page on GitHub · Keys: j next, k previous