Found problems: 33
2024 Israel Olympic Revenge, P4
Let $ABC$ be an acute triangle. Let $D$ be a point inside side $BC$. Let $E$ be the foot from $D$ to $AC$, and let $F$ be a point on $AB$ so that $FE\perp AB$. It is given that the lines $AD, BE, CF$ concur. $M_A, M_B, M_C$ are the midpoints of sides $BC, AC, AB$ respectively, and $O$ is the circumcenter of $ABC$. Moreover, we define $P=EF\cap M_AM_B, S=DE\cap M_AM_C$. Prove that $O, P, S$ are collinear.
2024 Israel Olympic Revenge, P3
In La-La-Land there are 5784 cities. Alpaca chooses for each pair of cities to either build a road or a river between them, and additionally she places a fish in each city to defend it. Subsequently Bear chooses a city to start his trip. At first, he chooses whether to take his trip in a car or in a boat. A boat can sail through rivers but not drive on roads, and a car can drive on roads but not sail through rivers. When Bear enters a city he takes the fish defending it, and consequently the city collapses and he can't return to it again. What is the maximum number of fish Bear can guarantee himself, regardless of the construction of the paths?
Remarks: Bear takes a fish also from the city he begins his trip from (and the city collapses). All roads and rivers are two-way.
2024 Israel Olympic Revenge, P2
Let $n\geq 2$ be an integer. For each natural $m$ and each integer sequence $0<k_1<k_2<\cdots <k_m$ for which $k_1+\cdots+k_m=n$, Michael wrote down the number $\frac{1}{k_1\cdot k_2\cdots k_m} $ on the board. Prove that the sum of the numbers on the board is less than $1$.
2020 Olympic Revenge, 2
For a positive integer $n$, we say an $n$-[i]shuffling[/i] is a bijection $\sigma: \{1,2, \dots , n\} \rightarrow \{1,2, \dots , n\}$ such that there exist exactly two elements $i$ of $\{1,2, \dots , n\}$ such that $\sigma(i) \neq i$.
Fix some three pairwise distinct $n$-shufflings $\sigma_1,\sigma_2,\sigma_3$. Let $q$ be any prime, and let $\mathbb{F}_q$ be the integers modulo $q$. Consider all functions $f:(\mathbb{F}_q^n)^n\to\mathbb{F}_q$ that satisfy, for all integers $i$ with $1 \leq i \leq n$ and all $x_1,\ldots x_{i-1},x_{i+1}, \dots ,x_n, y, z\in\mathbb{F}_q^n$, \[f(x_1, \ldots ,x_{i-1}, y, x_{i+1}, \ldots , x_n) +f(x_1, \ldots ,x_{i-1}, z, x_{i+1}, \ldots , x_n) = f(x_1, \ldots ,x_{i-1}, y+z, x_{i+1}, \ldots , x_n), \] and that satisfy, for all $x_1,\ldots,x_n\in\mathbb{F}_q^n$ and all $\sigma\in\{\sigma_1,\sigma_2,\sigma_3\}$, \[f(x_1,\ldots,x_n)=-f(x_{\sigma(1)},\ldots,x_{\sigma(n)}).\]
For a given tuple $(x_1,\ldots,x_n)\in(\mathbb{F}_q^n)^n$, let $g(x_1,\ldots,x_n)$ be the number of different values of $f(x_1,\ldots,x_n)$ over all possible functions $f$ satisfying the above conditions.
Pick $(x_1,\ldots,x_n)\in(\mathbb{F}_q^n)^n$ uniformly at random, and let $\varepsilon(q,\sigma_1,\sigma_2,\sigma_3)$ be the expected value of $g(x_1,\ldots,x_n)$. Finally, let \[\kappa(\sigma_1,\sigma_2,\sigma_3)=-\lim_{q \to \infty}\log_q\left(-\ln\left(\frac{\varepsilon(q,\sigma_1,\sigma_2,\sigma_3)-1}{q-1}\right)\right).\]
Pick three pairwise distinct $n$-shufflings $\sigma_1,\sigma_2,\sigma_3$ uniformly at random from the set of all $n$-shufflings. Let $\pi(n)$ denote the expected value of $\kappa(\sigma_1,\sigma_2,\sigma_3)$. Suppose that $p(x)$ and $q(x)$ are polynomials with real coefficients such that $q(-3) \neq 0$ and such that $\pi(n)=\frac{p(n)}{q(n)}$ for infinitely many positive integers $n$. Compute $\frac{p\left(-3\right)}{q\left(-3\right)}$.
2002 Olympic Revenge, 5
In a "Hanger Party", the guests are initially dressed. In certain moments, the host chooses a guest, and the chosen guest and all his friends will wear its respective clothes if they are naked, and undress it if they are dressed.
It is possible that, in some moment, the guests are naked, independent of their mutual friendships? (Suppose friendship is reciprocal.)
2023 Israel Olympic Revenge, P3
Find all (weakly) increasing $f\colon \mathbb{R}\to \mathbb{R}$ for which
\[f(f(x)+y)=f(f(y)+x)\]
holds for all $x, y\in \mathbb{R}$.
2022 Israel Olympic Revenge, 2
A triple $(a,b,c)$ of positive integers is called [b]strong[/b] if the following holds: for each integer $m>1$, the number $a+b+c$ does not divide $a^m+b^m+c^m$. The [b]sum[/b] of a strong triple $(a,b,c)$ is defined as $a+b+c$.
Prove that there exists an infinite collection of strong triples, the sums of which are all pairwise coprime.
2015 Olympic Revenge, 5
Given a triangle $A_1 A_2 A_3$, let $a_i$ denote the side opposite to $A_i$, where indices are taken modulo 3. Let $D_1 \in a_1$. For $D_i \in A_i$, let $\omega_i$ be the incircle of the triangle formed by lines $a_i, a_{i+1}, A_iD_i$, and $D_{i+1} \in a_{i+1}$ with $A_{i+1} D_{i+1}$ tangent to $\omega_i$. Show that the set $\{D_i: i \in \mathbb{N}\}$ is finite.