1. A quadrilateral ABCD is inscribed in a circle with centre O. Its diagonals meet at M. ‘The cireumenrcle of ABM intersects the sides AD and BU at N mk respectively. Prove that the areas of NOMD and KOMC are equal. Solution. Let w; be the circumcircle of ACD and ws the circumcitcle of ABM. ‘The angles ZUAL and ZDBC are subtended by the same are of wi and therefore equal. It follows that the chords MAN and MK of we subtending these angles are equal. ‘The segments OD and OC are equal as radit of wy. Let be the tangent tow; at D. The angle between ¢ and AD is equal to ZABD (since it equals half of the are AD) and therefore to ZMN'D (because the quadrilateral ABMN is cyclic). Thus MN’ is parallel te {and consequently perpendicular to OD, Similarly, MK 1s perpendicular to OC. It follows now that the quadrilaterals NOMD and KOMC have equal area since their respective diagonals are equal and in bot quadrilaterals the diagonals are perpendicular. 2. ‘The numbers a1, as, -... aiqq are a permutation of the numbers 1, 2... 100. Let 5% Se =a Fan, ..., S90 =i Fa +...+eo0. What maximum tnumbers S1.S2, -... Sion? The answer is Gl Solution, We add initial term Sy = 0 to the sequence Si, So, .... Siay and consider all the terms Sin < Sny +. that are perfect squares: So, = mi (in particular, ng = mo =O). Since S}o0 = 5050 < 72% all the numbers mg do not exceed 71. If mii =my +1 the difference Soya, — Spx = 2mm +1 is odd, and an odd number must occur among the numbers dn,4.1, ---s dnaqu- There are only 5) odd numbers less than 100, 80 at most 50 differences me4i —~ ime equal I. If there 18 61 perfect squares in the original sequence then mgr = (angi — mao) + (ma0 — m0) +--+ (m1 — mo) > 50+ IL -2= 72, a contradiction It remains to give an example of sequence containing 60 perfect squares. Let a; = 2i—1 for 1 4 and n such that m—n > 2. ‘Chen replacing mun by m=1 and n-+1 decreases our sum (since ("7) + (5) — (")!) —(°") = (5!) (4) > 0). Thus the minimum value of $ 1s attained for the set of k; where the dilfereice of every two numbers does not exceed 1. Such set is obviously unique and consists of 30 numbers equal to 30 and 30 numbers equal, to 29. Now the total number of quadruples served by all 60 towns is at least 30+ (%) + 30+ (2). It is easy to check however that this number is greater than 3 ("!), that is, thrice the number of all quadruples. Therefore there 1s a quadruple served by four towns, q.e.d