$2024$ people attended a party. Eunson, the host of the party, wanted to make the participant shake hands in pairs. As a professional daydreamer, Eunsun wondered which would be greater: the number of ways each person could shake hands with $4$ others or the number of ways each person could shake hands with $3$ others. Solve Eunsun's peculiar question.

A $8\times 8$ board is given. Seven out of $64$ unit squares are painted black. Suppose that there exists a positive $k$ such that no matter which squares are black, there exists a rectangle (with sides parallel to the sides of the board) with area $k$ containing no black squares. Find the maximum value of $k$.

At CMU, the A and the B buses arrive once every 20 and 18 minutes, respectively. Kevin prefers the A bus but does not want to wait for too long. He commits to the following waiting scheme: he will take the first A bus that arrives, but after waiting for five minutes he will take the next bus that comes, no matter what it is. Determine the probability that he ends up on an A bus.

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

How few numbers is it possible to cross out from the sequence $$1, 2,3,..., 2023$$ so that among those left no number is the product of any two (distinct) other numbers?

Proof that there exist constant $\lambda$, so that for any positive integer $m(\ge 2)$, and any lattice triangle $T$ in the Cartesian coordinate plane, if $T$ contains exactly one $m$-lattice point in its interior(not containing boundary), then $T$ has area $\le \lambda m^3$. PS. lattice triangles are triangles whose vertex are lattice points; $m$-lattice points are lattice points whose both coordinates are divisible by $m$.

In a regular polygon with 100 vertices, 10 vertices are painted blue, and 10 other vertices are painted red. 1. Prove that there exist two distinct blue vertices \( A_1 \) and \( A_2 \), and two distinct red vertices \( R_1 \) and \( R_2 \), such that the distance between \( A_1 \) and \( R_1 \) is equal to the distance between \( A_2 \) and \( R_2 \). 2. Prove that there exist two distinct blue vertices \( A_1 \) and \( A_2 \), and two distinct red vertices \( R_1 \) and \( R_2 \), such that the distance between \( A_1 \) and \( A_2 \) is equal to the distance between \( R_1 \) and \( R_2 \).

Compute the number of ways to arrange $3$ copies of each of the $26$ lowercase letters of the English alphabet such that for any two distinct letters $x_1$ and $x_2,$ the number of $x_2$’s between the first and second occurrences of $x_1$ equals the number of $x_2$’s between the second and third occurrences of $x_1.$

An $n\times n$ chessboard is given, where $n$ is an even positive integer. On every line, the unit squares are to be permuted, subject to the condition that the resulting table has to be symmetric with respect to its main diagonal (the diagonal from the top-left corner to the bottom-right corner). We say that a board is [i]alternative[/i] if it has at least one pair of complementary lines (two lines are complementary if the unit squares on them which lie on the same column have distinct colours). Otherwise, we call the board [i]nonalternative[/i]. For what values of $n$ do we always get from the $n\times n$ chessboard an alternative board?\\ \\ [i](Alexandru Petrescu and Andra Elena Mircea)[/i]

A sequence of positive integers is given such that the sum of any $6$ consecutive terms does not exceed $11$. Prove that for any positive integer $a$ in the sequence one can find consecutive terms with sum $a$

We are given a hexagon with a number written on each of its sides and vertices. Each number on a vertex is equal to the sum of the two numbers on neighbouring sides. Assume all numbers of the sides and one vertex number were erased. Is it possible to find out the number that had been erased from a vertex? (Folklore)

Find all integers $n$ for which each cell of $n \times n$ table can be filled with one of the letters $I,M$ and $O$ in such a way that: [LIST] [*] in each row and each column, one third of the entries are $I$, one third are $M$ and one third are $O$; and [/*] [*]in any diagonal, if the number of entries on the diagonal is a multiple of three, then one third of the entries are $I$, one third are $M$ and one third are $O$.[/*] [/LIST] [b]Note.[/b] The rows and columns of an $n \times n$ table are each labelled $1$ to $n$ in a natural order. Thus each cell corresponds to a pair of positive integer $(i,j)$ with $1 \le i,j \le n$. For $n>1$, the table has $4n-2$ diagonals of two types. A diagonal of first type consists all cells $(i,j)$ for which $i+j$ is a constant, and the diagonal of this second type consists all cells $(i,j)$ for which $i-j$ is constant.

Let $\mathcal{F}$ be the set of all the functions $f : \mathcal{P}(S) \longrightarrow \mathbb{R}$ such that for all $X, Y \subseteq S$, we have $f(X \cap Y) = \min (f(X), f(Y))$, where $S$ is a finite set (and $\mathcal{P}(S)$ is the set of its subsets). Find \[\max_{f \in \mathcal{F}}| \textrm{Im}(f) |. \]

One country consists of islands $A_1,A_2,\cdots,A_N$,The ministry of transport decided to build some bridges such that anyone will can travel by car from any of the islands $A_1,A_2,\cdots,A_N$ to any another island by one or more of these bridges. For technical reasons the only bridges that can be built is between $A_i$ and $A_{i+1}$ where $i = 1,2,\cdots,N-1$ , and between $A_i$ and $A_N$ where $i<N$. We say that a plan to build some bridges is good if it is satisfies the above conditions , but when we remove any bridge it will not satisfy this conditions. We assume that there is $a_N$ of good plans. Observe that $a_1 = 1$ (The only good plan is to not build any bridge) , and $a_2 = 1$ (We build one bridge). 1-Prove that $a_3 = 3$ 2-Draw at least $5$ different good plans in the case that $N=4$ and the islands are the vertices of a square 3-Compute $a_4$ 4-Compute $a_6$ 5-Prove that there is a positive integer $i$ such that $1438$ divides $a_i$

For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).

Let $A$ and $B$ be the number of odd positive integers $n<1000$ for which the number formed by the last three digits of $n^{2015}$ is greater and smaller than $n$, respectively. Prove that $A=B$.

Call a set $S$ [i]product-free[/i] if there do not exist $a, b, c \in S$ (not necessarily distinct) such that $a b = c$. For example, the empty set and the set $\{16, 20\}$ are product-free, whereas the sets $\{4, 16\}$ and $\{2, 8, 16\}$ are not product-free. Find the number of product-free subsets of the set $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$.

A set of lines in the plan is called [i]nice [/i]i f every line in the set intersects an odd number of other lines in the set. Determine the smallest integer $k \ge 0$ having the following property: for each $2018$ distinct lines $\ell_1, \ell_2, ..., \ell_{2018}$ in the plane, there exist lines $\ell_{2018+1},\ell_{2018+2}, . . . , \ell_{2018+k}$ such that the lines $\ell_1, \ell_2, ..., \ell_{2018+k}$ are distinct and form a [i]nice [/i] set.

You are given $2024$ yellow and $2024$ blue points on the plane, and no three of the points are on the same line. We call a pair of nonnegative integers $(a, b)$ [i]good[/i] if there exists a half-plane with exactly $a$ yellow and $b$ blue points. Find the smallest possible number of good pairs. The points that lie on the line that is the boundary of the half-plane are considered to be outside the half-plane. [i]Proposed by Anton Trygub[/i]

A cube of edge $2$ with one of the corner unit cubes removed is called a [i]piece[/i]. Prove that if a cube $T$ of edge $2^n$ is divided into $2^{3n}$ unit cubes and one of the unit cubes is removed, then the rest can be cut into [i]pieces[/i].

Three grasshoppers $A$, $B$ and $C$ are placed on a line. Grasshopper $B$ sits at the midpoint between $A$ and $C$. Every second, one of the grasshoppers jumps over one of the others to the symmetrical point on the other side (if $X$ jumps over $Y$ to point $X'$, then $XY $= $YX'$). After several jumps it so happened that they returned to the three initial points (but maybe in different order). Prove that in this case $B$ returns to his initial middle position. (AK Kovaldzhy)

In a club, there are $n$ members, and they are deciding some sport training sessions, satisfying all of these requirements: [i]i)[/i] Each member attends in all training sessions; [i]ii)[/i] At each training sessions, the club are divided into $3$ groups: swimming group, cycling group, running group (each member joins exactly $1$ group and each group consists of at least $1$ person); [i]iii)[/i] For any $2$ members of the club, we can find at least $1$ session such that there are $2$ people that are not in the same group. a) Assume that $n=9$. We know that the club has ran $1$ training session and it will run $1$ more session. How many ways to divide the group for the second training session? b) Assume that $n=2022$. Find the minimum number of training sessions that the club have to run?

Let $n$ be a positive integer. Determine the size of the largest subset of $\{ -n, -n+1, \dots, n-1, n\}$ which does not contain three elements $a$, $b$, $c$ (not necessarily distinct) satisfying $a+b+c=0$.

Let $n \geq 2$ be a positive integer. Let $\mathcal{R}$ be a connected set of unit squares on a grid. A [i]bar[/i] is a rectangle of length or width $1$ which is fully contained in $\mathcal{R}$. A bar is [i]special[/i] if it is not fully contained within any larger bar. Given that $\mathcal{R}$ contains special bars of sizes $1 \times 2,1 \times 3,\ldots,1 \times n$, find the smallest possible number of unit squares in $\mathcal{R}$. [i]Srinivas Arun[/i]

Andy, Bess, Charley and Dick play on a $1000 \times 1000$ board. They make moves in turn: Andy first, then Bess, then Charley and finally Dick, after that Andy moves again and so on. At each move a player must paint several unpainted squares forming $2 \times 1, 1 \times 2, 1 \times 3$, or $3 \times 1$ rectangle. The player that cannot move loses. Prove that some three players can cooperate to make the fourth player lose.