Five points are given in the plane that each of $10$ triangles they define has area greater than $2$. Prove that there exists a triangle of area greater than $3$.

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

For which natural $ n \geq 3 $ numbers from 1 to $ n $ can be arranged by a circle so that each number does not exceed $60$ % of the sum of its two neighbors?

In the country of Drilandia, which has at least three cities, there are bidirectional roads connecting some pairs of cities such that any city can be reached from any other. Two cities are called [i]close[/i] if one can reach the other by using at most two intermediary cities. The mayor, Drilago, fortified the road system by building a direct road between each pair of close cities that were not already connected. Prove that after the expansion, there exists a journey that starts and ends at the same city, where each city except the first is visited exactly once, and the first city is visited twice (once at the beginning and once at the end).

A bee travels in a series of steps of length $1$: north, west, north, west, up, south, east, south, east, down. (The bee can move in three dimensions, so north is distinct from up.) There exists a plane $P$ that passes through the midpoints of each step. Suppose we orthogonally project the bee’s path onto the plane $P$, and let $A$ be the area of the resulting figure. What is $A^2$?

Let $n \geq 1$ be an integer. Ruben takes a test with $n$ questions. Each question on this test is worth a different number of points. The first question is worth $1$ point, the second question $2$, the third $3$ and so on until the last question which is worth $n$ points. Each question can be answered either correctly or incorrectly. So an answer for a question can either be awarded all, or none of the points the question is worth. Let $f(n)$ be the number of ways he can take the test so that the number of points awarded equals the number of questions he answered incorrectly. Do there exist infinitely many pairs $(a; b)$ with $a < b$ and $f(a) = f(b)$?

We color the numbers $1, 2, 3,....,20$ with two colors white and black in such a way that both colors are used. Find the number of ways, we can perform this coloring if the product of white numbers and the product of black numbers have greatest common divisor equal to $1$.

We say that a set of positive integers is [i]regular [/i] if, for any selection of numbers from the set, the sum of the chosen numbers is different from $1810$. Divide the set of integers from $452$ to $1809$ (inclusive) into the smallest possible number of regular sets.

The maximum number of solid regular tetrahedrons can be placed against each other so that one of their edges coincides with a given line segment in space? [hide=original wording]Hoeveel massieve regelmatige viervlakken kan men maximaal tegen mekaar plaatsen zodat ´e´en van hun ribben samenvalt met een gegeven lijnstuk in de ruimte?[/hide]

How many functions $f : \{1,2,3,4,5,6\} \to \{1,2,3,4,5,6\}$ have the property that $f(f(x))+f(x)+x$ is divisible by $3$ for all $x \in \{1,2,3,4,5,6\}?$ [i]Proposed by Kyle Lee[/i]

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

$A_1,A_2,\cdots,A_8$ are fixed points on a circle. Determine the smallest positive integer $n$ such that among any $n$ triangles with these eight points as vertices, two of them will have a common side.

There is exactly one astronomer on every planet of a certain system. He watches the closest planet. The number of the planets is odd and all of the distances are different. Prove that there one planet being not watched.

Let $n \ge 3$ cells be arranged into a circle. Each cell can be occupied by $0$ or $1$. The following operation is admissible: Choose any cell $C$ occupied by a $1$, change it into a $0$ and simultaneously reverse the entries in the two cells adjacent to $C$ (so that $x,y$ become $1 - x$, $1 - y$). Initially, there is a $1$ in one cell and zeros elsewhere. For which values of $n$ is it possible to obtain zeros in all cells in a finite number of admissible steps?

There are $40$ points on the two parallel lines. We divide it to pairs, such that line segments, that connects point in pair, do not intersect each other ( endpoint from one segment cannot lies on another segment). Prove, that number of ways to do it is less than $3^{39}$

Several soldiers are standing in a row. After a command each of them turned their head either to the left or to the right. After that every second every soldier performs the following operation simultaneously: 1) if the soldier is facing right and the majority of soldiers to the right of him are facing left, he starts facing left; 2) if the soldier is facing left and the majority of soldiers to the left of him are facing right, he starts facing right; 3) otherwise he does nothing. Prove that at some point the process will stop.

Let $n$ and $k$ be positive integers satisfying $k\leq2n^2$. Lee and Sunny play a game with a $2n\times2n$ grid paper. First, Lee writes a non-negative real number no greater than $1$ in each of the cells, so that the sum of all numbers on the paper is $k$. Then, Sunny divides the paper into few pieces such that each piece is constructed by several complete and connected cells, and the sum of all numbers on each piece is at most $1$. There are no restrictions on the shape of each piece. (Cells are connected if they share a common edge.) Let $M$ be the number of pieces. Lee wants to maximize $M$, while Sunny wants to minimize $M$. Find the value of $M$ when Lee and Sunny both play optimally.

In some cells of a rectangular table $m\times n (m, n> 1)$ is one checker. $Baby$ cut along the lines of the grid this table so that it is split into two equal parts, with the number of pieces on each side were the same. $Carlson$ changed the arrangement of checkers on the board (and on each side of the cage is still worth no more than one pieces). Prove that the $Baby$ may again cut the board into two equal parts containing an equal number of pieces

For every nonempty subset $R$ of $S = \{1,2,...,10\}$, we define the alternating sum $A(R)$ as follows: If $r_1,r_2,...,r_k$ are the elements of $R$ in the increasing order, then $A(R) = r_k -r_{k-1} +r_{k-2}- ... +(-1)^{k-1}r_1$. (a) Is it possible to partition $S$ into two sets having the same alternating sum? (b) Determine the sum $\sum_{R} A(R)$, where $R$ runs over all nonempty subsets of $S$.

Let $m$ and $n$ be positive integers. A sequence of points $(A_0,A_1,\ldots,A_n)$ on the Cartesian plane is called [i]interesting[/i] if $A_i$ are all lattice points, the slopes of $OA_0,OA_1,\cdots,OA_n$ are strictly increasing ($O$ is the origin) and the area of triangle $OA_iA_{i+1}$ is equal to $\frac{1}{2}$ for $i=0,1,\ldots,n-1$. Let $(B_0,B_1,\cdots,B_n)$ be a sequence of points. We may insert a point $B$ between $B_i$ and $B_{i+1}$ if $\overrightarrow{OB}=\overrightarrow{OB_i}+\overrightarrow{OB_{i+1}}$, and the resulting sequence $(B_0,B_1,\ldots,B_i,B,B_{i+1},\ldots,B_n)$ is called an [i]extension[/i] of the original sequence. Given two [i]interesting[/i] sequences $(C_0,C_1,\ldots,C_n)$ and $(D_0,D_1,\ldots,D_m)$, prove that if $C_0=D_0$ and $C_n=D_m$, then we may perform finitely many [i]extensions[/i] on each sequence until the resulting two sequences become identical.

The Alpine Club organizes four mountain trips for its $n$ members. Let $E_1, E_2, E_3, E_4$ be the teams participating in these trips. In how many ways can these teams be formed so as to satisfy $E_1 \cap E_2 \ne\varnothing$, $E_2 \cap E_3 \ne\varnothing$ , $E_3 \cap E_4 \ne\varnothing$ ?

Two magicians show the following trick. The first magician goes out of the room. The second magician takes a deck of $100$ cards labelled by numbers $1,2,\ldots ,100$ and asks three spectators to choose in turn one card each. The second magician sees what card each spectator has taken. Then he adds one more card from the rest of the deck. Spectators shuffle these $4$ cards, call the first magician and give him these $4$ cards. The first magician looks at the $4$ cards and “guesses” what card was chosen by the first spectator, what card by the second and what card by the third. Prove that the magicians can perform this trick.

There is a king in the lower left corner of a chessboard of dimensions $6$ and $6$. In one move, he can move either one cell to the right, or one cell up, or one cell diagonally - to the right and up. How many different paths can the king take to the upper right corner of the board?

Triangle $\Delta GRB$ is dissected into $25$ small triangles as shown. All vertices of these triangles are painted in three colors so that the following conditions are satisfied: Vertex $G$ is painted in green, vertex $R$ in red, and $B$ in blue; Each vertex on side $GR$ is either green or red, each vertex on $RB$ is either red or blue, and each vertex on $GB$ is either green or blue. The vertices inside the big triangle are arbitrarily colored. Prove that, regardless of the way of coloring, at least one of the $25$ small triangles has vertices of three different colors.

There are $15$ boys and $15$ girls in the class. The first girl is friends with $4$ boys, the second with $5$, the third with $6$, . . . , the $11$th with $14$, and each of the other four girls is friends with all the boys. It turned out that there are exactly $3 \cdot 2^{25}$ ways to split the entire class into pairs, so that each pair has a boy and a girl who are friends. Prove that any of the friends of the first girl are friends with all the other girls too. [i]G.M.Sharafetdinova[/i]