The coach lined up $200$ volleyball players and gave them $m$ balls (each volleyball player could get any number of balls). From time to time, one of the volleyball players throws the ball to another (and he catches it). After a while, it turned out that of any two volleyball players, the left one threw the ball to the right exactly twice, and the right one to the left exactly once. For which minimum $m$ is this possible?

In a country, there are $100$ towns. Some pairs of towns are joined by roads. The roads do not intersect one another except meeting at towns. It is possible to go from any town to any other town by road. Prove that it is possible to pave some of the roads so that the number of paved roads at each town is odd.

We are given a rectangular table with a positive integer written in each of its cells. For each cell of the table, the number in it is equal to the total number of different values in the cells that are in the same row or column (including itself). Find all tables with this property.

There are $200$ boxes on the table. In the beginning, each of the boxes contains a positive integer (the integers are not necessarily distinct). Every minute, Alice makes one move. A move consists of the following. First, she picks a box $X$ which contains a number $c$ such that $c = a + b$ for some numbers $a$ and $b$ which are contained in some other boxes. Then she picks a positive integer $k > 1$. Finally, she removes $c$ from $X$ and replaces it with $kc$. If she cannot make any mobes, she stops. Prove that no matter how Alice makes her moves, she won't be able to make infinitely many moves.

[url=https://artofproblemsolving.com/community/c893771h1861957p12597232]8.1[/url] The point $E$ lies on the base $[AD]$ of the trapezoid $ABCD$. The perimeters of the triangles $ABE, BCE$ and $CDE$ are equal. Prove that $|BC| = |AD|/2$ [b]8.2[/b] In a convex pentagon, the lengths of all sides are equal. Find the point on the longest diagonal from which all sides are visible underneath angles not exceeding a right angle. [url=https://artofproblemsolving.com/community/c893771h1862007p12597620]8.3[/url] Every city in the certain state is connected by airlines with no more than with three other ones, but one can get from every city to every other city changing a plane once only or directly. What is the maximal possible number of the cities? [url=https://artofproblemsolving.com/community/c893771h1861966p12597273]8.4*/7.4*[/url] (asterisk problems in separate posts) [url=https://artofproblemsolving.com/community/c893771h1862002p12597605]8.5[/url] Four different three-digit numbers starting with the same digit have the property that their sum is divisible by three of them without a remainder. Find these numbers. [url=https://artofproblemsolving.com/community/c893771h1861967p12597280]8.6[/url] Given a finite sequence of zeros and ones, which has two properties: a) if in some arbitrary place in the sequence we select five digits in a row and also select five digits in any other place in a row, then these fives will be different (they may overlap); b) if you add any digit to the right of the sequence, then property (a) will no longer hold true. Prove that the first four digits of our sequence coincide with the last four. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988085_1969_leningrad_math_olympiad]here[/url].

A number is written in the each vertex of a cube. It is allowed to add one to two numbers written in the ends of one edge. Is it possible to obtain the cube with all equal numbers if the numbers were initially as on the pictures:

The $4$ code words $$\square * \otimes \,\,\,\, \oplus \rhd \bullet \,\,\,\, * \square \bullet \,\,\,\, \otimes \oslash \oplus$$ they are in some order $$AMO \,\,\,\, SUR \,\,\,\, REO \,\,\,\, MAS$$ Decrypt $$\otimes \oslash \square * \oplus \rhd \square \bullet \otimes $$

In how many ways can we fill the cells of a $m\times n$ board with $+1$ and $-1$ such that the product of numbers on each line and on each column are all equal to $-1$?

Consider a graph $G$ with $n$ vertices and at least $n^2/10$ edges. Suppose that each edge is colored in one of $c$ colors such that no two incident edges have the same color. Assume further that no cycles of size $10$ have the same set of colors. Prove that there is a constant $k$ such that $c$ is at least $kn^\frac{8}{5}$ for any $n$. [i]David Yang.[/i]

We have a 4x4 board.All 1x1 squares are white.A move is changing colours of all squares of a 1x3 rectangle from black to white and from white to black.It is possible to make all the 1x1 squares black after several moves?

In the county some pairs of towns connected by two-way non-stop flight. From any town we can flight to any other (may be not on one flight). Gives, that if we consider any cyclic (i.e. beginning and finish towns match) route, consisting odd number of flights, and close all flights of this route, then we can found two towns, such that we can't fly from one to other. Proved, that we can divided all country on $4$ regions, such that any flight connected towns from other regions.

A convex polygon $\mathcal{P}$ with a center of symmetry $O{}$ is drawn in the plane. Prove that it is possible to place a rhombus in $\mathcal{P}$ whose image following a homothety of factor two centered at $O$ contains $\mathcal{P}$. [i]Proposed by I. Bogdanov, S. Gerdzhikov and N. Nikolov[/i]

Two players play a card game. They have a deck of $n$ distinct cards. About any two cards from the deck know which of them has a different (in this case, if $A$ beats $B$, and $B$ beats $C$, then it may be that $C$ beats $A$). The deck is split between players in an arbitrary manner. In each turn the players over the top card from his deck and one whose card has a card from another player takes both cards and puts them to the bottom of your deck in any order of their discretion. Prove that for any initial distribution of cards, the players can with knowing the location agree and act so that one of the players left without a card. [i]E. Lakshtanov[/i]

Given positive integers $n,k$, $n \ge 2$. Find the minimum constant $c$ satisfies the following assertion: For any positive integer $m$ and a $kn$-regular graph $G$ with $m$ vertices, one could color the vertices of $G$ with $n$ different colors, such that the number of monochrome edges is at most $cm$.

Each cell of an infinite table (infinite in all directions) is colored with one of $n$ given colors. All six cells of any $2\times 3$ (or $3 \times 2$) rectangle have different colors. Find the smallest possible value of $n$.

A square board with $8\text{cm}$ sides is divided into $64$ squares square with each side $1\text{cm}$. Each box can be painted white or black. Find the total number of ways to colour the board so that each square of side $2\text{cm}$ formed by four squares with a common vertex contains two white and two black squares.

A $3\times3$ square is filled with numbers $1;2;3...;9$.The numbers inside four $2\times2$ squares is summed,and arranged in an increasing order. Is it possible to obtain the following sequences as a result of this operation? $\text{a)}$ $24,24,25,25$ $\text{b)}$ $20,23,26,29$

In how many ways can the set $N ={1, 2, \cdots, n}$ be partitioned in the form $p(N) = A_{1}\cup A_{2}\cup \cdots \cup A_{k},$ where $A_{i}$ consists of elements forming arithmetic progressions, all with the same common positive difference $d_{p}$ and of length at least one? At least two? [hide="Solution"] [b]Part 1[/b] Claim: There are $2^{n}-2$ ways of performing the desired partitioning. Let $d(k)$ equal the number of ways $N$ can be partitioned as above with common difference $k.$ We are thus trying to evaluate $\sum_{i=1}^{n-1}d(i)$ [b]Lemma: $d(i) = 2^{n-i}$[/b] We may divide $N$ into various rows where the first term of each row denotes a residue $\bmod{i}.$ The only exception is the last row, as no row starts with $0$; the last row will start with $i.$ We display the rows as such: $1, 1+i, 1+2i, 1+3i, \cdots$ $2, 2+i, 2+2i, 2+3i, \cdots$ $\cdots$ $i, 2i, 3i, \cdots$ Since all numbers have one lowest remainder $\bmod{i}$ and we have covered all possible remainders, all elements of $N$ occur exactly once in these rows. Now, we can take $k$ line segments and partition a given row above; all entries within two segments would belong to the same set. For example, we can have: $1| 1+i, 1+2i, 1+3i | 1+4i | 1+5i, 1+6i, 1+7i, 1+8i,$ which would result in the various subsets: ${1},{1+i, 1+2i, 1+3i},{1+4i},{1+5i, 1+6i, 1+7i, 1+8i}.$ For any given row with $k$ elements, we can have at most $k-1$ segments. Thus, we can arrange any number of segments where the number lies between $0$ and $k-1$, inclusive, in: $\binom{k-1}{0}+\binom{k-1}{1}+\cdots+\binom{k-1}{k-1}= 2^{k-1}$ ways. Applying the same principle to the other rows and multiplying, we see that the result always gives us $2^{n-i},$ as desired. We now proceed to the original proof. Since $d(i) = 2^{n-i}$ by the above lemma, we have: $\sum_{i=1}^{n-1}d(i) = \sum_{i=1}^{n-1}2^{n-i}= 2^{n}-2$ Thus, there are $2^{n}-2$ ways of partitioning the set as desired. [b]Part 2[/b] Everything is the same as above, except the lemma slightly changes to $d(i) = 2^{n-i}-i.$ Evaluating the earlier sum gives us: $\sum_{i=1}^{n-1}d(i) = \sum_{i=1}^{n-1}2^{n-i}-i = 2^{n}-\frac{n(n-1)}{2}-2$ [/hide]

Tracy has been baking a rectangular cake whose surface is dissected by grid lines in square fields. The number of rows is $ 2^n$ and the number of columns is $ 2^{n \plus{} 1}$ where $ n \geq 1, n \in \mathbb{N}.$ Now she covers the fields with strawberries such that each row has at least $ 2n \plus{} 2$ of them. Show that there four pairwise distinct strawberries $ A,B,C$ and $ D$ which satisfy those three conditions: (a) Strawberries $ A$ and $ B$ lie in the same row and $ A$ further left than $ B.$ Similarly $ D$ lies in the same row as $ C$ but further left. (b) Strawberries $ B$ and $ C$ lie in the same column. (c) Strawberries $ A$ lies further up and further left than $ D.$

Cary has six distinct coins in a jar. Occasionally, he takes out three of the coins and adds a dot to each of them. Determine the number of orders in which Cary can choose the coins so that, eventually, for each number $i \in \{0, 1, . . . , 5\}$, some coin has exactly $i$ dots on it.

A squared ${20} \times {20}$ board is split into two-squared dominoes. Prove that some line contains the centers of at least ten of such dominoes. Alexandr Yuran

$21$ bandits live in the city of Warmridge, each of them having some enemies among the others. Initially each bandit has $240$ bullets, and duels with all of his enemies. Every bandit distributes his bullets evenly between his enemies, this means that he takes the same number of bullets to each of his duels, and uses each of his bullets in only one duel. In case the number of his bullets is not divisible by the number of his enemies, he takes as many bullets to each duel as possible, but takes the same number of bullets to every duel, so it is possible that in the end the bandit will have some remaining bullets. Shooting is banned in the city, therefore a duel consists only of comparing the number of bullets in the guns of the opponents, and the winner is whoever has more bullets. After the duel the sheriff takes the bullets of the winner and as an act of protest the loser shoots all of his bullets into the air. What is the largest possible number of bullets the sheriff can have after all of the duels have ended? Being someones enemy is mutual. If two opponents have the same number of bullets in their guns during a duel, then the sheriff takes the bullets of the bandit who has the wider hat among them. Example: If a bandit has $13$ enemies then he takes $18$ bullets with himself to each duel, and they will have $6$ leftover bullets after finishing all their duels.

Prove that for arbitary positive integer $ n\geq 4$, there exists a permutation of the subsets that contain at least two elements of the set $ G_{n} \equal{} \{1,2,3,\cdots,n\}$: $ P_{1},P_{2},\cdots,P_{2^n \minus{} n \minus{} 1}$ such that $ |P_{i}\cap P_{i \plus{} 1}| \equal{} 2,i \equal{} 1,2,\cdots,2^n \minus{} n \minus{} 2.$

A chess tournament had 10 participants. Each round, the participants split into pairs, and each pair played a game. In total, each participant played with every other participant exactly once, and in at least half of the games both the players were from the same town. Prove that during each round there was a game played by two participants from the same town. [i](Boris Frenkin)[/i]

Let S be the set of line segments between any two vertices of a regular $21$-gon. If we select two distinct line segments from $S$ at random, what is the probability they intersect? Note that line segments are considered to intersect if they share a common vertex.