In a certain forest there are at least three crossroads, and for any three crossroads of roads A, B and C there is a road from A to B without passing through C. A deer and a hunter are standing at crossroads of different paths. Is it possible that they can exchange positions without their paths crossing at other points, that are not their initial positions?

Consider a complete graph of $2020$ vertices. What is the least number of edges that need to be marked such that each triangle ($3$-vertex subgraph) has an odd number of marked edges?

In a certain country there are two tennis clubs consisting of $1000 $ and $1001$ members respectively. All the members have different playing strength, and the descending order of palying strengths in each club is known. Find a procedure which determines, within $ 11$ games, who is in the $1001$st place among the $ 2001$ players in these clubs. It is assumed that a stronger player always beats a weaker one.

A collection of cardboard circles, each with a diameter of at most $1$, lie on a $5\times 8$ table without overlapping or overhanging the edge of the table. A cardboard circle of diameter $2$ is added to the collection. Prove that this new collection of cardboard circles can be placed on a $7\times 7$ table without overlapping or overhanging the edge.

Consider a chess board, with the numbers $1$ through $64$ placed in the squares as in the diagram below. \[\begin{tabular}{| c | c | c | c | c | c | c | c |} \hline 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ \hline 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 \\ \hline 17 & 18 & 19 & 20 & 21 & 22 & 23 & 24 \\ \hline 25 & 26 & 27 & 28 & 29 & 30 & 31 & 32 \\ \hline 33 & 34 & 35 & 36 & 37 & 38 & 39 & 40 \\ \hline 41 & 42 & 43 & 44 & 45 & 46 & 47 & 48 \\ \hline 49 & 50 & 51 & 52 & 53 & 54 & 55 & 56 \\ \hline 57 & 58 & 59 & 60 & 61 & 62 & 63 & 64 \\ \hline \end{tabular}\] Assume we have an infinite supply of knights. We place knights in the chess board squares such that no two knights attack one another and compute the sum of the numbers of the cells on which the knights are placed. What is the maximum sum that we can attain? Note. For any $2\times3$ or $3\times2$ rectangle that has the knight in its corner square, the knight can attack the square in the opposite corner.

On the parliament of Sikinia, for any two deputies, there is third deputy, which knows exactly one of the two. Every deputy belongs to one of the two ruling parties. Every day, he president tells a certain group of deputies to change the party that they belong, and all the deputies which which know at least one of the deputies of the group has to change their party too. Prove that, the president can reach any configuration of deputies between two parties.(The president himself isn't a member of the parliament of Sikinia). [I]Proposed by S. Berlov[/i]

4. Suppose 36 objects are placed along a circle at equal distances. In how many ways can 3 objects be chosen from among them so that no two of the three chosen objects are adjacent nor diametrically opposite.

$2013$ people run a marathon on a straight road $4m$ wide broad. At any given moment, no two runners are closer $2$ m from each other. Prove that there are two runners that at that moment are more than $1052$ m from each other. Note: Consider runners as points.

Prove that from an arbitrary set of three-digit numbers, including at least four numbers that are mutually prime, you can choose four numbers that are also mutually prime

Let $A_1,A_2,\ldots,A_n$ be subsets of a finite set $S$ such that $|A_j|=8$ for each $j$. For a subset $B$ of $S$ let $F(B)=\{j \mid 1\le j\le n \ \ \text{and} \ A_j \subset B\}$. Suppose for each subset $B$ of $S$ at least one of the following conditions holds [list][b](a)[/b] $|B| > 25$, [b](b)[/b] $F(B)={\O}$, [b](c)[/b] $\bigcap_{j\in F(B)} A_j \neq {\O}$.[/list] Prove that $A_1\cap A_2 \cap \cdots \cap A_n \neq {\O}$.

A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip. Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and a) $n = 2008$, b) $n = 2009$.

What least possible number of unit squares $(1\times1)$ must be drawn in order to get a picture of $25 \times 25$-square divided into $625$ of unit squares?

Georg has $2n + 1$ cards with one number written on each card. On one card the integer $0$ is written, and among the rest of the cards, the integers $k = 1, ... , n$ appear, each twice. Georg wants to place the cards in a row in such a way that the $0$-card is in the middle, and for each $k = 1, ... , n$, the two cards with the number $k$ have the distance $k$ (meaning that there are exactly $k - 1$ cards between them). For which $1 \le n \le 10$ is this possible?

The figure obtained by removing one small unit square from the $2\times 2$ grid table is called an $L$ ''shape". .Put $k$ L-shapes in an $8\times 8$ grid table. Each $L$-shape can be rotated, but each $L$ shape is required to cover exactly three small unit squares in the grid table, and the common area covered by any two $L$ shapes is $0$, and except for these $k$ $L$ shapes, no other $L$ shapes can be placed. Find the minimum value of $k$.

With $150$ white cubes of $1 \times 1 \times 1$ a prism of $6 \times 5 \times 5$ is assembled, its six faces are painted blue and then the prism is disassembled. Lucrecia must build a new prism, without holes, exclusively using cubes that have at least one blue face and so that the faces of Lucrecia's prism are all completely blue. Give the dimensions of the prism with the largest volume that Lucrecia can assemble.

Given an alfabet of $n$ letters. A sequence of letters such that between any 2 identical letters there are no 2 identical letters is called a [i]word[/i]. a) Find the maximal possible length of a [i]word[/i]. b) Find the number of the [i]words[/i] of maximal length.

Alex and Bob play a game 2015 x 2015 checkered board by the following rules.Initially the board is empty: the players move in turn, Alex moves first. By a move, a player puts either red or blue token into any unoccopied square. If after a player's move there appears a row of three consecutive tokens of the same color( this row may be vertical,horizontal, or dioganal), then this player wins. If all the cells are occupied by tokens, but no such row appears, then a draw is declared.Determine whether Alex, Bob, or none of them has winning strategy.

There are three candidates in the Hundilaane forest governor elections: $A, B$ and $C$. For each of the $20$ forest dwellers, the names of all three candidates were written on the ballot paper in the order of their preference. Examination of the ballots revealed that $11$ forest dwellers prefer $A$, $12$ $B$ and $14$ $C$. Which of the candidates will be marked first on the largest number of ballot papers when it is known that each possible the order of the candidates appears on at least one ballot?

[u]Round 1[/u] [b]1.1.[/b] What is the area of a circle with diameter $2$? [b]1.2.[/b] What is the slope of the line through $(2, 1)$ and $(3, 4)$? [b]1.3.[/b] What is the units digit of $2^2 \cdot 4^4 \cdot 6^6$ ? [u]Round 2[/u] [b]2.1.[/b] Find the sum of the roots of $x^2 - 5x + 6$. [b]2. 2.[/b] Find the sum of the solutions to $|2 - x| = 1$. [b]2.3.[/b] On April $1$, $2018$, Mr. Dospinescu, Mr. Phaovibul and Mr. Pohoata all go swimming at the same pool. From then on, Mr. Dospinescu returns to the pool every 4th day, Mr. Phaovibul returns every $7$th day and Mr. Pohoata returns every $13$th day. What day will all three meet each other at the pool again? Give both the month and the day. [u]Round 3[/u] [b]3. 1.[/b] Kendall and Kylie are each selling t-shirts separately. Initially, they both sell t-shirts for $\$ 33$ each. A week later, Kendall marks up her t-shirt price by $30 \%$, but after seeing a drop in sales, she discounts her price by $30\%$ the following week. If Kim wants to buy $360$ t-shirts, how much money would she save by buying from Kendall instead of Kylie? Write your answer in dollars and cents. [b]3.2.[/b] Richard has English, Math, Science, Spanish, History, and Lunch. Each class is to be scheduled into one distinct block during the day. There are six blocks in a day. How many ways could he schedule his classes such that his lunch block is either the $3$rd or $4$th block of the day? [b]3.3.[/b] How many lattice points does $y = 1 + \frac{13}{17}x$ pass through for $x \in [-100, 100]$ ? (A lattice point is a point where both coordinates are integers.) [u]Round 4[/u] [b]4. 1.[/b] Unsurprisingly, Aaron is having trouble getting a girlfriend. Whenever he asks a girl out, there is an eighty percent chance she bursts out laughing in his face and walks away, and a twenty percent chance that she feels bad enough for him to go with him. However, Aaron is also a player, and continues asking girls out regardless of whether or not previous ones said yes. What is the minimum number of girls Aaron must ask out for there to be at least a fifty percent chance he gets at least one girl to say yes? [b]4.2.[/b] Nithin and Aaron are two waiters who are working at the local restaurant. On any given day, they may be fired for poor service. Since Aaron is a veteran who has learned his profession well, the chance of him being fired is only $\frac{2}{25}$ every day. On the other hand, Nithin (who never paid attention during job training) is very lazy and finds himself constantly making mistakes, and therefore the chance of him being fired is $\frac{2}{5}$. Given that after 1 day at least one of the waiters was fired, find the probability Nithin was fired. [b]4.3.[/b] In a right triangle, with both legs $4$, what is the sum of the areas of the smallest and largest squares that can be inscribed? An inscribed square is one whose four vertices are all on the sides of the triangle. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784569p24468582]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Assume that $2n+1$ positive integers satisfy the following: If we remove any of these integers, the remaining $2n$ integers can be partitioned in two groups of $n$ numbers in each, such that the sum of the numbers in one group is equal to the sum of the numbers in the other. Prove that all of these numbers must be equal.

Given a horizontal strip on the plane (its sides are parallel lines) and $n$ lines intersecting the strip. Every two of them intersect inside the strip, and not a triple has a common point. Consider all the paths along the segments of those lines, starting on the lower side of the strip and ending on the upper side with the properties: moving along such a path we are constantly rising up, and, having reached the intersection, we are obliged to turn to another line. Prove that: a) there are not less than $n/2$ such a paths without common points; b) there is a path consisting of not less than of $n$ segments; c) there is a path that goes along not more than along $n/2+1$ lines; d) there is a path that goes along all the $n$ lines.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

Consider all products by $2, 4, 6, ..., 2000$ of the elements of the set $A =\left\{\frac12, \frac13, \frac14,...,\frac{1}{2000},\frac{1}{2001}\right\}$ . Find the sum of all these products.

A $100\times 100$ chessboard is cut into dominoes ($1\times 2$ rectangles). Two persons play the following game: At each turn, a player glues together two adjacent cells (which were formerly separated by a cut-edge). A player loses if, after his turn, the $100\times 100$ chessboard becomes connected, i. e. between any two cells there exists a way which doesn't intersect any cut-edge. Which player has a winning strategy - the starting player or his opponent?

Jesse and Tjeerd are playing a game. Jesse has access to $n\ge 2$ stones. There are two boxes: in the black box there is room for half of the stones (rounded down) and in the white box there is room for half of the stones (rounded up). Jesse and Tjeerd take turns, with Jesse starting. Jesse grabs in his turn, always one new stone, writes a positive real number on the stone and places put him in one of the boxes that isn't full yet. Tjeerd sees all these numbers on the stones in the boxes and on his turn may move any stone from one box to the other box if it is not yet full, but he may also choose to do nothing. The game stops when both boxes are full. If then the total value of the stones in the black box is greater than the total value of the stones in the white box, Jesse wins; otherwise win Tjeerd. For every $n \ge 2$, determine who can definitely win (and give a corresponding winning strategy).