Given a convex quadrilateral ABCD. The point A1 is on the boundary of ABCD such that the segment AA1 divides ABCD into two parts with equal areas. In the same way we define points B1, C1 and D1. It is known that the lengths of all segments AA1, BB1, CC1, and DD1 do not exceed 1. Prove that the area S(ABCD)<32.
Solution
Let O=AC∩BD; and, without loss of generality, BO≥DO, CO≥AO. If AB∥DC then 1≤DOBO=COAO≤1, whence BO=OD and ABCD is a parallelogram. Then by the problem condition AC≤1, BD≤1, hence S(ABCD)≤21AC⋅BD≤21<32.
Let now AB∦DC, and let M be the intersection point of the rays BA and CD; denote BC=b, ∠ABC=β, ∠DCB=γ. Then S=S(ABCD)<S(BMC), while S(BMC)=21MC⋅MBsin(β+γ)=21⋅sin(β+γ)bsinβ⋅sin(β+γ)bsinγ⋅sin(β+γ)==21⋅ctgβ+ctgγb2, hence S⋅(ctgβ+ctgγ)<2b2.(1) If A1∈[AB] and D1∈[CD] are the points such that S(BA1C)=21S=S(BD1C) then by the problem condition CA1≤1, BD1≤1. Thus CA12=b2+b2sin2βS2−2S⋅sinβcosβ=(b−bSctgβ)2+b2S2≤1, and, similarly, (b−bSctgγ)2+b2S2≤1. Then, in view of (1), 2≥b22S2+21(2b−bS(ctgβ+ctgγ))2>b22S2+21(2b−2b)2==b22S2+89b2≥21b2S2⋅89b2=3S. It follows that S<32.
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 and solution reproduced as published; topic and difficulty added by this site.