Through the points with integer coordinates in the right-angled coordinate system $Oxyz$ are constructed planes, parallel to the coordinate planes and in this way the space is divided to unit cubes. Find all triples ($a, b, c$) consisting of natural numbers ($a \le b \le c$) for which the cubes formed can be coloured in $abc$ colors in such a way that every palellepiped with dimensions $a \times  b \times c$, having vertices with integer coordinates and sides parallel to the coordinate axis doesn't contain unit cubes in the same color.

In an acute triangle $ABC$ point $D$ is the point of intersection of altitude $h_a$ and side $BC$, and points $M, N$ are orthogonal projections of point $D$ on sides $AB$ and $AC$. Lines $MN$ and $AD$ cross the circumcircle of triangle $ABC$ at points $P, Q$ and $A, R$. Prove that point $D$ is the center of the incircle of $PQR$.

The sum of several positive integers, not necessarily different, all of them less than or equal to $10$, is equal to $S$. We want to distribute all these numbers into two groups such that the sum of the numbers in each group is less than or equal to $80.$ Determine all values ​​of $S$ for which this is possible.

Let $a,b,c$ be integers such that $\frac{a}{b}+\frac{b}{c}+\frac{c}{a}=3$ prove that $abc$ is a perfect cube!

Ana, Beto, Carlos, Diana, Elena and Fabian are in a circle, located in that order. Ana, Beto, Carlos, Diana, Elena and Fabian each have a piece of paper, where are written the real numbers $a,b,c,d,e,f$ respectively. At the end of each minute, all the people simultaneously replace the number on their paper by the sum of three numbers; the number that was at the beginning of the minute on his paper and on the papers of his two neighbors. At the end of the minute $2022, 2022$ replacements have been made and each person have in his paper it´s initial number. Find all the posible values of $abc+def$. $\textbf{Note:}$ [i]If at the beginning of the minute $N$ Ana, Beto, Carlos have the numbers $x,y,z$, respectively, then at the end of the minute $N$, Beto is going to have the number $x+y+z$[/i].

Let $ a_{0},a_{1},\ldots,a_{n}$ be integers, one of which is nonzero, and all of the numbers are not less than $ \minus{} 1$. Prove that if \[ a_{0} \plus{} 2a_{1} \plus{} 2^{2}a_{2} \plus{} \cdots \plus{} 2^{n}a_{n} \equal{} 0,\] then $ a_{0} \plus{} a_{1} \plus{} \cdots \plus{} a_{n} > 0$.

A point in the cartesian plane with integer coordinates is called a lattice point. Consider the following one player game. A finite set of selected lattice points and finite set of selected segments is called a position in this game if the following hold: (i) The endpoints of each selected segment are lattice points; (ii) Each selected segment is parallel to a coordinate axis or to one of the lines $y = \pm x$, (iii) Each selected segment contains exactly five lattice points, all of which are selected, (iv) Every two selected segments have at most one common point. A move in this game consists of selecting a lattice point and a segment such that the new set of selected lattice points and segments is a position. Prove or disprove that there exists an initial position such that the game can have infinitely many moves.

For any positive integer $n$ and real numbers $a_i>0$ ($i=1,2,...,n$), prove that \[\sum_{k=1}^n \frac{k}{a_1^{-1}+a_2^{-1}+...+a_k^{-1}}\leq 2\sum_{k=1}^n a_k.\] Discuss if the "$2$" at the right hand side of the inequality can or cannot be replaced by a smaller real number.

We are given $2001$ balloons and a positive integer $k$. Each balloon has been blown up to a certain size (not necessarily the same for each balloon). In each step it is allowed to choose at most $k$ balloons and equalize their sizes to their arithmetic mean. Determine the smallest value of $k$ such that, whatever the initial sizes are, it is possible to make all the balloons have equal size after a finite number of steps.

For nonnegative integers $n$, let $f(n)$ be the number of digits of $n$ that are at least $5$. Let $g(n)=3^{f(n)}$. Compute \[\sum_{i=1}^{1000} g(i).\] [i]Proposed by Nathan Ramesh

Prove: (a) There are infinitely many triples of positive integers $m, n, p$ such that $4mn - m- n = p^2 - 1.$ (b) There are no positive integers $m, n, p$ such that $4mn - m- n = p^2.$

In the convex quadrilateral $ABCD$, the bisectors of angles $A$ and $C$ intersect in $I$. Prove that $ABCD$ is circumscriptible if and only if $$S[AIB] + S[CID] =S[AID]+S[BIC]$$ ( $S[XYZ]$ denotes the area of the triangle $XYZ$)

Let $n,k \in \mathbb{Z}^{+}$ with $k \leq n$ and let $S$ be a set containing $n$ distinct real numbers. Let $T$ be a set of all real numbers of the form $x_1 + x_2 + \ldots + x_k$ where $x_1, x_2, \ldots, x_k$ are distinct elements of $S.$ Prove that $T$ contains at least $k(n-k)+1$ distinct elements.

Find all natural numbers $n$ for which there is a permutation $(p_1,p_2,...,p_n)$ of numbers $(1,2,...,n)$ such that sets $\{p_1 +1, p_2 + 2,..., p_n +n\}$ and $\{p_1-1, p_2-2,...,p_n -n\}$ are complete residue systems $\mod n$.

Natural numbers $a, b$ and $c$ are pairwise distinct and satisfy \[a | b+c+bc, b | c+a+ca, c | a+b+ab.\] Prove that at least one of the numbers $a, b, c$ is not prime.

Kamil wrote on a board an expression consisting of alternating addition and subtraction of natural numbers from $1$ to $100$: \[1-2+3-4+5-6+\ldots-98+99-100.\] Then, Kamil erased one of the plus or minus signs and replaced it with an equals sign, obtaining a true equality. Which number preceded the erased sign? Find all possibilities and justify your answer.