olymmath

TR-MO 2018

Turkish Mathematical Olympiad 2018.

Other problems

Problem 1

Find all pairs (x,y)(x,y) of real numbers that satisfy, \begin{align*} x^2+y^2+x+y &= xy(x+y)-\frac{10}{27} |xy| & \leq \frac{25}{9}. \end{align*}

Problem 2

Let PP be a point in the interior of the triangle ABCABC . The lines APAP , BPBP , and CPCP intersect the sides BCBC , CACA , and ABAB at D,ED,E , and FF , respectively. A point QQ is taken on the ray [BE[BE such that E∈[BQ]E\in [BQ] and m(EDQ^)=m(BDF^)m(\widehat{EDQ})=m(\widehat{BDF}) . If BEBE and ADAD are perpendicular, and ∣DQ∣=2∣BD∣|DQ|=2|BD| , prove that m(FDE^)=60∘m(\widehat{FDE})=60^\circ .

Problem 3

A sequence a1,a2,…a_1,a_2,\dots satisfy ∑i=1na⌊ni⌋=n10,\sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10}, for every n∈Nn\in\mathbb{N} . Let cc be a positive integer. Prove that, for every positive integer nn , can−can−1n\frac{c^{a_n}-c^{a_{n-1}}}{n} is an integer.

Problem 4

In a triangle ABCABC , the bisector of the angle AA intersects the excircle that is tangential to side [BC][BC] at two points DD and EE such that D∈[AE]D\in [AE] . Prove that, ∣AD∣∣AE∣≤∣BC∣2∣DE∣2.\frac{|AD|}{|AE|}\leq \frac{|BC|^2}{|DE|^2}.

Problem 5

Let a1,a2,a3,a4a_1,a_2,a_3,a_4 be positive integers, with the property that it is impossible to assign them around a circle where all the neighbors are coprime. Let i,j,k∈{1,2,3,4}i,j,k\in\{1,2,3,4\} with i≠ji \neq j , j≠kj\neq k , and k≠ik\neq i . Determine the maximum number of triples (i,j,k)(i,j,k) for which (gcd(ai,aj))2∣ak.({\rm gcd}(a_i,a_j))^2|a_k.

Problem 6

Initially, there are 2018 distinct boxes on a table. In the first stage, Yazan and Bozan, starting with Yazan, take turns make 20162016 moves each, such that, in each move, the person whose turn selects a pair of boxes that is not written on the board, and writes the pair on the board.

In the second stage, Bozan enumerates the 40324032 pairs with numbers from 1,2,…,40321,2,\dots,4032 , in whichever order he wants, and puts kk balls in each boxes written contained in the kthk^{th} pair. Is there a strategy for Bozan that guarantees that the number of balls in each box are distinct?