For any function $f:[0,1]\to [0,1]$, let $P_n (f)$ denote the number of fixed points of the function $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )$, i.e., the number of points $x\in [0,1]$ satisfying $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )=x$. Construct a piecewise linear, continuous, surjective function $f:[0,1] \to [0,1]$ such that for a suitable $2<A<3$, the sequence $\frac{P_n(f)}{A^n}$ converges. [i]Based on the 8th problem of the Miklós Schweitzer competition, 2018[/i]

If $x$ and $y$ are nonnegative real numbers with $x+y= 2$, show that $x^2y^2(x^2+y^2)\le 2$.

$M_n(\mathbb{C})$ is the vector space of all complex $n\times n$ matrices. Given a linear map $T:M_n(\mathbb{C})\to M_n(\mathbb{C})$ s.t. $\det (A)=\det(T(A))$ for every $A\in M_n(\mathbb{C})$. (1) If $T(A)$ is the zero matrix, then show that $A$ is also the zero matrix. (2) Prove that $\text{rank} (A)=\text{rank} (T(A))$ for any $A\in M_n(\mathbb{C})$.

Solve the system of equations \[\{\begin{array}{cc}x^3=2y^3+y-2\\ \text{ } \\ y^3=2z^3+z-2 \\ \text{ } \\ z^3 = 2x^3 +x -2\end{array}\]

For a given positive integer $k$ denote the square of the sum of its digits by $f_{1}(k)$ and let $f_{n+1}(k)=f_{1}(f_{n}(k))$. Determine the value of $f_{1991}(2^{1990})$.

Let $f:] 0. \infty [ \to R$ be a strictly increasing function, such that $$f (x) f\left(f (x) +\frac{1}{x} \right)= 1.$$ Find $f (1)$.

Each side and diagonal of a regular $n$-gon ($n \ge 3$) for odd $n$ is colored red or blue. One may choose a vertex and change the color of all segments emanating from that vertex. Prove that, no matter how the edges were colored initially, one can achieve that the number of blue segments at each vertex is even. Prove also that the resulting coloring depends only on the initial coloring.

Find all pairs of positive integers ($x$,$y$) such that $y^3=x^3+7x^2+4x+15$.

Find the number of $10$-digit numbers $\overline{a_1a_2... a_{10}}$ which are multiples of $11$ such that the digits are non-increasing from left to right, i.e. $a_i \ge a_{i+1}$ for each $1 \le i \le 9$.

Altitudes $AA_1$ and $BB_1$ are drawn in the acute-angled triangle $ABC$. Prove that the perpendicular drawn from the touchpoint of the inscribed circle with the side $BC$, on the line $AC$ passes through the center of the inscribed circle of the triangle $A_1CB_1$. (V. Protasov)

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Let $N$ be a positive integer. Brothers Michael and Kylo each select a positive integer less than or equal to $N$, independently and uniformly at random. Let $p_N$ denote the probability that the product of these two integers has a units digit of $0$. The maximum possible value of $p_N$ over all possible choices of $N$ can be written as $\tfrac ab,$ where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$.

The edges of $K_{2017}$ are each labeled with $1,2,$ or $3$ such that any triangle has sum of labels at least $5.$ Determine the minimum possible average of all $\dbinom{2017}{2}$ labels. (Here $K_{2017}$ is defined as the complete graph on 2017 vertices, with an edge between every pair of vertices.) [i]Proposed by Michael Ma[/i]

Let $A_1A_2A_3A_4$ be a quadrilateral with no pair of parallel sides. For each $i=1, 2, 3, 4$, define $\omega_1$ to be the circle touching the quadrilateral externally, and which is tangent to the lines $A_{i-1}A_i, A_iA_{i+1}$ and $A_{i+1}A_{i+2}$ (indices are considered modulo $4$ so $A_0=A_4, A_5=A_1$ and $A_6=A_2$). Let $T_i$ be the point of tangency of $\omega_i$ with the side $A_iA_{i+1}$. Prove that the lines $A_1A_2, A_3A_4$ and $T_2T_4$ are concurrent if and only if the lines $A_2A_3, A_4A_1$ and $T_1T_3$ are concurrent. [i]Pavel Kozhevnikov, Russia[/i]

For positive integers $1 \le n \le 100$, let \[ f(n) = \sum_{i=1}^{100} i\left\lvert i-n \right\rvert. \] Compute $f(54)-f(55)$. [i]Proposed by Aaron Lin[/i]

A shoe brand proposes: Buy a pair of shoes without paying. It's about this: you go to the factory and pay $20,000 \$ $ for a pair of shoes, get the shoes and ten stamps, with a unit cost of each stamp $2000 \$ $. By selling these stamps you will get your money back. The ones who buy these stamps go to the factory, delivers them and for $18,000 \$ $ they receive their pair of shoes and the ten stamps, thus continuing the cycle. $\bullet$ How much does the factory receive for each pair of shoes? $\bullet$ Can this operation be repeated a hundred times, assuming that no one repeats itself? [hide=original wording]Una marca de zapatos propone: Compre un par de zapatos sin pagar. Se trata de lo siguiente: usted va a la fabrica y paga \$ 20000 por un par de zapatos; recibe los zapatos y diez estampillas, con un costo unitario de ]\$ 2000. Al vender estas estampillas recuperara su dinero. Quienes compren estas estampillas van a la fabrica, la entregan y por \$ 18000 reciben su par de zapatos y las diez estampillas, continuando as el ciclo. - Cuanto recibe la fabrica por cada par de zapatos? - Se puede repetir esta operacion cien veces, suponiendo que nadie se repite?[/hide]

The shape of a military base is an equilateral triangle of side $10$ kilometers. Security constraints make cellular phone com­munication possible only within $2.5$ kilometers. Each of $17$ soldiers patrols the base randomly and tries to contact all others. Prove that at each moment at least two soldiers can communicate.

In an acute-angled triangle, each angle is an integral number of degrees, and the smallest angle is one-fifth of the largest one. Find these angles. (G Galperin)

Let $ n \leq 44, n \in \mathbb{N}.$ Prove that for any function $ f$ defined over $ \mathbb{N}^2$ whose images are in the set $ \{1, 2, \ldots , n\},$ there are four ordered pairs $ (i, j), (i, k), (l, j),$ and $ (l, k)$ such that \[ f(i, j) \equal{} f(i, k) \equal{} f(l, j) \equal{} f(l, k),\] in which $ i, j, k, l$ are chosen in such a way that there are natural numbers $ m, p$ that satisfy \[ 1989m \leq i < l < 1989 \plus{} 1989m\] and \[ 1989p \leq j < k < 1989 \plus{} 1989p.\]

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Prove that in every triangle with sides $a, b, c$ and opposite angles $A, B, C$, is fulfilled (measuring the angles in radians) $$\frac{a A+bB+cC}{a+b+c} \ge \frac{\pi}{3}$$ Hint: Use $a \ge b \ge c \Rightarrow A \ge B \ge C$.

Let $AA_1$, $BB_1$, $CC_1$ be the altitudes of an acute angled triangle $ABC$. On the side $BC$ point $K$ is taken such that $\angle BB_1K=\angle A$. On the side $AB$ a point $M$ is taken such that $\angle BB_1M\angle C$. Let $L$ be the intersection of $BB_1$ and $A_1C_1$. Prove that the quadrilateral $B_1KLM$ is circumscribed. [I]Proposed by A. Khrabrov, D. Rostovski[/i]

Let $ R$ be a ring with 1. Every element in $ R$ can be written as product of idempotent ($ u^n\equal{}u$ for some $ n$) elements. Prove that $ R$ is commutative

Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition \[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1 \] for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$ [i]Author: Nikolai Nikolov, Bulgaria[/i]

Let $m\ge2$ be an integer. The sequence $(a_n)_{n\in\mathbb N}$ is defined by $a_0=0$ and $a_n=\left\lfloor\frac nm\right\rfloor+a_{\left\lfloor\frac nm\right\rfloor}$ for all $n$. Determine $\lim_{n\to\infty}\frac{a_n}n$.