Each of $K$ friends simultaneously learns one different item of news. They begin to phone one another to tell them their news. Each conversation lasts exactly one hour, during which time it is possible for two friends to tell each other all of their news. What is the minimum number of hours needed in order for all of the friends to know all of the news? Consider in this problem: (a) $K = 64$. (b) $K = 55$. (c) $K = 100$. (A Andjans, Riga) PS. (a) was the junior problem, (a),(b),(c) the senior one

Misha and Sahsa play a game on a $100\times 100$ chessboard. First, Sasha places $50$ kings on the board, and Misha places a rook, and then they move in turns, as following (Sasha begins): At his move, Sasha moves each of the kings one square in any direction, and Misha can move the rook on the horizontal or vertical any number of squares. The kings cannot be captured or stepped over. Sasha's purpose is to capture the rook, and Misha's is to avoid capture. Is there a winning strategy available for Sasha?

A tennis tournament has $n>2$ players and any two players play one game against each other (ties are not allowed). After the game these players can be arranged in a circle, such that for any three players $A,B,C$, if $A,B$ are adjacent on the circle, then at least one of $A,B$ won against $C$. Find all possible values for $n$.

Any two members of a club with $3n+1$ people plays ping-pong, tennis or chess with each other. Everyone has exactly $n$ partners who plays ping-pong, $n$ who play tennis and $n$ who play chess. Prove that we can choose three members of the club who play three different games amongst each other.

Prove that for each natural number $k$ there exists a natural number $n(k)$, such that for each $m\geq n(k)$ and each set $M$ of $m$ points in the plane, there can be chosen $k$ triangles, so that each has an angle greater than $120^\circ$.

$a_1,a_2,\cdots ,a_n,b_1,b_2,\cdots ,b_n$ are $2n$ positive real numbers such that $a_1,a_2,\cdots ,a_n$ aren't all equal. And assume that we can divide $a_1,a_2,\cdots ,a_n$ into two subsets with equal sums.similarly $b_1,b_2,\cdots ,b_n$ have these two conditions. Prove that there exist a simple $2n$-gon with sides $a_1,a_2,\cdots ,a_n,b_1,b_2,\cdots ,b_n$ and parallel to coordinate axises Such that the lengths of horizontal sides are among $a_1,a_2,\cdots ,a_n$ and the lengths of vertical sides are among $b_1,b_2,\cdots ,b_n$.(simple polygon is a polygon such that it doesn't intersect itself)

Let $S$ be a positive integer divisible by all the integers $1, 2,...,2015$ and $a_1, a_2,..., a_k$ numbers in $\{1, 2,...,2015\}$ such that $2S \le a_1 + a_2 + ... + a_k$. Prove that we can select from $a_1, a_2,..., a_k$ some numbers so that the sum of these selected numbers is equal to $S$. Lê Anh Vinh

A game is played on a $1 \times 1000$ board. There are n chips, all of which are initially in a box near the board. Two players move in turn. The first may choose $17$ chips or less, from either on or off the board. She then puts them into unoccupied cells on the board so that there is no more than one chip in each of the cells. The second player may take off the board any number of chips occupying consecutive cells and put them back in the box. The first player wins if she can put all n chips on the board so that they occupy consecutive cells. (a) Show that she can win if $n = 98$. (b) For what maximal value of $n$ can she win? (A Shapovalov)

Students have taken a test paper in each of $n \ge 3$ subjects. It is known that in any subject exactly three students got the best score, and for any two subjects exactly one student got the best scores in both subjects. Find the smallest $n$ for which the above conditions imply that exactly one student got the best score in each of the $n$ subjects.

Helena and Luis are going to play a game with two bags with marbles. They play alternately and on each turn they can do one and only one of the following moves: [list] Take out a marble from one bag. Take out a marble from each bag. Take out a marble from one bag and then put it into the other bag. [/list] The player who leaves both bags empty wins the game. Before starting the game, Helena counted out the marbles of each bag and said to Luis: "You may start!", while she thought "I will certainly win...". What are the possible distributions of the marbles in the bags?

On the grid plane all possible broken lines with the following properties are constructed: each of them starts at the point $(0, 0)$, has all its vertices at integer points, each linear segment goes either up or to the right along the grid lines. For each such broken line consider the corresponding [i]worm[/i], the subset of the plane consisting of all the cells that share at least one point with the broken line. Prove that the number of worms that can be divided into dominoes (rectangles $2\times 1$ and $1\times 2$) in exactly $n > 2$ different ways, is equal to the number of positive integers that are less than n and relatively prime to $n$. (Ilke Chanakchi, Ralf Schiffler)

There are $2019$ coins on a table. Some are placed with head up and others tail up. A group of $2019$ persons perform the following operations: the first person chooses any one coin and then turns it over, the second person choses any two coins and turns them over and so on and the $2019$-th person turns over all the coins. Prove that no matter which sides the coins are up initially, the $2019$ persons can come up with a procedure for turning the coins such that all the coins have smae side up at the end of the operations.

On a $5\times 5$ chessboard, two players play the following game: The first player places a knight on some square. Then the players alternately move the knight according to the rules of chess, starting with the second player. It is not allowed to move the knight to a square that was visited previously. The player who cannot move loses. Which of the two players has a winning strategy?

At least how many regular triangles are needed to cover the lines of the following diagram? [img]https://cdn.artofproblemsolving.com/attachments/e/3/4de2ed2c7cc9421d7d060f0bc537ccaa3838fc.png[/img] (Only the perimeter of the triangles is involved in the covering, and the entire perimeter need not be incident on the diagram.)

The grid shown below is completed by choosing nine of the following numbers without repeating: $4, 5, 6, 7, 8, 12, 13, 16, 18, 19$. If the sum of the five rows are equal to each other and the sum of the three columns are equal to each other, in how many different ways is it possible to fill the grid? $ \[\begin {array} {| c | c | c |} \hline 10 & & \\ \hline & & 9 \\ \hline & 3 & \\ \hline 11 & & 17 \\ \hline & 20 & \\ \hline \end {array} \] $ Note: The sum of the rows and the sum of the columns are not necessarily equal.

Let $ G$ be a simple graph with $ 2 \cdot n$ vertices and $ n^{2}+1$ edges. Show that this graph $ G$ contains a $ K_{4}-\text{one edge}$, that is, two triangles with a common edge.

Consider a grid with $n{}$ lines and $m{}$ columns $(n,m\in\mathbb{N},m,n\ge2)$ made of $n\cdot m \; 1\times1$ squares called ${cells}$. A ${snake}$ is a sequence of cells with the following properties: the first cell is on the first line of the grid and the last cell is on the last line of the grid, starting with the second cell each has a common side with the previous cell and is not above the previous cell. Define the ${length}$ of a snake as the number of cells it's made of. Find the arithmetic mean of the lengths of all the snakes from the grid.

On each step of a ladder with $10$ steps there is a frog. Each of them can, in one jump, be placed on another step, but when it does, at the same time, another frog will jump the same number of steps in the opposite direction: one goes up and another goes down. Will the frogs manage to get all together on the same step?

A partition of a set \( A \) is a family of non-empty subsets of \( A \), such that any two distinct subsets in the family are disjoint, and the union of all subsets equals \( A \). We say that a partition of a set of integers \( B \) is [i]separated[/i] if each subset in the partition does [b]not[/b] contain consecutive integers. Prove that, for every positive integer \( n \), the number of partitions of the set \( \{1, 2, \dots, n\} \) is equal to the number of separated partitions of the set \( \{1, 2, \dots, n+1\} \). For example, \( \{\{1,3\}, \{2\}\} \) is a separated partition of the set \( \{1,2,3\} \). On the other hand, \( \{\{1,2\}, \{3\}\} \) is a partition of the same set, but it is not separated since \( \{1,2\} \) contains consecutive integers.

Every point in the plane was colored in red or blue. Prove that one the two following statements is true: $\bullet$ there exist two red points at distance $1$ from each other; $\bullet$ there exist four blue points $B_1$, $B_2$, $B_3$, $B_4$ such that the points $B_i$ and $B_j$ are at distance $|i - j|$ from each other, for all integers $i $ and $j$ such as $1 \le i \le 4$ and $1 \le j \le 4$.

A sequence of $A$s and $B$s is called [i]antipalindromic [/i] if writing it backwards, then turning all the $A$s into $B$s and vice versa, produces the original sequence. For example $ABBAAB$ is antipalindromic. For any sequence of $A$s and $B$s we define the cost of the sequence to be the product of the positions of the $A$s. For example, the string $ABBAAB$ has cost $1\cdot 4 \cdot 5 = 20$. Find the sum of the costs of all antipalindromic sequences of length $2020$.

Inside a convex $1000$-gon, $500$ points are selected so that no three of the $1500$ points — the ones selected and the vertices of the polygon — lie on the same straight line. This $1000$-gon is then divided into triangles so that all $1500$ points are vertices of the triangles, and so that these triangles have no other vertices. How many triangles will there be?

Yasha writes in the cells of the table $99 \times 99$ all positive integers from 1 to $99^2$ (each number once). Grisha looks at the table and selects several cells, among which there are no two cells sharing a common side, and then sums up the numbers in all selected cells. Find the largest sum Grisha can guarantee to achieve.

[b]p1.[/b] Find all solutions $a, b, c, d, e, f, g$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccccc} & & & a & b & c & d \\ x & & & & & a & b \\ \hline & & c & d & b & d & b \\ + & c & e & b & f & b & \\ \hline & c & g & a & e & g & b \\ \end{tabular}$ [b]p2.[/b] $5$ numbers are placed on the circle. It is known that the sum of any two neighboring numbers is not divisible by $3$ and the sum of any three consecutive numbers is not divisible by $3$. How many numbers on the circle are divisible by $3$? [b]p3.[/b] $n$ teams played in a volleyball tournament. Each team played precisely one game with all other teams. If $x_j$ is the number of victories and $y_j$ is the number of losses of the $j$th team, show that $$\sum^n_{j=1}x^2_j=\sum^n_{j=1} y^2_j $$ [b]p4.[/b] Three cars participated in the car race: a Ford $[F]$, a Toyota $[T]$, and a Honda $[H]$. They began the race with $F$ first, then $T$, and $H$ last. During the race, $F$ was passed a total of $3$ times, $T$ was passed $5$ times, and $H$ was passed $8$ times. In what order did the cars finish? [b]p5.[/b] The side of the square is $4$ cm. Find the sum of the areas of the six half-disks shown on the picture. [img]https://cdn.artofproblemsolving.com/attachments/c/b/73be41b9435973d1c53a20ad2eb436b1384d69.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A positive integer is [i]brazilian[/i] if the first digit and the last digit are equal. For instance, $4$ and $4104$ are brazilians, but $10$ is not brazilian. A brazilian number is [i]superbrazilian[/i] if it can be written as sum of two brazilian numbers. For instance, $101=99+2$ and $22=11+11$ are superbrazilians, but $561=484+77$ is not superbrazilian, because $561$ is not brazilian. How many $4$-digit numbers are superbrazilians?