Subcontests
(6)Complex inequalities
Prove that if non-zero complex numbers α1,α2,α3 are distinct and noncollinear on the plane, and satisfy α1+α2+α3=0, then there holds
i=1∑3(∣αi∣∣αi+1−αi+2∣(∣αi+1∣1+∣αi+2∣1−∣αi∣2))≤0......(∗)
where α4=α1,α5=α2. Verify further the sufficient and necessary condition for the equality holding in (∗).
Connectedness Testing
Let k≤n be two positive integers. IMO-nation has n villages, some of which are connected by a road. For any two villages, the distance between them is the minimum number of toads that one needs to travel from one of the villages to the other, if the traveling is impossible, then the distance is set as infinite.Alice, who just arrived IMO-nation, is doing her quarantine in some place, so she does not know the configuration of roads, but she knows n and k. She wants to know whether the furthest two villages have finite distance. To do so, for every phone call she dials to the IMO office, she can choose two villages, and ask the office whether the distance between them is larger than, equal to, or smaller than k. The office answers faithfully (infinite distance is larger than k). Prove that Alice can know whether the furthest two villages have finite distance between them in at most 2n2/k calls.Proposed by usjl and Cheng-Ying Chang Easy Geo Regarding Euler Line
Let ABCD be a convex quadrilateral with pairwise distinct side lengths such that AC⊥BD. Let O1,O2 be the circumcenters of ΔABD,ΔCBD, respectively. Show that AO2,CO1, the Euler line of ΔABC and the Euler line of ΔADC are concurrent.(Remark: The Euler line of a triangle is the line on which its circumcenter, centroid, and orthocenter lie.)Proposed by usjl