A1 Let Q>0 denote the set of all positive rational numbers. Determine all functions f : Q>0 → Q>0 satisfying f (x2 f (y)2 ) = f (x)2 f (y) for all x, y ∈ Q>0
A2 Find all integers n ≥ 3 for which there exist real numbers a1 , a2 , . . . an+2 satisfying an+1 = a1 , an+2 = a2 and ai ai+1 + 1 = ai+2 , for i = 1, 2, . . . , n. Proposed by Patrik Bak, Slovakia
A3 Given any set S of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets F and G of S such that x∈F 1/x = x∈G 1/x; P P
(2) There exists a positive rational number r < 1 such that x∈F 1/x ̸= r for all finite subsets P F of S.
A4 Let a0 , a1 , a2 , . . . be a sequence of real numbers such that a0 = 0, a1 = 1, and for every n ≥ 2
there exists 1 ≤ k ≤ n satisfying an−1 + · · · + an−k an = . k Find the maximum possible value of a2018 − a2017 .
A5 Determine all functions f : (0, ∞) → R satisfying
1 y x+ f (y) = f (xy) + f x x for all x, y > 0.
A6 Let m, n ≥ 2 be integers. Let f (x1 , . . . , xn ) be a polynomial with real coefficients such that
x1 + · · · + xn f (x1 , . . . , xn ) = for every x1 , . . . , xn ∈ {0, 1, . . . , m − 1}. m
r r r r 3 a 3 b 3 c 3 d S= + + + , b+7 c+7 d+7 a+7
where a, b, c, d are nonnegative real numbers which satisfy a + b + c + d = 100.
Proposed by Evan Chen, Taiwan
– Combinatorics
C1 Let n ⩾ 3 be an integer. Prove that there exists a set S of 2n positive integers satisfying the following property: For every m = 2, 3, ..., n the set S can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality m.
C2 A site is any point (x, y) in the plane such that x and y are both positive integers less than or equal to 20. Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied √ site such that the distance between any two sites occupied by red stones is not equal to 5. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone. Find the greatest K such that Amy can ensure that she places at least K red stones, no matter how Ben places his blue stones. Proposed by Gurgen Asatryan, Armenia
C3 Let n be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of n + 1 squares in a row, numbered 0 to n from left to right. Initially, n stones are put into square 0, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with k stones, takes one of these stones and moves it to the right by at most k squares (the stone should say within the board). Sisyphus’ aim is to move all n stones to square n. Prove that Sisyphus cannot reach the aim in less than lnm lnm lnm lnm + + + ··· + 1 2 3 n turns. (As usual, ⌈x⌉ stands for the least integer not smaller than x. )
C4 An anti-Pascal triangle is an equilateral triangular array of numbers such that, except for the numbers in the bottom row, each number is the absolute value of the difference of the two
numbers immediately below it. For example, the following is an anti-Pascal triangle with four rows which contains every integer from 1 to 10. 4 2 6 5 7 1 8 3 10 9
Does there exist an anti-Pascal triangle with 2018 rows which contains every integer from 1 to 1 + 2 + 3 + · · · + 2018? Proposed by Morteza Saghafian, Iran
C5 Let k be a positive integer. The organising commitee of a tennis tournament is to schedule
the matches for 2k players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay 1 coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players’ stays. Determine this minimum cost.
C6 Let a and b be distinct positive integers. The following infinite process takes place on an initially empty board.
- If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by a and the other by b. - If no such pair exists, we write two times the number 0. Prove that, no matter how we make the choices in (i), operation (ii) will be performed only finitely many times. Proposed by Serbia.
C7 Consider 2018 pairwise crossing circles no three of which are concurrent. These circles subdi- vide the plane into regions bounded by circular edges that meet at vertices. Notice that there are an even number of vertices on each circle. Given the circle, alternately colour the vertices on that circle red and blue. In doing so for each circle, every vertex is coloured twice- once for each of the two circle that cross at that point. If the two colours agree at a vertex, then it is assigned that colour; otherwise, it becomes yellow. Show that, if some circle contains at least 2061 yellow points, then the vertices of some region are all yellow.
G1 Let Γ be the circumcircle of acute triangle ABC. Points D and E are on segments AB and AC respectively such that AD = AE. The perpendicular bisectors of BD and CE intersect minor arcs AB and AC of Γ at points F and G respectively. Prove that lines DE and F G are either parallel or they are the same line. Proposed by Silouanos Brazitikos, Evangelos Psychas and Michael Sarantis, Greece
G2 Let ABC be a triangle with AB = AC, and let M be the midpoint of BC. Let P be a point such that P B < P C and P A is parallel to BC. Let X and Y be points on the lines P B and P C, respectively, so that B lies on the segment P X, C lies on the segment P Y , and ∠P XM = ∠P Y M . Prove that the quadrilateral AP XY is cyclic.
G3 A circle ω with radius 1 is given. A collection T of triangles is called good, if the following con- ditions hold: - each triangle from T is inscribed in ω; - no two triangles from T have a common interior point. Determine all positive real numbers t such that, for each positive integer n, there exists a good collection of n triangles, each of perimeter greater than t.
G4 A point T is chosen inside a triangle ABC. Let A1 , B1 , and C1 be the reflections of T in BC, CA, and AB, respectively. Let Ω be the circumcircle of the triangle A1 B1 C1 . The lines A1 T , B1 T , and C1 T meet Ω again at A2 , B2 , and C2 , respectively. Prove that the lines AA2 , BB2 , and CC2 are concurrent on Ω. Proposed by Mongolia
G5 Let ABC be a triangle with circumcircle Ω and incentre I. A line ℓ intersects the lines AI, BI, and CI at points D, E, and F , respectively, distinct from the points A, B, C, and I. The perpendicular bisectors x, y, and z of the segments AD, BE, and CF , respectively determine a triangle Θ. Show that the circumcircle of the triangle Θ is tangent to Ω.
G6 A convex quadrilateral ABCD satisfies AB · CD = BC · DA. Point X lies inside ABCD so that
∠XAB = ∠XCD and ∠XBC = ∠XDA.
Prove that ∠BXA + ∠DXC = 180◦ .
Proposed by Tomasz Ciesla, Poland
G7 Let O be the circumcentre, and Ω be the circumcircle of an acute-angled triangle ABC. Let P be an arbitrary point on Ω, distinct from A, B, C, and their antipodes in Ω. Denote the circumcentres of the triangles AOP , BOP , and COP by OA , OB , and OC , respectively. The lines ℓA , ℓB , ℓC
perpendicular to BC, CA, and AB pass through OA , OB , and OC , respectively. Prove that the circumcircle of triangle formed by ℓA , ℓB , and ℓC is tangent to the line OP .
– Number Theory
N1 Determine all pairs (n, k) of distinct positive integers such that there exists a positive integer s for which the number of divisors of sn and of sk are equal.
N2 Let n > 1 be a positive integer. Each cell of an n × n table contains an integer. Suppose that the following conditions are satisfied: - Each number in the table is congruent to 1 modulo n. - The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to n modulo n2 . Let Ri be the product of the numbers in the ith row, and Cj be the product of the number in the j th column. Prove that the sums R1 + . . . Rn and C1 + . . . Cn are congruent modulo n4 .
N3 Define the sequence a0 , a1 , a2 , . . . by an = 2n + 2⌊n/2⌋ . Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the se- quence, as well as infinitely many of those which cannot be expressed in such a way.
N4 Let a1 , a2 , . . . be an infinite sequence of positive integers. Suppose that there is an integer N > 1 such that, for each n ≥ N , the number a1 a2 an−1 an + + ··· + + a2 a3 an a1 is an integer. Prove that there is a positive integer M such that am = am+1 for all m ≥ M . Proposed by Bayarmagnai Gombodorj, Mongolia
N5 Four positive integers x, y, z and t satisfy the relations
xy − zt = x + y = z + t.
Is it possible that both xy and zt are perfect squares?
N6 Let f : {1, 2, 3, . . . } → {2, 3, . . . } be a function such that f (m + n)|f (m) + f (n) for all pairs m, n of positive integers. Prove that there exists a positive integer c > 1 which divides all values of f.
N7 Let n ≥ 2018 be an integer, and let a1 , a2 , . . . , an , b1 , b2 , . . . , bn be pairwise distinct positive inte-
gers not exceeding 5n. Suppose that the sequence a1 a2 an , ,..., b1 b2 bn
