Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds: (i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$ (ii) some plane contains exactly three points from $E.$

Let $n$ be an even positive integer. We say that two different cells of a $n \times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.

For a sequence of integers $a_1 < a_2 < \cdot\cdot\cdot < a_n$, a pair $(a_i,a_j)$ where $1 \leq i < j \leq n$ is said to be [i]balanced[/i] if the number $\frac{a_i+a_j}{2}$ belongs to the sequence. For every natural number $n \geq 3$, find the maximum possible number of balanced pairs in a sequence with $n$ numbers.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

Given a graph $G$, consider the following two quantities, $\bullet$ Assign to each vertex a number in $\{0,1,2\}$ such that for every edge $e=uv$, the numbers assigned to $u$ and $v$ have sum at least $2$. Let $A(G)$ be the minimum possible sum of the numbers written to each vertex satisfying this condition. $\bullet$ Assign to each edge a number in $\{0,1,2\}$ such that for every vertex $v$, the sum of numbers on all edges containing $v$ is at most $2$. Let $B(G)$ be the maximum possible sum of the numbers written to each edge satisfying this condition. Prove that $A(G)=B(G)$ for every graph $G$. [Note: This question is not original] [Extra: Show that this statement is still true if we replace $2$ to $n$, if and only if $n$ is even (where we replace $\{0,1,2\}$ to $\{0,1,\cdots, n\}$)]

Let $M$ be the set of positive odd integers. For every positive integer $n$, denote $A(n)$ the number of the subsets of $M$ whose sum of elements equals $n$. For instance, $A(9) = 2$, because there are exactly two subsets of $M$ with the sum of their elements equal to $9$: $\{9\}$ and $\{1, 3, 5\}$. a) Prove that $A(n) \le A(n + 1)$ for every integer $n \ge 2$. b) Find all the integers $n \ge 2$ such that $A(n) = A(n + 1)$

We are given $1988$ unit cubes. Using some or all of these cubes, we form three quadratic boards $A, B,C$ of dimensions $a \times a \times 1$, $b \times b \times 1$, and $c \times c \times 1$ respectively, where $a \le b \le c$. Now we place board $B$ on board $C$ so that each cube of $B$ is precisely above a cube of $C$ and $B$ does not overlap $C$. Similarly, we place $A$ on $B$. This gives us a three-floor tower. What choice of $a, b$ and $c$ gives the maximum number of such three-floor towers?

Let a [i]lattice tetrahedron[/i] denote a tetrahedron whose vertices have integer coordinates. Given a lattice tetrahedron, a [i]move[/i] consists of picking some vertex and moving it parallel to one of the three edges of the face opposite the vertex so that it lands on a different point with integer coordinates. Prove that any two lattice tetrahedra with the same volume can be transformed into each other by a series of moves

Points $A_1, A_2, \ldots, A_{2022}$ are chosen on a plane so that no three of them are collinear. Consider all angles $A_iA_jA_k$ for distinct points $A_i, A_j, A_k$. What largest possible number of these angles can be equal to $90^\circ$? [i]Proposed by Anton Trygub[/i]

A fraction with $1010$ squares in the numerator and $1011$ squares in the denominator serves as a game board for a two player game. $$\frac{\square + \square +...+ \square}{\square + \square +...+ \square+ \square}$$ Players take turns in moves. In each turn, the player chooses one of the numbers $1, 2,. . . , 2021$ and inserts it in any empty field. Each number can only be used once. The starting player wins if the value of the fraction after all the fields is filled differs from number $1$ by less than $10^{-6}$. Otherwise, the other player wins. Decide which of the players has a winning strategy. (Pavel Šalom)

A robot initially at position $0$ along a number line has a [i]movement function[/i] $f(u, v)$. It rolls a fair $26$-sided die repeatedly, with the $k$-th roll having value $r_k$. For $k \ge 2$, if $r_k > r_{k-1}$, it moves $f(r_k, r_{k-1})$ units in the positive direction. If $r_k < r_{k-1}$, it moves $f(r_k, r_{k-1})$ units in the negative direction. If $r_k = r_{k-1}$, all movement and die-rolling stops and the robot remains at its final position $x$. If $f(u, v) = (u^2 - v^2)^2 + (u - 1)(v + 1)$, compute the expected value of $x$.

A straight road consists of green and red segments in alternating colours, the first and last segment being green. Suppose that the lengths of all segments are more than a centimeter and less than a meter, and that the length of each subsequent segment is larger than the previous one. A grasshopper wants to jump forward along the road along these segments, stepping on each green segment at least once an without stepping on any red segment (or the border between neighboring segments). Prove that the grasshopper can do this in such a way that among the lengths of his jumps no more than $8$ different values occur. [i]Proposed by T. Korotchenko[/i]

[b]p1.[/b] Chad lives on the third floor of an apartment building with ten floors. He leaves his room and goes up two floors, goes down four floors, goes back up five floors, and finally goes down one floor, where he finds Jordan's room. On which floor does Jordan live? [b]p2.[/b] A real number $x$ satisfies the equation $2014x + 1337 = 1337x + 2014$. What is $x$? [b]p3.[/b] Given two points on the plane, how many distinct regular hexagons include both of these points as vertices? [b]p4.[/b] Jordan has six different files on her computer and needs to email them to Chad. The sizes of these files are $768$, $1024$, $2304$, $2560$, $4096$, and $7680$ kilobytes. Unfortunately, the email server holds a limit of $S$ kilobytes on the total size of the attachments per email, where $S$ is a positive integer. It is additionally given that all of the files are indivisible. What is the maximum value of S for which it will take Jordan at least three emails to transmit all six files to Chad? [b]p5.[/b] If real numbers $x$ and $y$ satisfy $(x + 2y)^2 + 4(x + 2y + 2 - xy) = 0$, what is $x + 2y$? [b]p6.[/b] While playing table tennis against Jordan, Chad came up with a new way of scoring. After the first point, the score is regarded as a ratio. Whenever possible, the ratio is reduced to its simplest form. For example, if Chad scores the first two points of the game, the score is reduced from $2:0$ to $1:0$. If later in the game Chad has $5$ points and Jordan has $9$, and Chad scores a point, the score is automatically reduced from $6:9$ to $2:3$. Chad's next point would tie the game at $1:1$. Like normal table tennis, a player wins if he or she is the first to obtain $21$ points. However, he or she does not win if after his or her receipt of the $21^{st}$ point, the score is immediately reduced. Chad and Jordan start at $0:0$ and finish the game using this rule, after which Jordan notes a curiosity: the score was never reduced. How many possible games could they have played? Two games are considered the same if and only if they include the exact same sequence of scoring. [b]p7.[/b] For a positive integer $m$, we define $m$ as a factorial number if and only if there exists a positive integer $k$ for which $m = k \cdot (k - 1) \cdot ... \cdot 2 \cdot 1$. We define a positive integer $n$ as a Thai number if and only if $n$ can be written as both the sum of two factorial numbers and the product of two factorial numbers. What is the sum of the five smallest Thai numbers? [b]p8.[/b] Chad and Jordan are in the Exeter Space Station, which is a triangular prism with equilateral bases. Its height has length one decameter and its base has side lengths of three decameters. To protect their station against micrometeorites, they install a force field that contains all points that are within one decameter of any point of the surface of the station. What is the volume of the set of points within the force field and outside the station, in cubic decameters? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prior to the game John selects an integer greater than $100$. Then Mary calls out an integer $d$ greater than $1$. If John's integer is divisible by $d$, then Mary wins. Otherwise, John subtracts $d$ from his number and the game continues (with the new number). Mary is not allowed to call out any number twice. When John's number becomes negative, Mary loses. Does Mary have a winning strategy?

8.8, 9.8, 11.8 a) 99 boxes contain apples and oranges. Prove that we can choose 50 boxes in such a way that they contain at least half of all apples and half of all oranges. b) 100 boxes contain apples and oranges. Prove that we can choose 34 boxes in such a way that they contain at least a third of all apples and a third of all oranges. c) 100 boxes contain apples, oranges and bananas. Prove that we can choose 51 boxes in such a way that they contain at least half of all apples, and half of all oranges and half of all bananas. ([i]I. Bogdanov, G. Chelnokov, E. Kulikov[/i])

In a chess tournament participated $ 100 $ players. Every player played one game with every other player. For a win $1$ point is given, for loss $ 0 $ and for a draw both players get $0,5$ points. Ion got more points than every other player. Mihai lost only one game, but got less points than every other player. Find all possible values of the difference between the points accumulated by Ion and the points accumulated by Mihai.

The game of Penta is played with teams of five players each, and there are five roles the players can play. Each of the five players chooses two of five roles they wish to play. If each player chooses their roles randomly, what is the probability that each role will have exactly two players?

On a plane $\Pi$ is given a straight line $\ell$ and on the line $\ell$ are given two different points $A_1, A_2$. We consider on the plane $\Pi$, outside the line $\ell$, two different points $A_3, A_4$. Examine if it is possible to put points $A_3$ and $A_4$ on such positions such the four points $A_1, A_2, A_3, A_4$ form the maximal number of possible isosceles triangles, in the following cases: (a) when the points $A_3, A_4$ belong to dierent semi-planes with respect to $\ell$; (b) when the points $A_3, A_4$ belong to the same semi-planes with respect to $\ell$. Give all possible cases and explain how is possible to construct in each case the points $A_3$ and $A_4$.

Alex and Bobby take turns playing the following game on an initially white row of $5000$ cells, with Alex starting first. On her turn, Alex must color two adjacent white cells black. On his turn, Bobby must color either one or three consecutive white cells black. No player can make a move after which there will be a white cell with no adjacent white cell. The game ends when one player cannot make a move (in which case that player loses), or when the entire row is colored black (in which case Alex wins). Who has a winning strategy?

Let $X$ and $Y$ be two sets of points in the plane and $M$ be a set of segments connecting points from $X$ and $Y$ . Let $k$ be a natural number. Prove that the segments from $M$ can be painted using $k$ colors in such a way that for any point $x \in X \cup Y$ and two colors $\alpha$ and $\beta$ $(\alpha \neq \beta)$, the difference between the number of $\alpha$-colored segments and the number of $\beta$-colored segments originating in $X$ is less than or equal to $1$.

Let $M_1, M_2, . . ., M_{11}$ be $5-$element sets such that $M_i \cap M_j \neq {\O}$ for all $i, j \in \{1, . . ., 11\}$. Determine the minimum possible value of the greatest number of the given sets that have nonempty intersection.

Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

The vertices of a regular $2n$-gon ($n \ge 3$) are labelled with the numbers $1,2,...,2n$ so that the sum of the numbers at any two adjacent vertices equals the sum of the numbers at the vertices diametrically opposite to them. Show that this is only possible if $n$ is odd.

In a school there are $40$ different clubs, each of them contains exactly $30$ children. For every $i$ from $1$ to $30$ define $n_i$ as a number of children who attend exactly $i$ clubs. Prove that it is possible to organize $40$ new clubs with $30$ children in each of them such, that the analogical numbers $n_1, n_2,..., n_{30}$ will be the same for them.

The schoolchildren sat down on chairs located in transverse and longitudinal rows. The tallest student was chosen from each transverse row, and the lowest was chosen among them. Then the lowest student was selected from each longitudinal row, and the tallest was chosen among them. Which of these two students is higher?