One writes, initially, the numbers $1,2,3,\dots,10$ in a board. An operation is to delete the numbers $a, b$ and write the number $a+b+\frac{ab}{f(a,b)}$, where $f(a, b)$ is the sum of all numbers in the board excluding $a$ and $b$, one will make this until remain two numbers $x, y$ with $x\geq y$. Find the maximum value of $x$.

A holey triangle is an upward equilateral triangle of side length $n$ with $n$ upward unit triangular holes cut out. A diamond is a $60^\circ-120^\circ$ unit rhombus. Prove that a holey triangle $T$ can be tiled with diamonds if and only if the following condition holds: Every upward equilateral triangle of side length $k$ in $T$ contains at most $k$ holes, for $1\leq k\leq n$. [i]Proposed by Federico Ardila, Colombia [/i]

A polygon has each side integral and each pair of adjacent sides perpendicular (it is not necessarily convex). Show that if it can be covered by non-overlapping $2 x 1$ dominos, then at least one of its sides has even length.

Ten gamblers started playing with the same amount of money. Each turn they cast (threw) five dice. At each stage the gambler who had thrown paid to each of his 9 opponents $\frac{1}{n}$ times the amount which that opponent owned at that moment. They threw and paid one after the other. At the 10th round (i.e. when each gambler has cast the five dice once), the dice showed a total of 12, and after payment it turned out that every player had exactly the same sum as he had at the beginning. Is it possible to determine the total shown by the dice at the nine former rounds ?

Suppose that there are $2001$ golf balls which are numbered from $1$ to $2001$ respectively, and some of these golf balls are placed inside a box. It is known that the difference between the two numbers of any two golf balls inside the box is neither $5$ nor $8$. How many such golf balls the box can contain at most? Justify your answer.

Some points in the plane are either colored red or blue. The distance between two points of the opposite color is at most 1. Prove that there exists a circle with diameter $\sqrt{2}$ such that no two points outside of this circle have same color. It is enough to prove this claim for a finite number of colored points.

A worm is called an [i]adult[/i] if its length is one meter. In one operation, it is possible to cut an adult worm into two (possibly unequal) parts, each of which immediately becomes a worm and begins to grow at a speed of one meter per hour and stops growing once it reaches one meter in length. What is the smallest amount of time in which it is possible to get $n{}$ adult worms starting with one adult worm? Note that it is possible to cut several adult worms at the same time.

Let $S=\{1,2,3,\cdots,100\}$. Find the maximum value of integer $k$, such that there exist $k$ different nonempty subsets of $S$ satisfying the condition: for any two of the $k$ subsets, if their intersection is nonemply, then the minimal element of their intersection is not equal to the maximal element of either of the two subsets.

The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point \(A\). At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path \(AJABCHCHIJA\), which has \(10\) steps. Let \(n\) be the number of paths with \(15\) steps that begin and end at point \(A\). Find the remainder when \(n\) is divided by \(1000\). [asy] unitsize(32); draw(unitcircle); draw(scale(2) * unitcircle); for(int d = 90; d < 360 + 90; d += 72){ draw(2 * dir(d) -- dir(d)); } real s = 4; dot(1 * dir( 90), linewidth(s)); dot(1 * dir(162), linewidth(s)); dot(1 * dir(234), linewidth(s)); dot(1 * dir(306), linewidth(s)); dot(1 * dir(378), linewidth(s)); dot(2 * dir(378), linewidth(s)); dot(2 * dir(306), linewidth(s)); dot(2 * dir(234), linewidth(s)); dot(2 * dir(162), linewidth(s)); dot(2 * dir( 90), linewidth(s)); defaultpen(fontsize(10pt)); real r = 0.05; label("$A$", (1-r) * dir( 90), -dir( 90)); label("$B$", (1-r) * dir(162), -dir(162)); label("$C$", (1-r) * dir(234), -dir(234)); label("$D$", (1-r) * dir(306), -dir(306)); label("$E$", (1-r) * dir(378), -dir(378)); label("$F$", (2+r) * dir(378), dir(378)); label("$G$", (2+r) * dir(306), dir(306)); label("$H$", (2+r) * dir(234), dir(234)); label("$I$", (2+r) * dir(162), dir(162)); label("$J$", (2+r) * dir( 90), dir( 90)); [/asy]

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

(a) Can it happen that in a group of $10$ girls and $9$ boys, ball the girls know a different number of boys while all the boys know the same number of girls? (b) What if there are $11$ girls and $10$ boys? (NB Vassiliev)

Is it possible to color positive integers with three colors so that whenever two numbers with different colors are added, the result of their addition is the third color? (All three colors must be used.) If the answer is yes, indicate a possible coloration; if not, explain why.

At first all $2^n$ rows of a $2^n \times n$ table were filled with all different $n$-tuples of numbers $+1$ and $-1$. Then some of the numbers were replaced by Os. Prove that one can choose a (non-empty) set of rows such that: (a) the sum of all the numbers in all the chosen rows is $0$; (b) the sum of all the chosen rows equals the zero row, that is, the sum of numbers in each column of the chosen rows equals $0$. (G Kondakov, V Chernorutskii)

Let $A_1$, $\ldots$, $A_{2022}$ be the vertices of a regular $2022$-gon in the plane. Alice and Bob play a game. Alice secretly chooses a line and colors all points in the plane on one side of the line blue, and all points on the other side of the line red. Points on the line are colored blue, so every point in the plane is either red or blue. (Bob cannot see the colors of the points.) In each round, Bob chooses a point in the plane (not necessarily among $A_1, \ldots, A_{2022}$) and Alice responds truthfully with the color of that point. What is the smallest number $Q$ for which Bob has a strategy to always determine the colors of points $A_1, \ldots, A_{2022}$ in $Q$ rounds?

Select two distinct diagonals at random from a regular octagon. What is the probability that the two diagonals intersect at a point strictly within the octagon? Express your answer as $a + b$, where the probability is $\tfrac{a}{b}$ and $a$ and $b$ are relatively prime positive integers.

In the plane with coordinates $x,y$, find an example of a convex set $M$ that contains infinitely many lattice points (i.e. points with integer coordinates), but at the same time only finitely many lattice points from $M$ lie on each line in that plane.

[asy] draw((0,1)--(4,1)--(4,2)--(0,2)--cycle); draw((2,0)--(3,0)--(3,3)--(2,3)--cycle); draw((1,1)--(1,2)); label("1",(0.5,1.5)); label("2",(1.5,1.5)); label("32",(2.5,1.5)); label("16",(3.5,1.5)); label("8",(2.5,0.5)); label("6",(2.5,2.5)); [/asy] The image above is a net of a unit cube. Let $n$ be a positive integer, and let $2n$ such cubes are placed to build a $1 \times 2 \times n$ cuboid which is placed on a floor. Let $S$ be the sum of all numbers on the block visible (not facing the floor). Find the minimum value of $n$ such that there exists such cuboid and its placement on the floor so $S > 2011$.

A finite set $\mathcal{L}$ of coplanar lines, no three of which are concurrent, is called [i]odd[/i] if, for every line $\ell$ in $\mathcal{L}$ the total number of lines in $\mathcal{L}$ crossed by $\ell$ is odd. [list=a] [*]Prove that every finite set of coplanar lines, no three of which are concurrent, extends to an odd set of coplanar lines. [*]Given a positive integer $n$ determine the smallest nonnegative integer $k$ satisfying the following condition: Every set of $n$ coplanar lines, no three of which are concurrent, extends to an odd set of $n+k$ coplanar lines. [/list]

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

A $ 4\times 4$ table is divided into $ 16$ white unit square cells. Two cells are called neighbors if they share a common side. A [i]move[/i] consists in choosing a cell and the colors of neighbors from white to black or from black to white. After exactly $ n$ moves all the $ 16$ cells were black. Find all possible values of $ n$.

Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$ [i]Proposed by Igor Voronovich, Belarus[/i]

The world famous infinite hotel with infinitely many floors (where the floors and the rooms on each floor are numbered with the positive integers) is full of guests: each room is occupied by exactly one guest. The manager of the hotel wants to carpet the corridor on each floor, and an infinite set of carpets of finite length (numbered with the positive integers) was obtained. Every guest marked an infinite number of carpets that they liked. Luckily, any two guests living on a different floor share only a finite number of carpets that they both like. Prove that the carpets can be distributed among the floors in a way that for every guest there are only finitely many carpets they like that are placed on floors different from the one where the guest is. [i]Proposed by András Imolay, Budapest[/i]

There are $2n$ people ($n \ge 2$) sitting around the round table, with each person getting to know both with his neighbors and exactly opposite him sits a person he does not know. Prove that people can rearrange in such a way that everyone knows one of their two neighbors.

On the world conference of parties of liars and truth-lovers there were $32$ participants which were sitting in four rows with $8$ chairs each. During a break each participant claimed that among his neighbors (by row or column) there are members of both parties. It is known that liars always lie, whereas truth-lovers always tell truth. What is the smallest number of liars at the conference for which this situation is possible?

[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps? [b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. (a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back. (b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.) [b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. [b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].