At this year's Olympiad, some of the students are friends (friendship is symmetric), however there are also students which are not friends. No matter how the students are partitioned in two contest halls, there are always two friends in different halls. Let $A$ be a fixed student. Show that there exist students $B$ and $C$ such that there are exactly two friendships in the group $\{ A,B,C \}$. [i]Authored by Mirko Petrushevski[/i]

Randy has a deck of $29$ distinct cards. He chooses one of the $29!$ permutations of the deck and then repeatedly rearranges the deck using that permutation until the deck returns to its original order for the first time. What is the maximum number of times Randy may need to rearrange the deck?

There is a set of control weights, each of them weighs a non-integer number of grams. Any integer weight from $1$ g to $40$ g can be balanced by some of these weights (the control weights are on one balance pan, and the measured weight on the other pan).What is the least possible number of the control weights? [i](Alexandr Shapovalov)[/i]

During the class interval, $n$ children sit in a circle and play the game described below. The teacher goes around the children clockwisely and hands out candies to them according to the following regulations: Select a child, give him a candy; and give the child next to the first child a candy too; then skip over one child and give next child a candy; then skip over two children; give the next child a candy; then skip over three children; give the next child a candy;... Find the value of $n$ for which the teacher can ensure that every child get at least one candy eventually (maybe after many circles).

Dexter is running a pyramid scheme. In Dexter's scheme, he hires ambassadors for his company, Lie Ultimate. Any ambassador for his company can recruit up to two more ambassadors (who are not already ambassadors), who can in turn recruit up to two more ambassadors each, and so on (Dexter is a special ambassador that can recruit as many ambassadors as he would like). An ambassador's downline consists of the people they recruited directly as well as the downlines of those people. An ambassador earns executive status if they recruit two new people and each of those people has at least $70$ people in their downline (Dexter is not considered an executive). If there are $2020$ ambassadors (including Dexter) at Lie Ultimate, what is the maximum number of ambassadors with executive status?

A hexagonal table is given, as the one on the drawing, which has $~$ $2012$ $~$ columns. There are $~$ $2012$ $~$ hexagons in each of the odd columns, and there are $~$ $2013$ $~$ hexagons in each of the even columns. The number $~$ $i$ $~$ is written in each hexagon from the $~$ $i$-th column. Changing the numbers in the table is allowed in the following way: We arbitrarily select three adjacent hexagons, we rotate the numbers, and if the rotation is clockwise then the three numbers decrease by one, and if we rotate them counterclockwise the three numbers increase by one (see the drawing below). What's the maximum number of zeros that can be obtained in the table by using the above-defined steps.

There are $n$ students each having $r$ positive integers. Their $nr$ positive integers are all different. Prove that we can divide the students into $k$ classes satisfying the following conditions: (a) $k \le 4r$ (b) If a student $A$ has the number $m$, then the student $B$ in the same class can't have a number $\ell$ such that $(m - 1)! < \ell < (m + 1)! + 1$

Let $n$ be an integer $> 1$. In a circular arrangement of $n$ lamps $L_0, \cdots, L_{n-1}$, each one of which can be either ON or OFF, we start with the situation that all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \cdots$. If $L_{j-1}$ ($j$ is taken mod n) is ON, then $Step_j$ changes the status of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the status of any of the other lamps. If $L_{j-1}$ is OFF, then $Step_j$ does not change anything at all. Show that: [i](a)[/i] There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again. [i](b)[/i] If $n$ has the form $2^k$, then all lamps are ON after $n^2 - 1$ steps. [i](c) [/i]If $n$ has the form $2^k +1$, then all lamps are ON after $n^2 -n+1$ steps.

Two players play the following game. At the outset there are two piles, containing $10,000$ and $20,000$ tokens,respectively . A move consists of removing any positive number of tokens from a single pile $or$ removing $x>0$ tokens from one pile and $y>0$ tokens from the other , where $x+y$ is divisible by $2015$. The player who can not make a move loses. Which player has a winning strategy

Consider a $5\times 5$ grid with $25$ cells. What is the least number of cells that should be colored, such that every $2\times 3$ or $3\times 2$ rectangle in the grid has at least two colored cells?

There are 2009 boxes numbered from 1 to 2009, some of which contain stones. Two players, $ A$ and $ B$, play alternately, starting with $ A$. A move consists in selecting a non-empty box $ i$, taking one or more stones from that box and putting them in box $ i \plus{} 1$. If $ i \equal{} 2009$, the selected stones are eliminated. The player who removes the last stone wins a) If there are 2009 stones in the box 2 and the others are empty, find a winning strategy for either player. b) If there is exactly one stone in each box, find a winning strategy for either player.

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

A convex set $S$ on a plane, not lying on a line, is painted in $p$ colors. Prove that for every $n \ge 3$ there exist infinitely many congruent $n$-gons whose vertices are of the same color.

In a contest, there are $11$ contestants to solve $9$ math problems. After the end of the contest, it was found that any two contestants solved no more than $ 1$ problem together. Find the largest positive integer $k$ such that each problem can be solved by at least $k$ candidates.

Let $P$ be a set of nine points in the Cartesian coordinate plane, no three of which lie on the same line. Call an ordering $\{Q_1, Q_2, \ldots, Q_9\}$ of the points in $P$ [i]special[/i] if there exists a point $C$ in the same plane such that $CQ_1 < CQ_2 < \cdots < CQ_9$. Over all possible sets $P,$ what is the largest possible number of distinct special orderings of $P?$

A $1\times 2019$ board is filled with numbers $1, 2, \dots, 2019$ in an increasing order. In each step, three consecutive tiles are selected, then one of the following operations is performed: $\text{(i)}$ the number in the middle is increased by $2$ and its neighbors are decreased by $1$, or $\text{(ii)}$ the number in the middle is decreased by $2$ and its neighbors are increased by $1$. After several such operations, the board again contains all the numbers $1, 2,\dots, 2019$. Prove that each number is in its original position.

Prove that one can find infinite number of distinct pairs of integers such that every digit of each number is no less than $7$ and the product of two numbers in each pair is also a number with all its digits being no less than $7$. (6)

Consider arrangements of the $9$ numbers $1, 2, 3, \dots, 9$ in a $3 \times 3$ array. For each such arrangement, let $a_1$, $a_2$, and $a_3$ be the medians of the numbers in rows $1$, $2$, and $3$ respectively, and let $m$ be the median of $\{a_1, a_2, a_3\}$. Let $Q$ be the number of arrangements for which $m = 5$. Find the remainder when $Q$ is divided by $1000$.

The integers $1, 2,. . . , n$ are arranged in order so that each value is strictly larger than all values above or is strictly less than all values previous. In how many ways can this be done?

[u]Round 9[/u] [b]p25.[/b] Circle $\omega_1$ has radius $1$ and diameter $AB$. Let circle $\omega_2$ be a circle withm aximum radius such that it is tangent to $AB$ and internally tangent to $\omega_1$. A point $C$ is then chosen such that $\omega_2$ is the incircle of triangle $ABC$. Compute the area of $ABC$. [b]p26.[/b] Two particles lie at the origin of a Cartesian plane. Every second, the first particle moves from its initial position $(x, y)$ to one of either $(x +1, y +2)$ or $(x -1, y -2)$, each with probability $0.5$. Likewise, every second the second particle moves from it’s initial position $(x, y)$ to one of either $(x +2, y +3)$ or $(x -2, y -3)$, each with probability $0.5$. Let $d$ be the distance distance between the two particles after exactly one minute has elapsed. Find the expected value of $d^2$. [b]p27.[/b] Find the largest possible positive integer $n$ such that for all positive integers $k$ with $gcd (k,n) = 1$, $k^2 -1$ is a multiple of $n$. [u]Round 10[/u] [b]p28.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 13$, $BC = 14$, $C A = 15$. Let $H$ be the orthcenter of $\vartriangle ABC$, $M$ be the midpoint of segment $BC$, and $F$ be the foot of altitude from $C$ to $AB$. Let $K$ be the point on line $BC$ such that $\angle MHK = 90^o$. Let $P$ be the intersection of $HK$ and $AB$. Let $Q$ be the intersection of circumcircle of $\vartriangle FPK$ and $BC$. Find the length of $QK$. [b]p29.[/b] Real numbers $(x, y, z)$ are chosen uniformly at random from the interval $[0,2\pi]$. Find the probability that $$\cos (x) \cdot \cos (y)+ \cos(y) \cdot \cos (z)+ \cos (z) \cdot \cos(x) + \sin (x) \cdot \sin (y)+ \sin (y) \cdot \sin (z)+ \sin (z) \cdot \sin (x)+1$$ is positive. [b]p30.[/b] Find the number of positive integers where each digit is either $1$, $3$, or $4$, and the sum of the digits is $22$. [u]Round 11[/u] [b]p31.[/b] In $\vartriangle ABC$, let $D$ be the point on ray $\overrightarrow{CB}$ such that $AB = BD$ and let $E$ be the point on ray $\overrightarrow{AC}$ such that $BC =CE$. Let $L$ be the intersection of $AD$ and circumcircle of $\vartriangle ABC$. The exterior angle bisector of $\angle C$ intersects $AD$ at $K$ and it follows that $AK = AB +BC +C A$. Given that points $B$, $E$, and $L$ are collinear, find $\angle C AB$. [b]p32.[/b] Let $a$ be the largest root of the equation $x^3 -3x^2 +1 0$. Find the remainder when $\lfloor a^{2019} \rfloor$ is divided by $17$. [b]p33.[/b] For all $x, y \in Q$, functions $f , g ,h : Q \to Q$ satisfy $f (x + g (y)) = g (h( f (x)))+ y$. If $f (6)=2$, $g\left( \frac12 \right) = 2$, and $h \left( \frac72 \right)= 2$, find all possible values of $f (2019)$. [u]Round 12[/u] [b]p34.[/b] An $n$-polyomino is formed by joining $n$ unit squares along their edges. A free polyomino is a polyomino considered up to congruence. That is, two free polyominos are the same if there is a combination of translations, rotations, and reflections that turns one into the other. Let $P(n)$ be the number of free $n$-polyominos. For example, $P(3) = 2$ and $P(4) = 5$. Estimate $P(20)+P(19)$. If your estimate is $E$ and the actual value is $A$, your score for this problem will be $$\max \, \left( 0, \left \lfloor 15-10 \cdot \left|\log_{10} \left( \frac{A}{E} \right) \right| \right \rfloor \right).$$ [b]p35.[/b] Estimate $$\sum^{2019}_{k=1} sin(k),$$ where $k$ is measured in radians. If your estimate is $E$ and the actual value is $A$, your score for this problem will be $\max \, (0,15-10 \cdot |E - A|)$ . [b]p36.[/b] For a positive integer $n$, let $r_{10}(n)$ be the number of $10$-tuples of (not necessarily positive) integers $(a_1,a_2,... ,a_9,a_{10})$ such that $$a^2_1 +a^2_2+ ...+a^2_9+a^2_{10}= n.$$ Estimate $r_{10}(20)+r_{10}(19)$. If your estimate is $E$ and the actual value is $A$, your score for this problem will be$$\max \, \left( 0, \left \lfloor 15-10 \cdot \left|\log_{10} \left( \frac{A}{E} \right) \right| \right \rfloor \right).$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165997p28809441]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166012p28809547]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$A$ is the set of points of a convex $n$-gon on a plane. The distinct pairwise distances between any $2$ points in $A$ arranged in descending order is $d_1>d_2>...>d_m>0$. Let the number of unordered pairs of points in $A$ such that their distance is $d_i$ be exactly $\mu _i$, for $i=1, 2,..., m$. Prove: For any positive integer $k\leq m$, $\mu _1+\mu _2+...+\mu _k\leq (3k-1)n$.

Prove that there exists a family $\mathfrak F=\{A_1,A_2,\ldots,A_r\}$ of $m$-element subsets of a given set $\{b_1,b_2,\ldots,b_n\}$ of $n$ elements such that (i) $\left|A_i\cap A_j\right|\le m-2$ for all $A_i,A_j\in\mathfrak F$ with $i\ne j$, and (ii) $r\ge\left\lfloor\frac1n\binom nm\right\rfloor$

Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions: \[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n; \] \[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n. \] [i]Author: Dusan Dukic, Serbia[/i]

Let $\Lambda$ denote the set of points $(x,y)$ in 2D space with integer coordinates such that $0\leq x\leq 4$ and $0\leq y\leq 2$. That is, \[ \Lambda=\{ (x,y) \in \mathbb{Z}^2: 0\leq x\leq 4, \ 0\leq y\leq 2 \}. \] Find the number of ways to connect points of $\Lambda$ with segments of length $\sqrt{2}$ or $\sqrt{5}$ such that the interior of any unit square with vertices in $\Lambda$ contains part of exactly one segment; an example is shown below (connections that differ by reflections are distinct). [asy] unitsize(1cm); dot((0,0)); dot((1,0)); dot((2,0)); dot((3,0)); dot((4,0)); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((4,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); dot((4,2)); draw((0,0)--(1,1)); draw((0,2)--(2,1)); draw((1,1)--(2,0)); draw((2,0)--(3,2)); draw((3,1)--(4,2)); draw((3,0)--(4,1)); [/asy]

In each cell of $5 \times 5$ table there is one number from $1$ to $5$ such that every number occurs exactly once in every row and in every column. Number in one column is [i]good positioned[/i] if following holds: - In every row, every number which is left from [i]good positoned[/i] number is smaller than him, and every number which is right to him is greater than him, or vice versa. - In every column, every number which is above from [i]good positoned[/i] number is smaller than him, and every number which is below to him is greater than him, or vice versa. What is maximal number of good positioned numbers that can occur in this table?