Found problems: 96
2021 EGMO, 2
Find all functions $f:\mathbb{Q}\to\mathbb{Q}$ such that the equation
\[f(xf(x)+y) = f(y) + x^2\]holds for all rational numbers $x$ and $y$.
Here, $\mathbb{Q}$ denotes the set of rational numbers.
2022 EGMO, 5
For all positive integers $n$, $k$, let $f(n, 2k)$ be the number of ways an $n \times 2k$ board can be fully covered by $nk$ dominoes of size $2 \times 1$. (For example, $f(2, 2)=2$ and $f(3, 2)=3$.) Find all positive integers $n$ such that for every positive integer $k$, the number $f(n, 2k)$ is odd.
2015 EGMO, 5
Let $m, n$ be positive integers with $m > 1$. Anastasia partitions the integers $1, 2, \dots , 2m$ into $m$ pairs. Boris then chooses one integer from each pair and finds the sum of these chosen integers.
Prove that Anastasia can select the pairs so that Boris cannot make his sum equal to $n$.
2013 EGMO, 2
Determine all integers $m$ for which the $m \times m$ square can be dissected into five rectangles, the side lengths of which are the integers $1,2,3,\ldots,10$ in some order.
2022 Romania EGMO TST, P4
For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.
2017 Turkey EGMO TST, 4
On the inside of the triangle $ABC$ a point $P$ is chosen with $\angle BAP = \angle CAP$. If $\left | AB \right |\cdot \left | CP \right |= \left | AC \right |\cdot \left | BP \right |= \left | BC \right |\cdot \left | AP \right |$ , find all possible values of the angle $\angle ABP$.
2014 Contests, 1
Determine all real constants $t$ such that whenever $a$, $b$ and $c$ are the lengths of sides of a triangle, then so are $a^2+bct$, $b^2+cat$, $c^2+abt$.
2020 EGMO, 6
Let $m > 1$ be an integer. A sequence $a_1, a_2, a_3, \ldots$ is defined by $a_1 = a_2 = 1$, $a_3 = 4$, and for all $n \ge 4$, $$a_n = m(a_{n - 1} + a_{n - 2}) - a_{n - 3}.$$
Determine all integers $m$ such that every term of the sequence is a square.
2024 EGMO, 1
Two different integers $u$ and $v$ are written on a board. We perform a sequence of steps. At each step we do one of the following two operations:
(i) If $a$ and $b$ are different integers on the board, then we can write $a + b$ on the board, if it is not
already there.
(ii) If $a$, $b$ and $c$ are three different integers on the board, and if an integer $x$ satisfies $ax^2 +bx+c = 0$,
then we can write $x$ on the board, if it is not already there.
Determine all pairs of starting numbers $(u, v)$ from which any integer can eventually be written on the board after a finite sequence of steps.
2018 EGMO, 2
Consider the set
\[A = \left\{1+\frac{1}{k} : k=1,2,3,4,\cdots \right\}.\]
[list=a]
[*]Prove that every integer $x \geq 2$ can be written as the product of one or more elements of $A$, which are not necessarily different.
[*]For every integer $x \geq 2$ let $f(x)$ denote the minimum integer such that $x$ can be written as the
product of $f(x)$ elements of $A$, which are not necessarily different.
Prove that there exist infinitely many pairs $(x,y)$ of integers with $x\geq 2$, $y \geq 2$, and \[f(xy)<f(x)+f(y).\] (Pairs $(x_1,y_1)$ and $(x_2,y_2)$ are different if $x_1 \neq x_2$ or $y_1 \neq y_2$).
[/list]
2018 EGMO, 3
The $n$ contestant of EGMO are named $C_1, C_2, \cdots C_n$. After the competition, they queue in front of the restaurant according to the following rules.
[list]
[*]The Jury chooses the initial order of the contestants in the queue.
[*]Every minute, the Jury chooses an integer $i$ with $1 \leq i \leq n$.
[list]
[*]If contestant $C_i$ has at least $i$ other contestants in front of her, she pays one euro to the Jury and moves forward in the queue by exactly $i$ positions.
[*]If contestant $C_i$ has fewer than $i$ other contestants in front of her, the restaurant opens and process ends.
[/list]
[/list]
[list=a]
[*]Prove that the process cannot continue indefinitely, regardless of the Jury’s choices.
[*]Determine for every $n$ the maximum number of euros that the Jury can collect by cunningly choosing the initial order and the sequence of moves.
[/list]
2014 EGMO, 5
Let $n$ be a positive integer. We have $n$ boxes where each box contains a non-negative number of pebbles. In each move we are allowed to take two pebbles from a box we choose, throw away one of the pebbles and put the other pebble in another box we choose. An initial configuration of pebbles is called [i]solvable[/i] if it is possible to reach a configuration with no empty box, in a finite (possibly zero) number of moves. Determine all initial configurations of pebbles which are not solvable, but become solvable when an additional pebble is added to a box, no matter which box is chosen.
2013 EGMO, 3
Let $n$ be a positive integer.
(a) Prove that there exists a set $S$ of $6n$ pairwise different positive integers, such that the least common multiple of any two elements of $S$ is no larger than $32n^2$.
(b) Prove that every set $T$ of $6n$ pairwise different positive integers contains two elements the least common multiple of which is larger than $9n^2$.
2015 EGMO, 1
Let $\triangle ABC$ be an acute-angled triangle, and let $D$ be the foot of the altitude from $C.$ The angle bisector of $\angle ABC$ intersects $CD$ at $E$ and meets the circumcircle $\omega$ of triangle $\triangle ADE$ again at $F.$
If $\angle ADF = 45^{\circ}$, show that $CF$ is tangent to $\omega .$
2017 EGMO, 5
Let $n\geq2$ be an integer. An $n$-tuple $(a_1,a_2,\dots,a_n)$ of not necessarily different positive integers is [i]expensive[/i] if there exists a positive integer $k$ such that $$(a_1+a_2)(a_2+a_3)\dots(a_{n-1}+a_n)(a_n+a_1)=2^{2k-1}.$$
a) Find all integers $n\geq2$ for which there exists an expensive $n$-tuple.
b) Prove that for every odd positive integer $m$ there exists an integer $n\geq2$ such that $m$ belongs to an expensive $n$-tuple.
[i]There are exactly $n$ factors in the product on the left hand side.[/i]
2022 Romania EGMO TST, P1
Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that all real numbers $x$ and $y$ satisfy \[f(f(x)+y)=f(x^2-y)+4f(x)y.\]
EGMO 2017, 1
Let $ABCD$ be a convex quadrilateral with $\angle DAB=\angle BCD=90^{\circ}$ and $\angle ABC> \angle CDA$. Let $Q$ and $R$ be points on segments $BC$ and $CD$, respectively, such that line $QR$ intersects lines $AB$ and $AD$ at points $P$ and $S$, respectively. It is given that $PQ=RS$.Let the midpoint of $BD$ be $M$ and the midpoint of $QR$ be $N$.Prove that the points $M,N,A$ and $C$ lie on a circle.
2022 EGMO, 4
Given a positive integer $n \ge 2$, determine the largest positive integer $N$ for which there exist $N+1$ real numbers $a_0, a_1, \dots, a_N$ such that
$(1) \ $ $a_0+a_1 = -\frac{1}{n},$ and
$(2) \ $ $(a_k+a_{k-1})(a_k+a_{k+1})=a_{k-1}-a_{k+1}$ for $1 \le k \le N-1$.
2014 Contests, 2
Let $D$ and $E$ be points in the interiors of sides $AB$ and $AC$, respectively, of a triangle $ABC$, such that $DB = BC = CE$. Let the lines $CD$ and $BE$ meet at $F$. Prove that the incentre $I$ of triangle $ABC$, the orthocentre $H$ of triangle $DEF$ and the midpoint $M$ of the arc $BAC$ of the circumcircle of triangle $ABC$ are collinear.
2025 EGMO, 5
Let $n > 1$ be an integer. In a [i]configuration[/i] of an $n \times n$ board, each of the $n^2$ cells contains an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo moves one square unit in the direction indicated by the arrow in her cell (possibly leaving the board). After each move, the arrows in all of the cells rotate $90^{\circ}$ counterclockwise. We call a cell [i]good[/i] if, starting from that cell, Turbo visits each cell of the board exactly once, without leaving the board, and returns to her initial cell at the end. Determine, in terms of $n$, the maximum number of good cells over all possible starting configurations.
[i]Proposed by Melek Güngör, Turkey[/i]
2016 EGMO, 6
Let $S$ be the set of all positive integers $n$ such that $n^4$ has a divisor in the range $n^2 +1, n^2 + 2,...,n^2 + 2n$. Prove that there are infinitely many elements of $S$ of each of the forms $7m, 7m+1, 7m+2, 7m+5, 7m+6$ and no elements of $S$ of the form $7m+3$ and $7m+4$, where $m$ is an integer.
2018 EGMO, 5
Let $\Gamma $ be the circumcircle of triangle $ABC$. A circle $\Omega$ is tangent to the line segment $AB$ and is tangent to $\Gamma$ at a point lying on the same side of the line $AB$ as $C$. The angle bisector of $\angle BCA$ intersects $\Omega$ at two different points $P$ and $Q$.
Prove that $\angle ABP = \angle QBC$.
2012 EGMO, 8
A [i]word[/i] is a finite sequence of letters from some alphabet. A word is [i]repetitive[/i] if it is a concatenation of at least two identical subwords (for example, $ababab$ and $abcabc$ are repetitive, but $ababa$ and $aabb$ are not). Prove that if a word has the property that swapping any two adjacent letters makes the word repetitive, then all its letters are identical. (Note that one may swap two adjacent identical letters, leaving a word unchanged.)
[i]Romania (Dan Schwarz)[/i]
2016 EGMO, 3
Let $m$ be a positive integer. Consider a $4m\times 4m$ array of square unit cells. Two different cells are [i]related[/i] to each other if they are in either the same row or in the same column. No cell is related to itself. Some cells are colored blue, such that every cell is related to at least two blue cells. Determine the minimum number of blue cells.
2021 EGMO, 4
Let $ABC$ be a triangle with incenter $I$ and let $D$ be an arbitrary point on the side $BC$. Let the line through $D$ perpendicular to $BI$ intersect $CI$ at $E$. Let the line through $D$ perpendicular to $CI$ intersect $BI$ at $F$. Prove that the reflection of $A$ across the line $EF$ lies on the line $BC$.