olymmath

UA-UMO 2018

Ukrainian Mathematical Olympiad 2018.

Other problems

Problem 1

Find all triples of pairwise distinct positive integers (a,b,c)(a,b,c) , which satisfy the following conditions: 2a−12a-1 is divisible by bb , 2b−12b-1 is divisible cc and 2c−12c-1 is divisible by aa .

Proposed by Bohdan Rublyov

Problem 2

In acute-angled triangle ABCABC , AHAH is an altitude and AMAM is a median. Points XX and YY on lines ABAB and ACAC respectively are such that AX=XCAX=XC and AY=YBAY=YB . Prove that the midpoint of XYXY is equidistant from HH and MM .

Proposed by Danylo Khilko

Problem 3

Find all functions f:[0,+∞)↦[0,+∞)f:[0,+\infty) \mapsto [0,+\infty) , which for all nonnegative x,yx,y satisfy f(f(x)+f(y))=xyf(x+y)f(f(x)+f(y))=xyf(x+y) Proposed by Igor Voronovich

Problem 4

Two players - Andriy and Olesya play the following game. On a table there is a round cake, which is cut by one of the players into 2n2n ( n>1n>1 ) sectors (pieces), pairwise distinct in weights. Weight of each piece is known to both players. Then they take pieces according to the following rules. At first, Olesya takes 11 piece, then Andriy takes 22 pieces such that the remaining pieces form a sector. Then they in turns take 22 pieces such that after each turn the remaining pieces form a sector. In their last move, one of the players takes one last piece. Each of the players aims to get more of a cake than the opponent. For which nn can Olesya cut the cake such that she wins if in her first move she takes the smallest piece?

Proposed by Bohdan Rublyov

Problem 5

The squadron of 1010 powerful destroyers and 2020 small boats is about to attack the island. All ships are positioned on the straight line, and are equally spaced.

Two torpedo boats with 1010 torpedoes each want to protect the island. However, the first torpedo boat can shoot only 1010 successive boats, whereas the second one can shoot 1010 targets which are next by one. Note that they have to shoot at the same moment, so that some targets may be hit by both torpedoes.

What is the biggest number of destroyers that can avoid the torpedoes no matter which targets the torpedo boats choose?

Proposed by Bohdan Rublyov

Problem 6

The sequence (xn)(x_n) is given by x1=ax_1=a , xn+1=12(xn−1xn)x_{n+1}=\dfrac{1}{2}\left(x_n-\dfrac{1}{x_n}\right) . Prove that there is aa such that the sequence (xn)(x_n) has exactly 20182018 pairwise distinct elements. (If some element of the sequence is equal to 00 , it stops on that element)

Proposed by Andriy Hoholev

Problem 7

Given NN positive integers such that the greatest common divisors of all nonempty subsets of them are pairwise distinct. What is the smallest number of prime factors of the product of all NN numbers?

Proposed by Aleksandr Golovanov

Problem 8

Given an acute-angled triangle ABCABC , AA1AA_1 and CC1CC_1 are its angle bisectors, II is its incenter, MM and NN are the midpoints of AIAI and CICI . Points KK and LL in the interior of triangles AC1IAC_1I and CA1ICA_1I respectively are such that ∠AKI=∠CLI=∠AIC\angle AKI = \angle CLI = \angle AIC , ∠AKM=∠ICA\angle AKM = \angle ICA , ∠CLN=∠IAC\angle CLN = \angle IAC . Prove that the circumradii of triangles KILKIL and ABCABC are equal.

Proposed by Anton Trygub