Found problems: 91
2017 Romanian Masters In Mathematics, 6
Let $ABCD$ be any convex quadrilateral and let $P, Q, R, S$ be points on the segments $AB, BC, CD$, and $DA$, respectively. It is given that the segments $PR$ and $QS$ dissect $ABCD$ into four quadrilaterals, each of which has perpendicular diagonals. Show that the points $P, Q, R, S$ are concyclic.
2015 Postal Coaching, Problem 4
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?
2024 Romanian Master of Mathematics, 2
Consider an odd prime $p$ and a positive integer $N < 50p$. Let $a_1, a_2, \ldots , a_N$ be a list of positive integers less than $p$ such that any specific value occurs at most $\frac{51}{100}N$ times and $a_1 + a_2 + \cdots· + a_N$ is not divisible by $p$. Prove that there exists a permutation $b_1, b_2, \ldots , b_N$ of the $a_i$ such that, for all $k = 1, 2, \ldots , N$, the sum $b_1 + b_2 + \cdots + b_k$ is not divisible by $p$.
[i]Will Steinberg, United Kingdom[/i]
2018 Romanian Masters in 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}.$$
2016 Romanian Master of Mathematics, 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}$
2020 Romanian Masters In 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.
2016 Romanian Masters in Mathematic, 2
Given positive integers $m$ and $n \ge m$, determine the largest number of dominoes ($1\times2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2n$ columns consisting of cells ($1 \times 1$
squares) so that:
(i) each domino covers exactly two adjacent cells of the board;
(ii) no two dominoes overlap;
(iii) no two form a $2 \times 2$ square; and
(iv) the bottom row of the board is completely covered by $n$ dominoes.
2020 Romanian Masters In Mathematics, 2
Let $N \geq 2$ be an integer, and let $\mathbf a$ $= (a_1, \ldots, a_N)$ and $\mathbf b$ $= (b_1, \ldots b_N)$ be sequences of non-negative integers. For each integer $i \not \in \{1, \ldots, N\}$, let $a_i = a_k$ and $b_i = b_k$, where $k \in \{1, \ldots, N\}$ is the integer such that $i-k$ is divisible by $n$. We say $\mathbf a$ is $\mathbf b$-[i]harmonic[/i] if each $a_i$ equals the following arithmetic mean: \[a_i = \frac{1}{2b_i+1} \sum_{s=-b_i}^{b_i} a_{i+s}.\]
Suppose that neither $\mathbf a $ nor $\mathbf b$ is a constant sequence, and that both $\mathbf a$ is $\mathbf b$-[i]harmonic[/i] and $\mathbf b$ is $\mathbf a$-[i]harmonic[/i].
Prove that at least $N+1$ of the numbers $a_1, \ldots, a_N,b_1, \ldots, b_N$ are zero.
Kvant 2020, M2605
For each integer $n \geq 2$, let $F(n)$ denote the greatest prime factor of $n$. A [i]strange pair[/i] is a pair of distinct primes $p$ and $q$ such that there is no integer $n \geq 2$ for which $F(n)F(n+1)=pq$.
Prove that there exist infinitely many strange pairs.
2015 Romanian Master of Mathematics, 6
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$.
2017 Romanian Masters In Mathematics, 3
Let $n$ be an integer greater than $1$ and let $X$ be an $n$-element set. A non-empty collection of subsets $A_1, ..., A_k$ of $X$ is tight if the union $A_1 \cup \cdots \cup A_k$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_i$s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight.
[i]Note[/i]. A subset $A$ of $X$ is proper if $A\neq X$. The sets in a collection are assumed to be distinct. The whole collection is assumed to be a subcollection.
2016 Romanian Master of Mathematics, 2
Given positive integers $m$ and $n \ge m$, determine the largest number of dominoes ($1\times2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2n$ columns consisting of cells ($1 \times 1$
squares) so that:
(i) each domino covers exactly two adjacent cells of the board;
(ii) no two dominoes overlap;
(iii) no two form a $2 \times 2$ square; and
(iv) the bottom row of the board is completely covered by $n$ dominoes.
2020 Romanian Master of Mathematics Shortlist, G1
The incircle of a scalene triangle $ABC$ touches the sides $BC, CA$, and $AB$ at points $D, E$, and $F$, respectively. Triangles $APE$ and $AQF$ are constructed outside the triangle so that \[AP =PE, AQ=QF, \angle APE=\angle ACB,\text{ and }\angle AQF =\angle ABC.\]Let $M$ be the midpoint of $BC$. Find $\angle QMP$ in terms of the angles of the triangle $ABC$.
[i]Iran, Shayan Talaei[/i]
2015 Romania Masters in Mathematics, 3
A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[
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 > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.
2024 Romanian Master of Mathematics, 4
Fix integers $a$ and $b$ greater than $1$. For any positive integer $n$, let $r_n$ be the (non-negative) remainder that $b^n$ leaves upon division by $a^n$. Assume there exists a positive integer $N$ such that $r_n < \frac{2^n}{n}$ for all integers $n\geq N$. Prove that $a$ divides $b$.
[i]Pouria Mahmoudkhan Shirazi, Iran[/i]
2016 Romanian Masters in Mathematic, 6
A set of $n$ points in Euclidean 3-dimensional space, no four of which are coplanar, is partitioned into two subsets $\mathcal{A}$ and $\mathcal{B}$. An $\mathcal{AB}$-tree is a configuration of $n-1$ segments, each of which has an endpoint in $\mathcal{A}$ and an endpoint in $\mathcal{B}$, and such that no segments form a closed polyline. An $\mathcal{AB}$-tree is transformed into another as follows: choose three distinct segments $A_1B_1$, $B_1A_2$, and $A_2B_2$ in the $\mathcal{AB}$-tree such that $A_1$ is in $\mathcal{A}$ and $|A_1B_1|+|A_2B_2|>|A_1B_2|+|A_2B_1|$, and remove the segment $A_1B_1$ to replace it by the segment $A_1B_2$. Given any $\mathcal{AB}$-tree, prove that every sequence of successive transformations comes to an end (no further transformation is possible) after finitely many steps.
2024 Romanian Master of Mathematics, 1
Let $n$ be a positive integer. Initially, a bishop is placed in each square of the top row of a $2^n \times 2^n$
chessboard; those bishops are numbered from $1$ to $2^n$ from left to right. A [i]jump[/i] is a simultaneous move made by all bishops such that each bishop moves diagonally, in a straight line, some number of squares, and at the end of the jump, the bishops all stand in different squares of the same row.
Find the total number of permutations $\sigma$ of the numbers $1, 2, \ldots, 2^n$ with the following property: There exists a sequence of jumps such that all bishops end up on the bottom row arranged in the order $\sigma(1), \sigma(2), \ldots, \sigma(2^n)$, from left to right.
[i]Israel[/i]
2016 Romanian Masters in Mathematic, 3
A $\textit{cubic sequence}$ is a sequence of integers given by $a_n =n^3 + bn^2 + cn + d$, where $b, c$ and $d$ are integer constants and $n$ ranges over all integers, including negative integers.
$\textbf{(a)}$ Show that there exists a cubic sequence such that the only terms
of the sequence which are squares of integers are $a_{2015}$ and $a_{2016}$.
$\textbf{(b)}$ Determine the possible values of $a_{2015} \cdot a_{2016}$ for a cubic sequence
satisfying the condition in part $\textbf{(a)}$.
2021 Romanian Master of Mathematics, 1
Let $T_1, T_2, T_3, T_4$ be pairwise distinct collinear points such that $T_2$ lies between $T_1$ and $T_3$, and $T_3$ lies between $T_2$ and $T_4$. Let $\omega_1$ be a circle through $T_1$ and $T_4$; let $\omega_2$ be the circle through $T_2$ and internally tangent to $\omega_1$ at $T_1$; let $\omega_3$ be the circle through $T_3$ and externally tangent to $\omega_2$ at $T_2$; and let $\omega_4$ be the circle through $T_4$ and externally tangent to $\omega_3$ at $T_3$. A line crosses $\omega_1$ at $P$ and $W$, $\omega_2$ at $Q$ and $R$, $\omega_3$ at $S$ and $T$, and $\omega_4$ at $U$ and $V$, the order of these points along the line being $P,Q,R,S,T,U,V,W$. Prove that $PQ + TU = RS + VW$
[i]Geza Kos, Hungary[/i]
2019 Romanian Masters In 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, 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]
2010 Romanian Masters In Mathematics, 5
Let $n$ be a given positive integer. Say that a set $K$ of points with integer coordinates in the plane is connected if for every pair of points $R, S\in K$, there exists a positive integer $\ell$ and a sequence $R=T_0,T_1, T_2,\ldots ,T_{\ell}=S$ of points in $K$, where each $T_i$ is distance $1$ away from $T_{i+1}$. For such a set $K$, we define the set of vectors
\[\Delta(K)=\{\overrightarrow{RS}\mid R, S\in K\}\]
What is the maximum value of $|\Delta(K)|$ over all connected sets $K$ of $2n+1$ points with integer coordinates in the plane?
[i]Grigory Chelnokov, Russia[/i]
2016 Romanian Master of Mathematics, 3
A $\textit{cubic sequence}$ is a sequence of integers given by $a_n =n^3 + bn^2 + cn + d$, where $b, c$ and $d$ are integer constants and $n$ ranges over all integers, including negative integers.
$\textbf{(a)}$ Show that there exists a cubic sequence such that the only terms
of the sequence which are squares of integers are $a_{2015}$ and $a_{2016}$.
$\textbf{(b)}$ Determine the possible values of $a_{2015} \cdot a_{2016}$ for a cubic sequence
satisfying the condition in part $\textbf{(a)}$.
2020 Romanian Master of Mathematics Shortlist, C4
A ternary sequence is one whose terms all lie in the set $\{0, 1, 2\}$. Let $w$ be a length $n$ ternary sequence $(a_1,\ldots,a_n)$. Prove that $w$ can be extended leftwards and rightwards to a length $m=6n$ ternary sequence \[(d_1,\ldots,d_m) = (b_1,\ldots,b_p,a_1,\ldots,a_n,c_1,\ldots,c_q), \quad p,q\geqslant 0,\]containing no length $t > 2n$ palindromic subsequence.
(A sequence is called palindromic if it reads the same rightwards and leftwards. A length $t$ subsequence of $(d_1,\ldots,d_m)$ is a sequence of the form $(d_{i_1},\ldots,d_{i_t})$, where $1\leqslant i_1<\cdots<i_t \leqslant m$.)
Kvant 2019, M2557
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]