In a chess tournament there are $n>2$ players. Every two players play against each other exactly once. It is known that exactly $n$ games end as a tie. For any set $S$ of players, including $A$ and $B$, we say that $A$ [i]admires[/i] $B$ [i]in that set [/i]if i) $A$ does not beat $B$; or ii) there exists a sequence of players $C_1,C_2,\ldots,C_k$ in $S$, such that $A$ does not beat $C_1$, $C_k$ does not beat $B$, and $C_i$ does not beat $C_{i+1}$ for $1\le i\le k-1$. A set of four players is said to be [i]harmonic[/i] if each of the four players admires everyone else in the set. Find, in terms of $n$, the largest possible number of harmonic sets.

There are $ n^2$ students in a class. Each week all the students participate in a table quiz. Their teacher arranges them into $ n$ teams of $ n$ players each. For as many weeks as possible, this arrangement is done in such a way that any pair of students who were members of the same team one week are not in the same team in subsequent weeks. Prove that after at most $ n\plus{}2$ weeks, it is necessary for some pair of students to have been members of the same team in at least two different weeks.

Given a binary serie $A=a_1a_2...a_k$ is called "symmetry" if $a_i=a_{k+1-i}$ for all $i=1,2,3,...,k$, and $k$ is the length of that binary serie. If $A=11...1$ or $A=00...0$ then it is called "special". Find all positive integers $m$ and $n$ such that there exist non "special" binary series $A$ (length $m$) and $B$ (length $n$) satisfying when we place them next to each other, we receive a "symmetry" binary serie $AB$

Natural $n \geq 2$ is given. Group of people calls $n-compact$, if for any men from group, we can found $n$ people (without he), each two of there are familiar. Find maximum $N$ such that for any $n-compact$ group, consisting $N$ people contains subgroup from $n+1$ people, each of two of there are familiar.

There is a row of $100$ cells each containing a token. For $1$ dollar it is allowed to interchange two neighbouring tokens. Also it is allowed to interchange with no charge any two tokens such that there are exactly $3$ tokens between them. What is the minimum price for arranging all the tokens in the reverse order? (Egor Bakaev)

Given a checkered rectangle of size n × m. Is it always possible to mark $3$ or $4$ nodes of a rectangle so that at least one of the marked nodes lay on each straight line containing the side of the rectangle, and the non-self-intersecting polygon with vertices at these nodes has an area equal to $$\dfrac{1}{2}\min \left ( \text{gcd}(n, m), \dfrac{n+m}{\text{gcd}(n, m)} \right)$$?

Inside of a square whose side length is $1$ there are a few circles such that the sum of their circumferences is equal to $10$. Show that there exists a line that meets at least four of these circles.

Find the maximum number of $3 \times 5\times 7$ boxes that can be placed inside a $11\times 35\times 39$ box. For the number found, indicate how you would place that number of boxes inside the box.

In a party with $1982$ persons, among any group of four there is at least one person who knows each of the other three. What is the minimum number of people in the party who know everyone else?

One hundred points are marked inside a circle, with no three in a line. Prove that it is possible to connect the points in pairs such that all fifty lines intersect one another inside the circle.

[b]E[/b]ach of the integers $1,2,...,729$ is written in its base-$3$ representation without leading zeroes. The numbers are then joined together in that order to form a continuous string of digits: $12101112202122...$ How many times in this string does the substring $012$ appear?

For a positive integer $N$, we color the positive divisors of $N$ (including 1 and $N$) with four colors. A coloring is called [i]multichromatic[/i] if whenever $a$, $b$ and $\gcd(a, b)$ are pairwise distinct divisors of $N$, then they have pairwise distinct colors. What is the maximum possible number of multichromatic colorings a positive integer can have if it is not the power of any prime?

[b]p1.[/b] (a) Brian has a big job to do that will take him two hours to complete. He has six friends who can help him. They all work at the same rate, somewhat slower than Brian. All seven working together can finish the job in $45$ minutes. How long will it take to do the job if Brian worked with only three of his friends? (b) Brian could do his next job in $N$ hours, working alone. This time he has an unlimited list of friends who can help him, but as he moves down the list, each friend works more slowly than those above on the list. The first friend would take $kN$ ($k > 1$) hours to do the job alone, the second friend would take $k^2N$ hours alone, the third friend would take $k^3N$ hours alone, etc. Theoretically, if Brian could get all his infinite number of friends to help him, how long would it take to complete the job? [b]p2.[/b] (a) The centers of two circles of radius $1$ are two opposite vertices of a square of side $1$. Find the area of the intersection of the two circles. (b) The centers of two circles of radius $1$ are two consecutive vertices of a square of side $1$. Find the area of the intersection of the two circles and the square. (c) The centers of four circles of radius $1$ are the vertices of a square of side $1$. Find the area of the intersection of the four circles. [b]p3.[/b] For any real number$ x$, $[x]$ denotes the greatest integer that does not exceed $x$. For example, $[7.3] = 7$, $[10/3] = 3$, $[5] = 5$. Given natural number $N$, denote as $f(N)$ the following sum of $N$ integers: $$f(N) = [N/1] + [N/2] + [N/3] + ... + [N/n].$$ (a) Evaluate $f(7) - f(6)$. (b) Evaluate $f(35) - f(34)$. (c) Evaluate (with explanation) $f(1996) - f(1995)$. [b]p4.[/b] We will say that triangle $ABC$ is good if it satisfies the following conditions: $AB = 7$, the other two sides are integers, and $\cos A =\frac27$. (a) Find the sides of a good isosceles triangle. (b) Find the sides of a good scalene (i.e. non-isosceles) triangle. (c) Find the sides of a good scalene triangle other than the one you found in (b) and prove that any good triangle is congruent to one of the three triangles you have found. [b]p5.[/b] (a) A bag contains nine balls, some of which are white, the others are black. Two balls are drawn at random from the bag, without replacement. It is found that the probability that the two balls are of the same color is the same as the probability that they are of different colors. How many of the nine balls were of one color and how many of the other color? (b) A bag contains $N$ balls, some of which are white, the others are black. Two balls are drawn at random from the bag, without replacement. It is found that the probability that the two balls are of the same color is the same as the probability that they are of different colors. It is also found that $180 < N < 220$. Find the exact value of $N$ and determine how many of the $N$ balls were of one color and how many of the other color. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a $19 \times 19$ matrix where each component is either $1$ or $-1$. Let $b_i$ be the product of all components in the $i$-th row, and $k_i$ be the product of all components in the $i$-th column, for all $1 \le i \le 19$. Prove that for any such matrix, $b_1 + k_1 + b_2 + k_2 + \cdots + b_{19} + k_{19} \neq 0$.

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

In the plane are given 100 lines such that no 2 are parallel and no 3 meet in a point. The intersection points are marked. Then all the lines and k of the marked points are erased. Given the remained points of intersection for what max k one can reconstruct the lines? [i]Proposed by A. Golovanov[/i]

Let $G$ be a simple graph on the infinite vertex set $V=\{v_1, v_2, v_3,\ldots\}$. Suppose every subgraph of $G$ on a finite vertex subset is $10$-colorable, Prove that $G$ itself is $10$-colorable.

There are $18$ children in the class. Parents decided to give children from this class a cake. To do this, they first learned from each child the area of ​​the piece he wants to get. After that, they showed a square-shaped cake, the area of ​​which is exactly equal to the sum of $18$ named numbers. However, when they saw the cake, the children wanted their pieces to be squares too. The parents cut the cake with lines parallel to the sides of the cake (cuts do not have to start or end on the side of the cake). For what maximum k the parents are guaranteed to cut out $k$ square pieces from the cake, which you can give to $k$ children so that each of them gets what they want?

Can one place positive integers at all vertices of a cube in such a way that for every pair of numbers connected by an edge, one will be divisible by the other , and there are no other pairs of numbers with this property? (A Shapovalov)

Let $n$ and $k$ be positive integers. A function $f : \{1, 2, 3, 4, \dots , kn - 1, kn\} \to \{1, \cdots , 5\}$ is [i]good[/i] if $f(j + k) - f(j)$ is multiple of $k$ for every $j = 1, 2. \cdots , kn - k$. [b](a)[/b] Prove that, if $k = 2$, then the number of good functions is a perfect square for every positive integer $n$. [b](b)[/b] Prove that, if $k = 3$, then the number of good functions is a perfect cube for every positive integer $n$.

A tree with $n\geq 2$ vertices is given. (A tree is a connected graph without cycles.) The vertices of the tree have real numbers $x_1,x_2,\dots,x_n$ associated with them. Each edge is associated with the product of the two numbers corresponding to the vertices it connects. Let $S$ be a sum of number across all edges. Prove that \[\sqrt{n-1}\left(x_1^2+x_2^2+\dots+x_n^2\right)\geq 2S.\] (Author: V. Dolnikov)

A table with three rows and 100 columns is given. Initially, in the left cell of each row there are $400\cdot 3^{100}$ chips. At one move, Petya marks some (but at least one) chips on the table, and then Vasya chooses one of the three rows. After that, all marked chips in the selected row are shifted to the right by a cell, and all marked chips in the other rows are removed from the table. Petya wins if one of the chips goes beyond the right edge of the table; Vasya wins if all the chips are removed. Who has a winning strategy? [i]Proposed by P. Svyatokum, A. Khuzieva and D. Shabanov[/i]

Suppose that $ \mathcal F$ is a family of subsets of $ X$. $ A,B$ are two subsets of $ X$ s.t. each element of $ \mathcal{F}$ has non-empty intersection with $ A, B$. We know that no subset of $ X$ with $ n \minus{} 1$ elements has this property. Prove that there is a representation $ A,B$ in the form $ A \equal{} \{a_1,\dots,a_n\}$ and $ B \equal{} \{b_1,\dots,b_n\}$, such that for each $ 1\leq i\leq n$, there is an element of $ \mathcal F$ containing both $ a_i, b_i$.

Assume that a set $M$ of real numbers is the union of finitely many disjoint intervals with the total length greater than $1$. Prove that $M$ contains a pair of distinct numbers whose difference is an integer.

Geetha wants to cut a cube of size $4 \times 4\times 4$ into $64$ unit cubes (of size $1\times 1\times 1$). Every cut must be straight, and parallel to a face of the big cube. What is the minimum number of cuts that Geetha needs? Note: After every cut, she can rearrange the pieces before cutting again. At every cut, she can cut more than one pieces as long as the pieces are on a straight line.