Found problems: 91
2019 Romanian Master of Mathematics, 2
Let $ABCD$ be an isosceles trapezoid with $AB\parallel CD$. Let $E$ be the midpoint of $AC$. Denote by $\omega$ and $\Omega$ the circumcircles of the triangles $ABE$ and $CDE$, respectively. Let $P$ be the crossing point of the tangent to $\omega$ at $A$ with the tangent to $\Omega$ at $D$. Prove that $PE$ is tangent to $\Omega$.
[i]Jakob Jurij Snoj, Slovenia[/i]
2015 Romanian Master of Mathematics, 5
Let $p \ge 5$ be a prime number. For a positive integer $k$, let $R(k)$ be the remainder when $k$ is divided by $p$, with $0 \le R(k) \le p-1$. Determine all positive integers $a < p$ such that, for every $m = 1, 2, \cdots, p-1$, $$ m + R(ma) > a. $$
Kvant 2019, M2556
Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero.
Can Amy prevent Bob’s win?
[i]Maxim Didin, Russia[/i]
2022 Dutch IMO TST, 4
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, 1
[b](a)[/b] Prove that every positive integer $n$ can be written uniquely in the form \[n=\sum_{j=1}^{2k+1}(-1)^{j-1}2^{m_j},\] where $k\geq 0$ and $0\le m_1<m_2\cdots <m_{2k+1}$ are integers.
This number $k$ is called [i]weight[/i] of $n$.
[b](b)[/b] Find (in closed form) the difference between the number of positive integers at most $2^{2017}$ with even weight and the number of positive integers at most $2^{2017}$ with odd weight.
2021 Romanian Master of Mathematics, 6
Initially, a non-constant polynomial $S(x)$ with real coefficients is written down on a board. Whenever the board contains a polynomial $P(x)$, not necessarily alone, one can write down on the board any polynomial of the form $P(C + x)$ or $C + P(x)$ where $C$ is a real constant. Moreover, if the board contains two (not necessarily distinct) polynomials $P(x)$ and $Q(x)$, one can write $P(Q(x))$ and $P(x) + Q(x)$ down on the board. No polynomial is ever erased from the board.
Given two sets of real numbers, $A = \{ a_1, a_2, \dots, a_n \}$ and $B = \{ b_1, \dots, b_n \}$, a polynomial $f(x)$ with real coefficients is $(A,B)$-[i]nice[/i] if $f(A) = B$, where $f(A) = \{ f(a_i) : i = 1, 2, \dots, n \}$.
Determine all polynomials $S(x)$ that can initially be written down on the board such that, for any two finite sets $A$ and $B$ of real numbers, with $|A| = |B|$, one can produce an $(A,B)$-[i]nice[/i] polynomial in a finite number of steps.
[i]Proposed by Navid Safaei, Iran[/i]
2020 Romanian Masters In Mathematics, 4
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]
2020 Romanian Master of Mathematics, 3
Let $n\ge 3$ be an integer. In a country there are $n$ airports and $n$ airlines operating two-way flights. For each airline, there is an odd integer $m\ge 3$, and $m$ distinct airports $c_1, \dots, c_m$, where the flights offered by the airline are exactly those between the following pairs of airports: $c_1$ and $c_2$; $c_2$ and $c_3$; $\dots$ ; $c_{m-1}$ and $c_m$; $c_m$ and $c_1$.
Prove that there is a closed route consisting of an odd number of flights where no two flights are operated by the same airline.
2018 Romanian Masters in Mathematics, 1
Let $ABCD$ be a cyclic quadrilateral an let $P$ be a point on the side $AB.$ The diagonals $AC$ meets the segments $DP$ at $Q.$ The line through $P$ parallel to $CD$ mmets the extension of the side $CB$ beyond $B$ at $K.$ The line through $Q$ parallel to $BD$ meets the extension of the side $CB$ beyond $B$ at $L.$ Prove that the circumcircles of the triangles $BKP$ and $CLQ$ are tangent .
2016 Romanian Masters in Mathematic, 4
Let $x$ and $y$ be positive real numbers such that: $x+y^{2016}\geq 1$. Prove that $x^{2016}+y> 1-\frac{1}{100}$
2017 Romanian Master of Mathematics, 1
[b](a)[/b] Prove that every positive integer $n$ can be written uniquely in the form \[n=\sum_{j=1}^{2k+1}(-1)^{j-1}2^{m_j},\] where $k\geq 0$ and $0\le m_1<m_2\cdots <m_{2k+1}$ are integers.
This number $k$ is called [i]weight[/i] of $n$.
[b](b)[/b] Find (in closed form) the difference between the number of positive integers at most $2^{2017}$ with even weight and the number of positive integers at most $2^{2017}$ with odd weight.
2019 Romanian Master of Mathematics, 1
Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero.
Can Amy prevent Bob’s win?
[i]Maxim Didin, Russia[/i]
2019 Romanian Masters In Mathematics, 3
Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths.
(Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.)
[i]Fedor Petrov, Russia[/i]
2024 Romanian Master of Mathematics, 6
A polynomial $P$ with integer coefficients is [i]square-free[/i] if it is not expressible in the form $P = Q^2R$, where $Q$ and $R$ are polynomials with integer coefficients and $Q$ is not constant. For a positive integer $n$, let $P_n$ be the set of polynomials of the form
$$1 + a_1x + a_2x^2 + \cdots + a_nx^n$$
with $a_1,a_2,\ldots, a_n \in \{0,1\}$. Prove that there exists an integer $N$ such that for all integers $n \geq N$, more than $99\%$ of the polynomials in $P_n$ are square-free.
[i]Navid Safaei, Iran[/i]
2018 Romanian Master of Mathematics, 2
Determine whether there exist non-constant polynomials $P(x)$ and $Q(x)$ with real coefficients satisfying
$$P(x)^{10}+P(x)^9 = Q(x)^{21}+Q(x)^{20}.$$
2021 Romanian Master of Mathematics, 4
Consider an integer \(n \ge 2\) and write the numbers \(1, 2, \ldots, n\) down on a board. A move consists in erasing any two numbers \(a\) and \(b\), then writing down the numbers \(a+b\) and \(\vert a-b \vert\) on the board, and then removing repetitions (e.g., if the board contained the numbers \(2, 5, 7, 8\), then one could choose the numbers \(a = 5\) and \(b = 7\), obtaining the board with numbers \(2, 8, 12\)). For all integers \(n \ge 2\), determine whether it is possible to be left with exactly two numbers on the board after a finite number of moves.
[i]Proposed by China[/i]
2020 Romanian Master of Mathematics, 1
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.
2020 Romanian Master of Mathematics Shortlist, N2
For a positive integer $n$, let $\varphi(n)$ and $d(n)$ denote the value of the Euler phi function at $n$ and the number of positive divisors of $n$, respectively. Prove that there are infinitely many positive integers $n$ such that $\varphi(n)$ and $d(n)$ are both perfect squares.
[i]Finland, Olli Järviniemi[/i]
2022 Dutch IMO TST, 4
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 Master of Mathematics, 2
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.
2016 Romanian Master of Mathematics, 5
A convex hexagon $A_1B_1A_2B_2A_3B_3$ it is inscribed in a circumference $\Omega$ with radius $R$. The diagonals $A_1B_2$, $A_2B_3$, $A_3B_1$ are concurrent in $X$. For each $i=1,2,3$ let $\omega_i$ tangent to the segments $XA_i$ and $XB_i$ and tangent to the arc $A_iB_i$ of $\Omega$ that does not contain the other vertices of the hexagon; let $r_i$ the radius of $\omega_i$.
$(a)$ Prove that $R\geq r_1+r_2+r_3$
$(b)$ If $R= r_1+r_2+r_3$, prove that the six points of tangency of the circumferences $\omega_i$ with the diagonals $A_1B_2$, $A_2B_3$, $A_3B_1$ are concyclic
2020 Romanian Master of Mathematics Shortlist, N1
Determine all pairs of positive integers $(m, n)$ for which there exists a bijective function \[f : \mathbb{Z}_m \times \mathbb{Z}_n \to \mathbb{Z}_m \times \mathbb{Z}_n\]such that the vectors $f(\mathbf{v}) + \mathbf{v}$, as $\mathbf{v}$ runs through all of $\mathbb{Z}_m \times \mathbb{Z}_n$, are pairwise distinct.
(For any integers $a$ and $b$, the vectors $[a, b], [a + m, b]$ and $[a, b + n]$ are treated as equal.)
[i]Poland, Wojciech Nadara[/i]
2017 Romanian Master of Mathematics, 5
Fix an integer $n \geq 2$. An $n\times n$ sieve is an $n\times n$ array with $n$ cells removed so that exactly one cell is removed from every row and every column. A stick is a $1\times k$ or $k\times 1$ array for any positive integer $k$. For any sieve $A$, let $m(A)$ be the minimal number of sticks required to partition $A$. Find all possible values of $m(A)$, as $A$ varies over all possible $n\times n$ sieves.
[i]Palmer Mebane[/i]
2024 Romanian Master of Mathematics, 5
Let $BC$ be a fixed segment in the plane, and let $A$ be a variable point in the plane not on the line $BC$. Distinct points $X$ and $Y$ are chosen on the rays $CA^\to$ and $BA^\to$, respectively, such that $\angle CBX = \angle YCB = \angle BAC$. Assume that the tangents to the circumcircle of $ABC$ at $B$ and $C$ meet line $XY$ at $P$ and $Q$, respectively, such that the points $X$, $P$, $Y$ and $Q$ are pairwise distinct and lie on the same side of $BC$. Let $\Omega_1$ be the circle through $X$ and $P$ centred on $BC$. Similarly, let $\Omega_2$ be the circle through $Y$ and $Q$ centred on $BC$. Prove that $\Omega_1$ and $\Omega_2$ intersect at two fixed points as $A$ varies.
[i]Daniel Pham Nguyen, Denmark[/i]
2021 Romanian Master of Mathematics, 5
Let \(n\) be a positive integer. The kingdom of Zoomtopia is a convex polygon with integer sides, perimeter \(6n\), and \(60^\circ\) rotational symmetry (that is, there is a point \(O\) such that a \(60^\circ\) rotation about \(O\) maps the polygon to itself). In light of the pandemic, the government of Zoomtopia would like to relocate its \(3n^2+3n+1\) citizens at \(3n^2+3n+1\) points in the kingdom so that every two citizens have a distance of at least \(1\) for proper social distancing. Prove that this is possible. (The kingdom is assumed to contain its boundary.)
[i]Proposed by Ankan Bhattacharya, USA[/i]