olymmath

RMM 2015

Romanian Master of Mathematics 2015.

Day 1

Problem 1

  • Day 1

Does there exist an infinite sequence of positive integers a1,a2,a3,…a_{1}, a_{2}, a_{3}, \ldots such that ama_{m} and ana_{n} are coprime if and only if ∣m−n∣=1|m-n|=1 ? (Peru) Jorge Tipe

Answer, solutions and source

Problem 2

  • Day 1
  • Answer

For an integer n≥5n \geq 5, two players play the following game on a regular nn-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the nn-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of nn does the player making the first move have a winning strategy? (United Kingdom) Jeremy King

Answer, solutions and source

Problem 3

  • Day 1

A finite list of rational numbers is written on a blackboard. In an operation, we choose any two numbers a,ba, b, erase them, and write down one of the numbers

a+b,a−b,b−a,a×b,a/b( if b≠0),b/a( if a≠0).a+b, a-b, b-a, a \times b, a / b(\text { if } b \neq 0), b / a(\text { if } a \neq 0) .

Prove that, for every integer n>100n>100, there are only finitely many integers k≥0k \geq 0, such that, starting from the list

k+1,k+2,…,k+nk+1, k+2, \ldots, k+n

it is possible to obtain, after n−1n-1 operations, the value nn !. (United Kingdom) Alexander Betts

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Let ABCA B C be a triangle, let DD be the touchpoint of the side BCB C and the incircle of the triangle ABCA B C, and let JbJ_{b} and JcJ_{c} be the incentres of the triangles ABDA B D and ACDA C D, respectively. Prove that the circumcentre of the triangle AJbJcA J_{b} J_{c} lies on the bisectrix of the angle BACB A C. (Russia) Fedor Ivlev

Answer, solutions and source

Problem 5

  • Day 2

Let p≥5p \geq 5 be a prime number. For a positive integer kk we denote by R(k)R(k) the remainder of kk when divided by pp. Determine all positive integers a<pa<p such that

m+R(ma)>am+R(m a)>a

for every m=1,2,…,p−1m=1,2, \ldots, p-1. (Bulgaria) Alexander Ivanov

Answer, solutions and source

Problem 6

  • Day 2
  • Answer

Given a positive integer nn, determine the largest real number μ\mu satisfying the following condition: for every 4n4 n-point configuration CC in an open unit square UU, there exists an open rectangle in UU, whose sides are parallel to those of UU, which contains exactly one point of CC, and has an area greater than or equal to μ\mu. (Bulgaria) Nikolai Beluhov

Answer, solutions and source