Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

A positive integer $n\geqslant 3$ is [i]almost squarefree[/i] if there exists a prime number $p\equiv 1\bmod 3$ such that $p^2\mid n$ and $n/p$ is squarefree. Prove that for any almost squarefree positive integer $n$ the ratio $2\sigma(n)/d(n)$ is an integer.

Numbers $-1011, -1010, \ldots, -1, 1, \ldots, 1011$ in some order form the sequence $a_1,a_2,\ldots, a_{2022}$. Find the maximum possible value of the sum $$|a_1|+|a_1+a_2|+\ldots+|a_1+\ldots+a_{2022}|$$

Let $ABC$ be an acute triangle with $\angle BAC = 30^{\circ}$. The internal and external angle bisectors of $\angle ABC$ meet the line $AC$ at $B_1$ and $B_2$ , respectively, and the internal and external angle bisectors of $\angle ACB$ meet the line $AB$ at $C_1$ and $C_2$ , respectively. Suppose that the circles with diameters $B_1B_2$ and $C_1C_2$ meet inside the triangle $ABC$ at point $P$ . Prove that $\angle BPC = 90^{\circ}$.

Point $P_1$ is located $600$ miles West of point $P_2$. At $7:00\text{AM}$ a car departs from $P_1$ and drives East at a speed of $50$mph. At $8:00\text{AM}$ another car departs from $P_2$ and drives West at a constant speed of $x$ miles per hour. If the cars meet each other exactly halfway between $P_1$ and $P_2$, what is the value of $x$?

Air Michael and Air Patrick operate direct flights connecting Belfast, Cork, Dublin, Galway, Limerick, and Waterord. For each pair of cities exactly one of the airlines operates the route (in both directions) connecting the cities. Prove that there are four cities for which one of the airlines operates a round trip. (Note that a round trip of four cities $ P,Q,R,$ and $ S$, is a journey that follows the path $ P \rightarrow Q \rightarrow R \rightarrow S \rightarrow P$.)

A $3n$-table is a table with three rows and $n$ columns containing all the numbers $1, 2, …, 3n$. Such a table is called [i]tidy [/i] if the $n$ numbers in the first row appear in ascending order from left to right, and the three numbers in each column appear in ascending order from top to bottom. How many tidy $3n$-tables exist?

At the vertices $A, B, C, D, E, F, G, H$ of a cube, $2001, 2002, 2003, 2004, 2005, 2008, 2007$ and $2006$ stones respectively are placed. It is allowed to move a stone from a vertex to each of its three neighbours, or to move a stone to a vertex from each of its three neighbours. Which of the following arrangements of stones at $A, B, \ldots , H$ can be obtained? $(\text{a})\quad 2001, 2002, 2003, 2004, 2006, 2007, 2008, 2005;$ $(\text{b})\quad 2002, 2003, 2004, 2001, 2006, 2005, 2008, 2007;$ $(\text{c})\quad 2004, 2002, 2003, 2001, 2005, 2008, 2007, 2006.$

Which one of the following rigid transformations (isometries) maps the line segment $\overline{AB}$ onto the line segment $\overline{A'B'}$ so that the image of $A(-2,1)$ is $A'(2,-1)$ and the image of $B(-1,4)$ is $B'(1,-4)?$ $\textbf{(A) } $ reflection in the $y$-axis $\textbf{(B) } $ counterclockwise rotation around the origin by $90^{\circ}$ $\textbf{(C) } $ translation by 3 units to the right and 5 units down $\textbf{(D) } $ reflection in the $x$-axis $\textbf{(E) } $ clockwise rotation about the origin by $180^{\circ}$

In the triangle $ABC$ we have $\angle ABC=100^\circ$, $\angle ACB=65^\circ$, $M\in AB$, $N\in AC$, and $\angle MCB=55^\circ$, $\angle NBC=80^\circ$. Find $\angle NMC$. [i]St.Petersburg folklore[/i]

Some marbles in a bag are red and the rest are blue. If one red marble is removed, then one-seventh of the remaining marbles are red. If two blue marbles are removed instead of one red, then one-fifth of the remaining marbles are red. How many marbles were in the bag originally? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 22 \qquad\textbf{(C)}\ 36 \qquad\textbf{(D)}\ 57 \qquad\textbf{(E)}\ 71 $

Product of two integers is $1$ less than three times of their sum. Find those integers.

In the regular hexagonal prism $ABCDEFA_1B_1C_1D_1E_1F_1$, We construct $, Q$, the projections of point $A$ on the lines $A_1B$ and $A_1C$ repsectilvely. We construct $R,S$, the projections of point $D_1$ on the lines $A_1D$ and $C_1D$ respectively. a) Determine the measure of the angle between the planes $(AQP)$ and $(D_1RS)$. b) Show that $\angle AQP = \angle D_1RS$.

Given a cyclic quadrilateral $ABCD$, let it's diagonals intersect at the point $O$. Take the midpoints of $AD$ and $BC$ as $M$ and $N$ respectively. Take a point $S$ on the arc $AB$ not containing $C$ or $D$ such that $$\angle SMA=\angle SNB$$ Prove that if the diagonals of the quadrilateral made from the lines $SM$, $SN$, $AB$, and $CD$ intersect at the point $T$, then $S$, $O$, and $T$ are collinear.

A permutation of a set is a bijection from the set to itself. For example, if $\sigma$ is the permutation $1 7\mapsto 3$, $2 \mapsto 1$, and $3 \mapsto 2$, and we apply it to the ordered triplet $(1, 2, 3)$, we get the reordered triplet $(3, 1, 2)$. Let $\sigma$ be a permutation of the set $\{1, ... , n\}$. Let $$\theta_k(m) = \begin{cases} m + 1 & \text{for} \,\, m < k\\ 1 & \text{for} \,\, m = k\\ m & \text{for} \,\, m > k\end{cases}$$ Call a finite sequence $\{a_i\}^{j}_{i=1}$ a disentanglement of $\sigma$ if $\theta_{a_j} \circ ...\circ \theta_{a_j} \circ \sigma$ is the identity permutation. For example, when $\sigma = (3, 2, 1)$, then $\{2, 3\}$ is a disentaglement of $\sigma$. Let $f(\sigma)$ denote the minimum number $k$ such that there is a disentanglement of $\sigma$ of length $k$. Let $g(n)$ be the expected value for $f(\sigma)$ if $\sigma$ is a random permutation of $\{1, ... , n\}$. What is $g(6)$?

Let $n \ne 0$ be a natural number and integers $x_1, x_2, ...., x_n, y_1, y_2, ...., y_n$ with the properties: a) $x_1 + x_2 + .... + x_n = y_1 + y_2 + .... + y_n = 0,$ b) $x_1 ^ 2 + y_1 ^ 2 = x_2 ^ 2 + y_2 ^ 2 = .... = x_n ^ 2 + y_n ^ 2$. Show that $n$ is even.

Let $\lambda$ be a line and let $M, N$ be two points on $\lambda$. Circles $\alpha$ and $\beta$ centred at $A$ and $B$ respectively are both tangent to $\lambda$ at $M$, with $A$ and $B$ being on opposite sides of $\lambda$. Circles $\gamma$ and $\delta$ centred at $C$ and $D$ respectively are both tangent to $\lambda$ at $N$, with $C$ and $D$ being on opposite sides of $\lambda$. Moreover $A$ and $C$ are on the same side of $\lambda$. Prove that if there exists a circle tangent to all circles $\alpha, \beta, \gamma, \delta$ containing all of them in its interior, then the lines $AC, BD$ and $\lambda$ are either concurrent or parallel.

During his excursion to the historical park, Pepito set out to collect stones whose weight in kilograms is a power of two. Once the first stone has been collected, Pepito only collects stones strictly heavier than the first. At the end of the excursion, her partner Ana chooses a positive integer $K \ge 2$ and challenges Pepito to divide the stones into $K$ groups of equal weight. a) Can Pepito meet the challenge if all the stones he collected have different weights? b) Can Pepito meet the challenge if some collected stones are allowed to have equal weight?

From the altitudes of an acute-angled triangle, a triangle can be composed. Prove that a triangle can be composed from the bisectors of this triangle.

Let $ x$ and $ y$ be two-digit integers such that $ y$ is obtained by reversing the digits of $ x$. The integers $ x$ and $ y$ satisfy $ x^2 \minus{} y^2 \equal{} m^2$ for some positive integer $ m$. What is $ x \plus{} y \plus{} m$? $ \textbf{(A)}\ 88\qquad \textbf{(B)}\ 112\qquad \textbf{(C)}\ 116\qquad \textbf{(D)}\ 144\qquad \textbf{(E)}\ 154$

Let p be a prime and $a_1 , a_2 , ..., a_k$ pairwise incongruent modulo p . Prove that $[\sqrt {k-1}]$ of the elements can be selected from $a_i$'s such that adding any numbers different from the selected ones will never give a number divisible by p .

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

Let $ABCD$ be a cyclic quadrilateral with $O$ is circumcenter and $AC$ meets $BD$ at $I$ Suppose that rays $DA,CD$ meet at $E$ and rays $BA,CD$ meet at $F$. The Gauss line of $ABCD$ meets $AB,BC,CD,DA$ at points $M,N,P,Q$ respectively. Prove that the circle of diameter $OI$ is tangent to two circles $(ENQ), (FMP)$

Let $p > 3$ be a prime number and $ x$ an integer, denote by $r ( x )\in \{ 0 , 1 , ... , p - 1 \}$ to the rest of $x$ modulo $p$ . Let $x_1, x_2, ... , x_k$ ( $2 < k < p$) different integers modulo $p$ and not divisible by $p$. We say that a number $a \in \{ 1 , 2 ,..., p -1 \}$ is [i]good [/i] if $r ( a x_1) < r ( a x_2) <...< r ( a x_k)$. Show that there are at most $\frac{2 p}{k + 1}-{ 1}$ [i]good [/i] numbers.

Given five circles of radii $1, 2, 3, 4,$ and $5$, what is the maximum number of points of intersections possible (every distinct point where two circles intersect counts).