olymmath

IOM 2016

International Olympiad of Metropolises 2016.

Other problems

Problem 1

Find all positive integers nn such that there exist nn consecutive positive integers whose sum is a perfect square.

Problem 2

Let a1,...,ana_1, . . . , a_n be positive integers satisfying the inequality ∑i=1n1an≤12\sum_{i=1}^{n}\frac{1}{a_n}\le \frac{1}{2} . Every year, the government of Optimistica publishes its Annual Report with n economic indicators. For each i=1,...,ni = 1, . . . , n ,the possible values of the i−thi-th indicator are 1,2,...,ai1, 2, . . . , a_i . The Annual Report is said to be optimistic if at least n−1n - 1 indicators have higher values than in the previous report. Prove that the government can publish optimistic Annual Reports in an infinitely long sequence.

Problem 3

Let A1A2...AnA_1A_2 . . . A_n be a cyclic convex polygon whose circumcenter is strictly in its interior. Let B1,B2,...,BnB_1, B_2, ..., B_n be arbitrary points on the sides A1A2,A2A3,...,AnA1A_1A_2, A_2A_3, ..., A_nA_1 , respectively, other than the vertices. Prove that B1B2A1A3+B2B3A2A4+...+BnB1AnA2>1\frac{B_1B_2}{A_1A_3}+ \frac{B_2B_3}{A_2A_4}+...+\frac{B_nB_1}{A_nA_2}>1 .

Problem 4

A convex quadrilateral ABCDABCD has right angles at AA and CC . A point EE lies on the extension of the side ADAD beyond DD so that ∠ABE=∠ADC\angle ABE =\angle ADC . The point KK is symmetric to the point CC with respect to point AA . Prove that ∠ADB=∠AKE\angle ADB =\angle AKE .

Problem 5

Let r(x)r(x) be a polynomial of odd degree with real coefficients. Prove that there exist only finitely many (or none at all) pairs of polynomials p(x)p(x) and q(x)q(x) with real coefficients satisfying the equation (p(x))3+q(x2)=r(x)(p(x))^3 + q(x^2) = r(x) .

Problem 6

In a country with nn cities, some pairs of cities are connected by one-way flights operated by one of two companies AA and BB . Two cities can be connected by more than one flight in either direction. An ABAB -word ww is called implementable if there is a sequence of connected flights whose companies' names form the word ww . Given that every ABAB -word of length 2n2^n is implementable, prove that every finite ABAB -word is implementable. (An ABAB -word of length kk is an arbitrary sequence of kk letters AA or BB ; e.g. AABAAABA is a word of length 44 .)