Distinct real numbers \( a, b, c \) satisfy the following condition: \[ \frac{a - b}{a^3b^3} + \frac{b - c}{b^3c^3} + \frac{c - a}{c^3a^3} = 0. \] What are the possible values of the expression \[ \frac{a^4 + b^4 + c^4}{a^2b^2 + b^2c^2 + c^2a^2}? \] [i]Proposed by Vadym Solomka[/i]

For how many distinct ordered triples $(a,b,c)$ of boolean variables does the expression $a \lor (b \land c)$ evaluate to true?

Find all triangles whose side lengths are consecutive integers, and one of whose angles is twice another.

In $\triangle ABC$, points $P$ and $Q$ lie on sides $AB$ and $AC$, respectively, such that the circumcircle of $\triangle APQ$ is tangent to $BC$ at $D$. Let $E$ lie on side $BC$ such that $BD = EC$. Line $DP$ intersects the circumcircle of $\triangle CDQ$ again at $X$, and line $DQ$ intersects the circumcircle of $\triangle BDP$ again at $Y$. Prove that $D$, $E$, $X$, and $Y$ are concyclic.

If $x,y,K,m \in N$, let us define: $a_m= \underset{k \, twos}{2^{2^{,,,{^{2}}}}}$, $A_{km} (x)= \underset{k \, twos}{ 2^{2^{,,,^{x^{a_m}}}}}$, $B_k(y)= \underset{m \, fours}{4^{4^{4^{,,,^{4^y}}}}}$, Determine all pairs $(x,y)$ of non-negative integers, dependent on $k>0$, such that $A_{km} (x)=B_k(y)$

The white fields of $3x3$ chess-board are filled with either $+1$ or $-1$. For every field, let us calculate the product of neighbouring numbers. Then let us change all the numbers by the respective products. Prove that we shall obtain only $+1$'s, having repeated this operation finite number of times.

Let $m$ be a positive integer. Determine the smallest positive integer $n$ for which there exist real numbers $x_1, x_2,...,x_n \in (-1, 1)$ such that $|x_1| + |x_2| +...+ |x_n| = m + |x_1 + x_2 + ... + x_n|$.

Show that there is a positive integer n such that the first 1992 digits of $n^{1992}$ are 1.

Define a [b]ring[/b] in the plane to be the set of points at a distance of at least $r$ and at most $R$ from a specific point $O$, where $r<R$ are positive real numbers. Rings are determined by the three parameters $(O, R, r)$. The area of a ring is labeled $S$. A point in the plane for which both its coordinates are integers is called an integer point. [b]a)[/b] For each positive integer $n$, show that there exists a ring not containing any integer point, for which $S>3n$ and $R<2^{2^n}$. [b]b)[/b] Show that each ring satisfying $100\cdot R<S^2$ contains an integer point.

Let $N$ be the number of ordered pairs of integers $(x, y)$ such that \[ 4x^2 + 9y^2 \le 1000000000. \] Let $a$ be the first digit of $N$ (from the left) and let $b$ be the second digit of $N$. What is the value of $10a + b$ ?

Consider a triangle such that \[\sin^2\alpha+\sin^2\beta+\sin^2\gamma=2.\] Show that the triangle is right.

Solve the equation $y^3 = x^3 + 8x^2 - 6x +8$, for positive integers $x$ and $y$.

Find the magnitude of the product of all complex numbers $c$ such that the recurrence defined by $x_1 = 1$, $x_2 = c^2 - 4c + 7$, and $x_{n+1} = (c^2 - 2c)^2 x_n x_{n-1} + 2x_n - x_{n-1}$ also satisfies $x_{1006} = 2011$. [i]Author: Alex Zhu[/i]

Find the largest positive integer $n$, such that there exists a finite set $A$ of $n$ reals, such that for any two distinct elements of $A$, there exists another element from $A$, so that the arithmetic mean of two of these three elements equals the third one.

The linear operator $A$ on a finite-dimensional vector space $V$ is called an involution if $A^{2}=I$, where $I$ is the identity operator. Let $\dim V=n$. i) Prove that for every involution $A$ on $V$, there exists a basis of $V$ consisting of eigenvectors of $A$. ii) Find the maximal number of distinct pairwise commuting involutions on $V$.

A polyhedron has $12$ faces and is such that: [b][i](i)[/i][/b] all faces are isosceles triangles, [b][i](ii)[/i][/b] all edges have length either $x$ or $y$, [b][i](iii)[/i][/b] at each vertex either $3$ or $6$ edges meet, and [b][i](iv)[/i][/b] all dihedral angles are equal. Find the ratio $x/y.$

Find the least natural number whose last digit is 7 such that it becomes 5 times larger when this last digit is carried to the beginning of the number.

A section of a rectangular parallelepiped by a plane is a regular hexagon. Prove that this parallelepiped is a cube.

The [i]Collatz's function[i] is a mapping $f:\mathbb{Z}_+\to\mathbb{Z}_+$ satisfying \[ f(x)=\begin{cases} 3x+1,& \mbox{as }x\mbox{ is odd}\\ x/2, & \mbox{as }x\mbox{ is even.}\\ \end{cases} \] In addition, let us define the notation $f^1=f$ and inductively $f^{k+1}=f\circ f^k,$ or to say in another words, $f^k(x)=\underbrace{f(\ldots (f}_{k\text{ times}}(x)\ldots ).$ Prove that there is an $x\in\mathbb{Z}_+$ satisfying \[f^{40}(x)> 2012x.\]

For any set $S$ of integers, let $f(S)$ denote the number of integers $k$ with $0 \le k < 2019$ such that there exist $s_1, s_2 \in S$ satisfying $s_1 - s_2 = k$. For any positive integer $m$, let $x_m$ be the minimum possible value of $f(S_1) + \dots + f(S_m)$ where $S_1, \dots, S_m$ are nonempty sets partitioning the positive integers. Let $M$ be the minimum of $x_1, x_2, \dots$, and let $N$ be the number of positive integers $m$ such that $x_m = M$. Compute $100M + N$. [i]Proposed by Ankan Bhattacharya[/i]

Let $q$ be a monic polynomial with integer coefficients. Prove that there exists a constant $C$ depending only on polynomial $q$ such that for an arbitrary prime number $p$ and an arbitrary positive integer $N \leq p$ the congruence $n! \equiv q(n) \pmod p$ has at most $CN^\frac {2}{3}$ solutions among any $N$ consecutive integers.

Let $ABC$ be a triangle with orthocenter $H$, $\Gamma$ its circumcircle, and $A' \neq A$, $B' \neq B$, $C' \neq C$ points on $\Gamma$. Define $l_a$ as the line that passes through the projections of $A'$ over $AB$ and $AC$. Define $l_b$ and $l_c$ similarly. Let $O$ be the circumcenter of the triangle determined by $l_a$, $l_b$ and $l_c$ and $H'$ the orthocenter of $A'B'C'$. Show that $O$ is midpoint of $HH'$.

On a chessboard $5 \times 9$ squares, the following game is played. Initially, a number of frogs are randomly placed on some of the squares, no square containing more than one frog. A turn consists of moving all of the frogs subject to the following rules: $\bullet$ Each frog may be moved one square up, down, left, or right; $\bullet$ If a frog moves up or down on one turn, it must move left or right on the next turn, and vice versa; $\bullet$ At the end of each turn, no square can contain two or more frogs. The game stops if it becomes impossible to complete another turn. Prove that if initially $33$ frogs are placed on the board, the game must eventually stop. Prove also that it is possible to place $32$ frogs on the board so that the game can continue forever.

Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.

Show that $r = 2$ is the largest real number $r$ which satisfies the following condition: If a sequence $a_1$, $a_2$, $\ldots$ of positive integers fulfills the inequalities \[a_n \leq a_{n+2} \leq\sqrt{a_n^2+ra_{n+1}}\] for every positive integer $n$, then there exists a positive integer $M$ such that $a_{n+2} = a_n$ for every $n \geq M$.