Found problems: 7
2018 Brazil National Olympiad, 3
Let $k$, $n$ be fixed positive integers. In a circular table, there are placed pins numbered successively with the numbers $1, 2 \dots, n$, with $1$ and $n$ neighbors. It is known that pin $1$ is golden and the others are white. Arnaldo and Bernaldo play a game, in which a ring is placed initially on one of the pins and at each step it changes position. The game begins with Bernaldo choosing a starting pin for the ring, and the first step consists of the following: Arnaldo chooses a positive integer $d$ any and Bernaldo moves the ring $d$ pins clockwise or counterclockwise (positions are considered modulo $n$, i.e., pins $x$, $y$ equal if and only if $n$ divides $x-y$). After that, the ring changes its position according to one of the following rules, to be chosen at every step by Arnaldo:
[b]Rule 1:[/b] Arnaldo chooses a positive integer $d$ and Bernaldo moves the ring $d$ pins clockwise or counterclockwise.
[b]Rule 2:[/b] Arnaldo chooses a direction (clockwise or counterclockwise), and Bernaldo moves the ring in the chosen direction in $d$ or $kd$ pins, where $d$ is the size of the last displacement performed.
Arnaldo wins if, after a finite number of steps, the ring is moved to the golden pin. Determine, as a function of $k$, the values of $n$ for which Arnaldo has a strategy that guarantees his victory, no matter how Bernaldo plays.
2019 Peru Cono Sur TST, P5
Azambuja writes a rational number $q$ on a blackboard. One operation is to delete $q$ and replace it by $q+1$; or by $q-1$; or by $\frac{q-1}{2q-1}$ if $q \neq \frac{1}{2}$. The final goal of Azambuja is to write the number $\frac{1}{2018}$ after performing a finite number of operations.
[b]a)[/b] Show that if the initial number written is $0$, then Azambuja cannot reach his goal.
[b]b)[/b] Find all initial numbers for which Azambuja can achieve his goal.
2018 Brazil National Olympiad, 2
Azambuja writes a rational number $q$ on a blackboard. One operation is to delete $q$ and replace it by $q+1$; or by $q-1$; or by $\frac{q-1}{2q-1}$ if $q \neq \frac{1}{2}$. The final goal of Azambuja is to write the number $\frac{1}{2018}$ after performing a finite number of operations.
[b]a)[/b] Show that if the initial number written is $0$, then Azambuja cannot reach his goal.
[b]b)[/b] Find all initial numbers for which Azambuja can achieve his goal.
2018 Brazil National Olympiad, 6
Consider $4n$ points in the plane, with no three points collinear. Using these points as vertices, we form $\binom{4n}{3}$ triangles. Show that there exists a point $X$ of the plane that belongs to the interior of at least $2n^3$ of these triangles.
2018 Brazil National Olympiad, 4
Esmeralda writes $2n$ real numbers $x_1, x_2, \dots , x_{2n}$, all belonging to the interval $[0, 1]$, around a circle and multiplies all the pairs of numbers neighboring to each other, obtaining, in the counterclockwise direction, the products $p_1 = x_1x_2$, $p_2 = x_2x_3$, $\dots$ , $p_{2n} = x_{2n}x_1$. She adds the products with even indices and subtracts the products with odd indices. What is the maximum possible number Esmeralda can get?
2018 Brazil National Olympiad, 5
Consider the sequence in which $a_1 = 1$ and $a_n$ is obtained by juxtaposing the decimal representation of $n$ at the end of the decimal representation of $a_{n-1}$. That is, $a_1 = 1$, $a_2 = 12$, $a_3 = 123$, $\dots$ , $a_9 = 123456789$, $a_{10} = 12345678910$ and so on. Prove that infinitely many numbers of this sequence are multiples of $7$.
2018 Brazil National Olympiad, 1
We say that a polygon $P$ is [i]inscribed[/i] in another polygon $Q$ when all vertices of $P$ belong to perimeter of $Q$. We also say in this case that $Q$ is [i]circumscribed[/i] to $P$. Given a triangle $T$, let $l$ be the maximum value of the side of a square inscribed in $T$ and $L$ be the minimum value of the side of a square circumscribed to $T$. Prove that for every triangle $T$ the inequality $L/l \ge 2$ holds and find all the triangles $T$ for which the equality occurs.