olymmath

RMM 2023

Romanian Master of Mathematics 2023.

Day 1

Problem 2

  • Day 1

Fix an integer n⩾3n \geqslant 3. Let S\mathcal{S} be a set of nn points in the plane, no three of which are collinear. Given different points A,B,CA, B, C in S\mathcal{S}, the triangle ABCA B C is nice for ABA B if Area (ABC)⩽Area⁡(ABX)(A B C) \leqslant \operatorname{Area}(A B X) for all XX in S\mathcal{S} different from AA and BB. (Note that for a segment ABA B there could be several nice triangles.) A triangle is beautiful if its vertices are all in S\mathcal{S} and it is nice for at least two of its sides.

Prove that there are at least 12(n−1)\frac{1}{2}(n-1) beautiful triangles.

Answer, solutions and source

Problem 3

  • Day 1
  • Answer

Let n⩾2n \geqslant 2 be an integer, and let ff be a 4n4 n-variable polynomial with real coefficients. Assume that, for any 2n2 n points (x1,y1),…,(x2n,y2n)\left(x_{1}, y_{1}\right), \ldots,\left(x_{2 n}, y_{2 n}\right) in the plane, f(x1,y1,…,x2n,y2n)=0f\left(x_{1}, y_{1}, \ldots, x_{2 n}, y_{2 n}\right)=0 if and only if the points form the vertices of a regular 2n2 n-gon in some order, or are all equal.

Determine the smallest possible degree of ff.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Given a triangle ABCA B C, let HH and OO be its orthocentre and circumcentre, respectively. Let KK be the midpoint of the line segment AHA H. Let further ℓ\ell be a line through OO, and let PP and QQ be the orthogonal projections of BB and CC onto ℓ\ell, respectively. Prove that KP+KQ≥BCK P+K Q \geq B C.

Answer, solutions and source

Problem 5

  • Day 2

Let P(x),Q(x),R(x)P(x), Q(x), R(x) and S(x)S(x) be non-constant polynomials with real coefficients such that P(Q(x))=R(S(x))P(Q(x))=R(S(x)). Suppose that the degree of P(x)P(x) is divisible by the degree of R(x)R(x). Prove that there is a polynomial T(x)T(x) with real coefficients such that P(x)=R(T(x))P(x)=R(T(x)).

Answer, solutions and source

Problem 6

  • Day 2

Let r,g,br, g, b be non-negative integers. Let Γ\Gamma be a connected graph on r+g+b+1r+g+b+1 vertices. The edges of Γ\Gamma are each coloured red, green or blue. It turns out that Γ\Gamma has

  • a spanning tree in which exactly rr of the edges are red,
  • a spanning tree in which exactly gg of the edges are green and
  • a spanning tree in which exactly bb of the edges are blue.

Prove that Γ\Gamma has a spanning tree in which exactly rr of the edges are red, exactly gg of the edges are green and exactly bb of the edges are blue.

Russia, Vasily Mokin

Answer, solutions and source