Maths Olympiad Prep

Library / /4 of 6

Geometry Difficulty 5.7 AIME, harder Prove it Romania

Let ABCDABCD be a convex quadrilateral and let PP be a point inside such that APB+CPD=APD+BPC\angle APB + \angle CPD = \angle APD + \angle BPC, PAD+PCD=PAB+PCB\angle PAD + \angle PCD = \angle PAB + \angle PCB and PDC+PBC=PDA+PBA\angle PDC + \angle PBC = \angle PDA + \angle PBA. Prove that the quadrilateral ABCDABCD is circumscriptible.

Flavian Georgescu

Solution

Notice that PDC+PBC=PDA+PBA\angle PDC + \angle PBC = \angle PDA + \angle PBA implies PDA+PBA=(B+D)/2\angle PDA + \angle PBA = (B + D)/2. In the same manner, PAB+PCB=(A+C)/2\angle PAB + \angle PCB = (A + C)/2. Add the last equalities to obtain 180=(A+B+C+D)/2=(PBA+PAB)+PDA+PCB=(180APB)+PDA+PCB180^\circ = (A + B + C + D)/2 = (\angle PBA + \angle PAB) + \angle PDA + \angle PCB = (180^\circ - \angle APB) + \angle PDA + \angle PCB, and notice that PDA+PCB=APB\angle PDA + \angle PCB = \angle APB shows that circles APDAPD and BPCBPC are tangent at PP.

Let (O1,R1)(O_1, R_1), (O2,R2)(O_2, R_2), (O3,R3)(O_3, R_3), (O4,R4)(O_4, R_4) be the circles PABPAB, PBCPBC, PCDPCD and PDAPDA respectively. Recall that points PP, O1O_1, O3O_3 are collinear, and similarly, points PP, O2O_2, O4O_4 are collinear. Further, O2O1O4+O2O3O4=180APB+180CPD=180\angle O_2O_1O_4 + \angle O_2O_3O_4 = 180^\circ - \angle APB + 180^\circ - \angle CPD = 180^\circ, so O1O2O3O4O_1O_2O_3O_4 is a cyclic quadrilateral; let RR be its circumradius.

By Sine Law,
2R=O1O3sinO2=O2O4sinO1    R1+R3sinBPC=R2+R4sinAPB, 2R = \frac{O_1O_3}{\sin O_2} = \frac{O_2O_4}{\sin O_1} \implies \frac{R_1 + R_3}{\sin \angle BPC} = \frac{R_2 + R_4}{\sin \angle APB},
then ABsinAPB+CDsinCPD=2(R1+R3)    AB+CD=2(R1+R3)sinAPB\frac{AB}{\sin \angle APB} + \frac{CD}{\sin \angle CPD} = 2(R_1 + R_3) \implies AB + CD = 2(R_1 + R_3) \sin \angle APB. Similarly, BC+DA=2(R2+R4)sinBPCBC + DA = 2(R_2 + R_4) \sin \angle BPC. All the above lead to AB+CD=BC+DAAB + CD = BC + DA, hence the claim.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.