In a group of interpreters each one speaks one of several foreign languages, 24 of them speak Japanese, 24 Malaysian, 24 Farsi. Prove that it is possible to select a subgroup in which exactly 12 interpreters speak Japanese, exactly 12 speak Malaysian and exactly 12 speak Farsi.

Given positive integers $d \ge 3$, $r>2$ and $l$, with $2d \le l <rd$. Every vertice of the graph $G(V,E)$ is assigned to a positive integer in $\{1,2,\cdots,l\}$, such that for any two consecutive vertices in the graph, the integers they are assigned to, respectively, have difference no less than $d$, and no more than $l-d$. A proper coloring of the graph is a coloring of the vertices, such that any two consecutive vertices are not the same color. It's given that there exist a proper subset $A$ of $V$, such that for $G$'s any proper coloring with $r-1$ colors, and for an arbitrary color $C$, either all numbers in color $C$ appear in $A$, or none of the numbers in color $C$ appear in $A$. Show that $G$ has a proper coloring within $r-1$ colors.

Grasshopper Gerald and his 2020 friends play leapfrog on a plane as follows. At each turn Gerald jumps over a friend so that his original point and his resulting point are symmetric with respect to this friend. Gerald wants to perform a series of jumps such that he jumps over each friend exactly once. Let us say that a point is achievable if Gerald can finish the 2020th jump in it. What is the maximum number $N{}$ such that for some initial placement of the grasshoppers there are just $N{}$ achievable points? [i]Mikhail Svyatlovskiy[/i]

On the two sides of the road two lines of trees are planted. On every tree, the number of oaks among itself and its neighbors is written. (For the first and last trees, this is the number of oaks among itself and its only neighbor). Prove that if the two sequences of numbers on the trees are equal, then sequnces of trees on the two sides of the road are equal [I]Proposed by A. Khrabrov, D. Rostovski[/i]

Prove that for every $n \in N$, $n > 6$, every equilateral triangle can be divided into $n$ pieces, which are also equilateral triangles.

A pack of $2008$ cards, numbered from $1$ to $2008$, is shuffled in order to play a game in which each move has two steps: (i) the top card is placed at the bottom; (ii) the new top card is removed. It turns out that the cards are removed in the order $1,2,\dots,2008$. Which card was at the top before the game started?

Let n be an integer at least 4. In a convex n-gon, there is NO four vertices lie on a same circle. A circle is called circumscribed if it passes through 3 vertices of the n-gon and contains all other vertices. A circumscribed circle is called boundary if it passes through 3 consecutive vertices, a circumscribed circle is called inner if it passes through 3 pairwise non-consecutive points. Prove the number of boundary circles is 2 more than the number of inner circles.

Bart, Lisa and Maggie play the following game: Bart colors finitely many points red or blue on a circle such that no four colored points can be chosen on the circle such that their colors are blue-red-blue-red (the four points do not have to be consecutive). Lisa chooses finitely many of the colored points. Now Bart gives the circle (possibly rotated) to Maggie with Lisa's chosen points, however, without their colors. Finally, Maggie colors all the points of the circle to red or blue. Lisa and Maggie wins the game, if Maggie correctly guessed the colors of Bart's points. A strategy of Lisa and Maggie is called a winning strategy, if they can win the game for all possible colorings by Bart. Prove that Lisa and Maggie have a winning strategy, where Lisa chooses at most $c$ points in all possible cases, and find the smallest possible value of $c$. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

There is an integer $n > 1$. There are $n^2$ stations on a slope of a mountain, all at different altitudes. Each of two cable car companies, $A$ and $B$, operates $k$ cable cars; each cable car provides a transfer from one of the stations to a higher one (with no intermediate stops). The $k$ cable cars of $A$ have $k$ different starting points and $k$ different finishing points, and a cable car which starts higher also finishes higher. The same conditions hold for $B$. We say that two stations are linked by a company if one can start from the lower station and reach the higher one by using one or more cars of that company (no other movements between stations are allowed). Determine the smallest positive integer $k$ for which one can guarantee that there are two stations that are linked by both companies. [i]Proposed by Tejaswi Navilarekallu, India[/i]

Let $S=\{(x,y,z)\in \mathbb{Z}^3\}$ the set of points with integer coordinates in the space. Gugu has infinitely many solid spheres. All with radii $\ge (\frac{\pi}2)^3$. Is it possible for Gugu to cover all points of $S$ with his spheres?

For a convex polygon (i.e. all angles less than $180^\circ$) call a diagonal [i]bisector[/i] if its bisects both area and perimeter of the polygon. What is the maximum number of bisector diagonals for a convex pentagon? [i]Proposed by Morteza Saghafian[/i]

$13.$ At a party, each man danced with exactly four women and each woman danced with exactly three men. Nine men attended the party. How many women attended the party $?$

On a right triangle of paper, two points $A$ and $B$ have been painted. You have scissors and you have the right to make cuts (on paper) as follows: cut through a height of the given triangle. In doing so, remove, without the respective altitude, one of the two triangles and continue the process. Prove that after a finite number of cuts you can separate points $A$ and $B$ leaving one of them outside the remaining triangles.

$2009$ points have been marked on a circle. Lucía colors them with $7$ different colors of her choice. Then Ivan can join three points of the same color, thus forming monochrome triangles. Triangles cannot have points in common; not even vertices in common. Ivan's goal is to draw as many monochrome triangles as possible. Lucía's objective is to prevent Iván's task as much as possible through a good choice of colouring. How many monochrome triangles will Ivan get if they both do their homework to the best of their ability?

Sasha has $10$ cards with numbers $1, 2, 4, 8,\ldots, 512$. He writes the number $0$ on the board and invites Dima to play a game. Dima tells the integer $0 < p < 10, p$ can vary from round to round. Sasha chooses $p$ cards before which he puts a “$+$” sign, and before the other cards he puts a “$-$" sign. The obtained number is calculated and added to the number on the board. Find the greatest absolute value of the number on the board Dima can get on the board after several rounds regardless Sasha’s moves.

$ 2007^2$ unit squares are arranged forming a $ 2007\times 2007$ table. Arnold and Bernold play the following game: each move by Arnold consists of taking four unit squares that forms a $ 2\times 2$ square; each move by Bernold consists of taking a single unit square. They play anternatively, Arnold being the first. When Arnold is not able to perform his move, Bernold takes all the remaining unit squares. The person with more unit squares in the end is the winner. Is it possible to Bernold to win the game, no matter how Arnold play?

With pearls of different colours form necklaces, it is said that a necklace is [i]prime[/i] if it cannot be decomposed into strings of pearls of the same length, and equal to each other. Let $n$ and $q$ be positive integers. Prove that the number of prime necklaces with $n$ beads, each of which has one of the $q^n$ possible colours, is equal to $n$ times the number of prime necklaces with $n^2$ pearls, each of which has one of $q$ possible colours. Note: two necklaces are considered equal if they have the same number of pearls and you can get the same colour on both necklaces, rotating one of them to match it to the other.

[u]Round 5[/u] [b]p13.[/b] Five different schools are competing in a tournament where each pair of teams plays at most once. Four pairs of teams are randomly selected and play against each other. After these four matches, what is the probability that Chad's and Jordan's respective schools have played against each other, assuming that Chad and Jordan come from different schools? [b]p14.[/b] A square of side length $1$ and a regular hexagon are both circumscribed by the same circle. What is the side length of the hexagon? [b]p15.[/b] From the list of integers $1,2, 3,...,30$ Jordan can pick at least one pair of distinct numbers such that none of the $28$ other numbers are equal to the sum or the difference of this pair. Of all possible such pairs, Jordan chooses the pair with the least sum. Which two numbers does Jordan pick? [u]Round 6[/u] [b]p16.[/b] What is the sum of all two-digit integers with no digit greater than four whose squares also have no digit greater than four? [b]p17.[/b] Chad marks off ten points on a circle. Then, Jordan draws five chords under the following constraints: $\bullet$ Each of the ten points is on exactly one chord. $\bullet$ No two chords intersect. $\bullet$ There do not exist (potentially non-consecutive) points $A, B,C,D,E$, and $F$, in that order around the circle, for which $AB$, $CD$, and $EF$ are all drawn chords. In how many ways can Jordan draw these chords? [b]p18.[/b] Chad is thirsty. He has $109$ cubic centimeters of silicon and a 3D printer with which he can print a cup to drink water in. He wants a silicon cup whose exterior is cubical, with five square faces and an open top, that can hold exactly $234$ cubic centimeters of water when filled to the rim in a rectangular-box-shaped cavity. Using all of his silicon, he prints a such cup whose thickness is the same on the five faces. What is this thickness, in centimeters? [u]Round 7[/u] [b]p19.[/b] Jordan wants to create an equiangular octagon whose side lengths are exactly the first $8$ positive integers, so that each side has a different length. How many such octagons can Jordan create? [b]p20.[/b] There are two positive integers on the blackboard. Chad computes the sum of these two numbers and tells it to Jordan. Jordan then calculates the sum of the greatest common divisor and the least common multiple of the two numbers, and discovers that her result is exactly $3$ times as large as the number Chad told her. What is the smallest possible sum that Chad could have said? [b]p21.[/b] Chad uses yater to measure distances, and knows the conversion factor from yaters to meters precisely. When Jordan asks Chad to convert yaters into meters, Chad only gives Jordan the result rounded to the nearest integer meters. At Jordan's request, Chad converts $5$ yaters into $8$ meters and $7$ yaters into $12$ meters. Given this information, how many possible numbers of meters could Jordan receive from Chad when requesting to convert $2014$ yaters into meters? [u]Round 8[/u] [b]p22.[/b] Jordan places a rectangle inside a triangle with side lengths $13$, $14$, and $15$ so that the vertices of the rectangle all lie on sides of the triangle. What is the maximum possible area of Jordan's rectangle? [b]p23.[/b] Hoping to join Chad and Jordan in the Exeter Space Station, there are $2014$ prospective astronauts of various nationalities. It is given that $1006$ of the astronaut applicants are American and that there are a total of $64$ countries represented among the applicants. The applicants are to group into $1007$ pairs with no pair consisting of two applicants of the same nationality. Over all possible distributions of nationalities, what is the maximum number of possible ways to make the $1007$ pairs of applicants? Express your answer in the form $a \cdot b!$, where $a$ and $b$ are positive integers and $a$ is not divisible by $b + 1$. Note: The expression $k!$ denotes the product $k \cdot (k - 1) \cdot ... \cdot 2 \cdot 1$. [b]p24.[/b] We say a polynomial $P$ in $x$ and $y$ is $n$-[i]good [/i] if $P(x, y) = 0$ for all integers $x$ and $y$, with $x \ne y$, between $1$ and $n$, inclusive. We also define the complexity of a polynomial to be the maximum sum of exponents of $x$ and $y$ across its terms with nonzero coeffcients. What is the minimal complexity of a nonzero $4$-good polynomial? In addition, give an example of a $4$-good polynomial attaining this minimal complexity. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2915803p26040550]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Ten coins are placed in a circle, showing “heads” (the tails are down). Two moves are allowed: (a) turn over four consecutively placed coins; (b) turn over four coins placed as $XX OXX$ ($X$ is one of the coins to be turned over, $O$ is not touched). Is it possible to have all ten coins showing “tails” after a finite sequence of such moves? (A Tolpygo)

Every cell of a $2017\times 2017$ grid is colored either black or white, such that every cell has at least one side in common with another cell of the same color. Let $V_1$ be the set of all black cells, $V_2$ be the set of all white cells. For set $V_i (i=1,2)$, if two cells share a common side, draw an edge with the centers of the two cells as endpoints, obtaining graphs $G_i$. If both $G_1$ and $G_2$ are connected paths (no cycles, no splits), prove that the center of the grid is one of the endpoints of $G_1$ or $G_2$.

Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.

Each of the small squares of a $50\times 50$ table is coloured in red or blue. Initially all squares are red. A [i]step[/i] means changing the colour of all squares on a row or on a column. a) Prove that there exists no sequence of steps, such that at the end there are exactly $2011$ blue squares. b) Describe a sequence of steps, such that at the end exactly $2010$ squares are blue. [i]Adriana & Lucian Dragomir[/i]

Rectangles $1\times20$, $1\times 19$, ..., $1\times 1$ were cut out of $20\times20$ table. Prove that from the remaining part of the table $36$ $1\times2$ dominos can be cut [I]Proposed by S. Berlov[/i]

Given is a simple graph $G$ with $2022$ vertices, such that for any subset $S$ of vertices (including the set of all vertices), there is a vertex $v$ with $deg_{S}(v) \leq 100$. Find $\chi(G)$ and the maximal number of edges $G$ can have.

Let $r,g,b$ be non negative integers and $\Gamma$ be a connected graph with $r+g+b+1$ vertices. Its edges are colored in red green and blue. It turned out that $\Gamma $ contains A spanning tree with exactly $r$ red edges. A spanning tree with exactly $g$ green edges. A spanning tree with exactly $b$ blue edges. Prove that $\Gamma$ contains a spanning tree with exactly $r$ red edges, $g$ green edges and $b$ blue edges.