Olympiad problems

2016 Romanian Masters in Mathematic, 1

Let $ABC$ be a triangle and let $D$ be a point on the segment $BC, D\neq B$ and $D\neq C$. The circle $ABD$ meets the segment $AC$ again at an interior point $E$. The circle $ACD$ meets the segment $AB$ again at an interior point $F$. Let $A'$ be the reflection of $A$ in the line $BC$. The lines $A'C$ and $DE$ meet at $P$, and the lines $A'B$ and $DF$ meet at $Q$. Prove that the lines $AD, BP$ and $CQ$ are concurrent (or all parallel).

2020 Romanian Master of Mathematics, 4

Tags: function , algebra , RMM , RMM 2020

Let $\mathbb N$ be the set of all positive integers. A subset $A$ of $\mathbb N$ is [i]sum-free[/i] if, whenever $x$ and $y$ are (not necessarily distinct) members of $A$, their sum $x+y$ does not belong to $A$. Determine all surjective functions $f:\mathbb N\to\mathbb N$ such that, for each sum-free subset $A$ of $\mathbb N$, the image $\{f(a):a\in A\}$ is also sum-free. [i]Note: a function $f:\mathbb N\to\mathbb N$ is surjective if, for every positive integer $n$, there exists a positive integer $m$ such that $f(m)=n$.[/i]

2015 Romanian Master of Mathematics, 1

Tags: number theory , relatively prime , RMM , RMM 2015

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

2020 Romanian Masters In Mathematics, 5

Tags: analytic geometry , combinatorics , RMM , RMM 2020

A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points. Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.

2017 Romanian Masters In Mathematics, 2

Tags: algebra , polynomial , RMM , RMM 2017

Determine all positive integers $n$ satisfying the following condition: for every monic polynomial $P$ of degree at most $n$ with integer coefficients, there exists a positive integer $k\le n$ and $k+1$ distinct integers $x_1,x_2,\cdots ,x_{k+1}$ such that \[P(x_1)+P(x_2)+\cdots +P(x_k)=P(x_{k+1})\]. [i]Note.[/i] A polynomial is [i]monic[/i] if the coefficient of the highest power is one.

2020 Romanian Masters In Mathematics, 1

Tags: geometry , RMM , RMM 2020

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

2021 Romanian Master of Mathematics, 3

Tags: combinatorics , RMM

A number of $17$ workers stand in a row. Every contiguous group of at least $2$ workers is a $\textit{brigade}$. The chief wants to assign each brigade a leader (which is a member of the brigade) so that each worker’s number of assignments is divisible by $4$. Prove that the number of such ways to assign the leaders is divisible by $17$. [i]Mikhail Antipov, Russia[/i]

2015 Romania Masters in Mathematics, 6

Tags: RMM , rectangle , combinatorial geometry , combinatorics , RMM 2015

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

2020 Romanian Master of Mathematics Shortlist, A1

Tags: algebra , polynomial , RMM , RMM 2020 , RMM Shortlist

Prove that for all sufficiently large positive integers $d{}$, at least $99\%$ of the polynomials of the form \[\sum_{i\leqslant d}\sum_{j\leqslant d}\pm x^iy^j\]are irreducible over the integers.

2015 Romania Masters in Mathematics, 2

Tags: combinatorics , RMM , combinatorial geometry , RMM 2015

For an integer $n \geq 5,$ two players play the following game on a regular $n$-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 $n$-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 $n$ does the player making the first move have a winning strategy?

Kvant 2020, M2604

Tags: geometry , RMM , RMM 2020

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

2017 Romanian Masters In Mathematics, 4

Tags: symmetry , graph , function , Quadratic , RMM

In the Cartesian plane, let $G_1$ and $G_2$ be the graphs of the quadratic functions $f_1(x) = p_1x^2 + q_1x + r_1$ and $f_2(x) = p_2x^2 + q_2x + r_2$, where $p_1 > 0 > p_2$. The graphs $G_1$ and $G_2$ cross at distinct points $A$ and $B$. The four tangents to $G_1$ and $G_2$ at $A$ and $B$ form a convex quadrilateral which has an inscribed circle. Prove that the graphs $G_1$ and $G_2$ have the same axis of symmetry.

2020 Romanian Master of Mathematics Shortlist, C1

Tags: combinatorics , grid , RMM , RMM 2020 , RMM Shortlist

Bethan is playing a game on an $n\times n$ grid consisting of $n^2$ cells. A move consists of placing a counter in an unoccupied cell $C$ where the $2n-2$ other cells in the same row or column as $C$ contain an even number of counters. After making $M$ moves Bethan realises she cannot make any more moves. Determine the minimum value of $M$. [i]United Kingdom, Sam Bealing[/i]

2016 Romanian Master of Mathematics, 1

Tags: geometry , RMM , RMM 2016

Let $ABC$ be a triangle and let $D$ be a point on the segment $BC, D\neq B$ and $D\neq C$. The circle $ABD$ meets the segment $AC$ again at an interior point $E$. The circle $ACD$ meets the segment $AB$ again at an interior point $F$. Let $A'$ be the reflection of $A$ in the line $BC$. The lines $A'C$ and $DE$ meet at $P$, and the lines $A'B$ and $DF$ meet at $Q$. Prove that the lines $AD, BP$ and $CQ$ are concurrent (or all parallel).

2015 Romanian Master of Mathematics, 2

Tags: combinatorics , RMM , combinatorial geometry , RMM 2015

For an integer $n \geq 5,$ two players play the following game on a regular $n$-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 $n$-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 $n$ does the player making the first move have a winning strategy?

2015 Postal Coaching, Problem 3

Tags: number theory , relatively prime , RMM , RMM 2015

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?