In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

The vertices of a given square are clockwise lettered $A,B,C,D$. On the side $AB$ is situated a point $E$ such that $AE = AB/3$. Starting from an arbitrarily chosen point $P_0$ on segment $AE$ and going clockwise around the perimeter of the square, a series of points $P_0, P_1, P_2, \ldots$ is marked on the perimeter such that $P_iP_{i+1} = AB/3$ for each $i$. It will be clear that when $P_0$ is chosen in $A$ or in $E$, then some $P_i$ will coincide with $P_0$. Does this possibly also happen if $P_0$ is chosen otherwise?

(a) Prove that a square with sides $1000$ divided into $31$ squares tiles, at least one of which has a side length less than $1$. (b) Show that a corresponding decomposition into $30$ squares is also possible. [i](Walther Janous)[/i]

There are $n$ cards. Max and Lewis play, alternately, the following game Max starts the game, he removes exactly $1$ card, in each round the current player can remove any quantity of cards, from $1$ card to $t+1$ cards, which $t$ is the number of removed cards by the previous player, and the winner is the player who remove the last card. Determine all the possible values of $n$ such that Max has the winning strategy.

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

We have the following board of $2 \times 6$. [asy] unitsize(0.8 cm); int i; draw((0,0)--(6,0)); draw((0,1)--(6,1)); draw((0,2)--(6,2)); for (i = 0; i <= 6; ++i) { draw((i,0)--(i,2)); } dot("$A$", (0,2), NW); dot("$B$", (6,2), NE); dot("$C$", (3,0), S); [/asy] Find in how many ways you can go from point $A$ to point $B$, moving by the segments of the board, respecting the following rules: - You cannot pass through the same point twice. - You can only make three types of movements moving through the segments: To the right, up, down - You have to go through point $C$.

Given two positive integers $m$ and $n$, find the largest $k$ in terms of $m$ and $n$ such that the following condition holds: Any tree graph $G$ with $k$ vertices has two (possibly equal) vertices $u$ and $v$ such that for any other vertex $w$ in $G$, either there is a path of length at most $m$ from $u$ to $w$, or there is a path of length at most $n$ from $v$ to $w$. [i]Proposed by Ivan Chan Kai Chin[/i]

Let $P$ be a regular $n$-gon $A_1A_2\ldots A_n$. Find all positive integers $n$ such that for each permutation $\sigma (1),\sigma (2),\ldots ,\sigma (n)$ there exists $1\le i,j,k\le n$ such that the triangles $A_{i}A_{j}A_{k}$ and $A_{\sigma (i)}A_{\sigma (j)}A_{\sigma (k)}$ are both acute, both right or both obtuse.

There were $10$ boys and $10$ girls at the party. Every boy likes a different 'positive' number of girls. Every girl likes a different positive number of boys. Define the largest non-negative integer $n$ such that it is always possible to form at least $n$ disjoint pairs in which both like the other.

Each cell of an $100\times 100$ board is divided into two triangles by drawing some diagonal. What is the smallest number of colors in which it is always possible to paint these triangles so that any two triangles having a common side or vertex have different colors?

On the edges of a convex polyhedra we draw arrows such that from each vertex at least an arrow is pointing in and at least one is pointing out. Prove that there exists a face of the polyhedra such that the arrows on its edges form a circuit. [i]Dan Schwartz[/i]

$k$ squares of a $m\times n$ gridded board are painted in such a way that the following property holds: [i]If the centers of four squares are the vertices of a quadrilateral of sides parallel to the edges of the board, then at most two of these boxes must be painted..[/i] Find the largest possible value of $k$.

Each square of a chessboard is painted either blue or red . Prove that the squares of one colour possess the property that the chess queen can perform a tour of all of them. The rules are that the queen may visit the squares of this colour not necessarily only once each , and may not be placed on squares of the other colour, although she may pass over them ; the queen moves along any horizontal , vertical or diagonal file over any distance. (A . K . Tolpugo , Kiev)

Let $n \geq2$ be an integer number and $D_n$ the set of all the points $(x,y)$ in the plane such that its coordinates are integer numbers with: $-n \le x \le n$ and $-n \le y \le n$. (a) There are three possible colors in which the points of $D_n$ are painted with (each point has a unique color). Show that with any distribution of the colors, there are always two points of $D_n$ with the same color such that the line that contains them does not go through any other point of $D_n$. (b) Find a way to paint the points of $D_n$ with 4 colors such that if a line contains exactly two points of $D_n$, then, this points have different colors.

A set of $n \ge 2$ light bulbs are arranged around a circle, and are consecutively numbered with $1, 2, . . . , n$. Each bulb can be in one of two states: either it is [b]on[/b] or [b]off[/b]. In the initial configuration, at least one bulb is turned on. On each one of $n$ days we change the current on/off configuration as follows: for $1 \le k \le n$, on the $k$-th day we start from the $k$-th bulb and moving in clockwise direction along the circle, we change the state of every traversed bulb until we switch on a bulb which was previously off. Prove that the final configuration, reached on the $n$-th day, coincides with the initial one.

Given a set $ \mathcal{H}$ of points in the plane, $ P$ is called an "intersection point of $ \mathcal{H}$" if distinct points $ A,B,C,D$ exist in $ \mathcal{H}$ such that lines $ AB$ and $ CD$ are distinct and intersect in $ P$. Given a finite set $ \mathcal{A}_{0}$ of points in the plane, a sequence of sets is defined as follows: for any $ j\geq0$, $ \mathcal{A}_{j+1}$ is the union of $ \mathcal{A}_{j}$ and the intersection points of $ \mathcal{A}_{j}$. Prove that, if the union of all the sets in the sequence is finite, then $ \mathcal{A}_{i}=\mathcal{A}_{1}$ for any $ i\geq1$.

[u]Round 1[/u] [b]1.1.[/b] There are $99$ dogs sitting in a long line. Starting with the third dog in the line, if every third dog barks three times, and all the other dogs each bark once, how many barks are there in total? [b]1.2.[/b] Indigo notices that when she uses her lucky pencil, her test scores are always $66 \frac23 \%$ higher than when she uses normal pencils. What percent lower is her test score when using a normal pencil than her test score when using her lucky pencil? [b]1.3.[/b] Bill has a farm with deer, sheep, and apple trees. He mostly enjoys looking after his apple trees, but somehow, the deer and sheep always want to eat the trees' leaves, so Bill decides to build a fence around his trees. The $60$ trees are arranged in a $5\times 12$ rectangular array with $5$ feet between each pair of adjacent trees. If the rectangular fence is constructed $6$ feet away from the array of trees, what is the area the fence encompasses in feet squared? (Ignore the width of the trees.) [u]Round 2[/u] [b]2.1.[/b] If $x + 3y = 2$, then what is the value of the expression $9^x * 729^y$? [b]2.2.[/b] Lazy Sheep loves sleeping in, but unfortunately, he has school two days a week. If Lazy Sheep wakes up each day before school's starting time with probability $1/8$ independent of previous days, then the probability that Lazy Sheep wakes up late on at least one school day over a given week is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]2.3.[/b] An integer $n$ leaves remainder $1$ when divided by $4$. Find the sum of the possible remainders $n$ leaves when divided by $20$. [u]Round 3[/u] [b]3.1. [/b]Jake has a circular knob with three settings that can freely rotate. Each minute, he rotates the knob $120^o$ clockwise or counterclockwise at random. The probability that the knob is back in its original state after $4$ minutes is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]3.2.[/b] Given that $3$ not necessarily distinct primes $p, q, r$ satisfy $p+6q +2r = 60$, find the sum of all possible values of $p + q + r$. [b]3.3.[/b] Dexter's favorite number is the positive integer $x$, If $15x$ has an even number of proper divisors, what is the smallest possible value of $x$? (Note: A proper divisor of a positive integer is a divisor other than itself.) [u]Round 4[/u] [b]4.1.[/b] Three circles of radius $1$ are each tangent to the other two circles. A fourth circle is externally tangent to all three circles. The radius of the fourth circle can be expressed as $\frac{a\sqrt{b}-\sqrt{c}}{d}$ for positive integers $a, b, c, d$ where $b$ is not divisible by the square of any prime and $a$ and $d$ are relatively prime. Find $a + b + c + d$. [b]4.2. [/b]Evaluate $$\frac{\sqrt{15}}{3} \cdot \frac{\sqrt{35}}{5} \cdot \frac{\sqrt{63}}{7}... \cdot \frac{\sqrt{5475}}{73}$$ [b]4.3.[/b] For any positive integer $n$, let $f(n)$ denote the number of digits in its base $10$ representation, and let $g(n)$ denote the number of digits in its base $4$ representation. For how many $n$ is $g(n)$ an integer multiple of $f(n)$? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784571p24468619]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For a natural number $n$, let $$C_n=\frac{1}{n+1}\binom{2n}{n}=\frac{(2n)!}{n!(n+1)!}$$ be the $n$-th Catalan number. Prove that for any natural number $m$, $$\sum_{i+j+k=m} C_{i+j}C_{j+k}C_{k+i}=\frac{3}{2m+3}C_{2m+1}.$$ [i]Proposed by Bin Wang[/i]

Let $n$ be a positive integer. Each number $1, 2, ..., 1000$ has been colored with one of $n$ colours. Each two numbers , such that one is a divisor of second of them, are colored with different colours. Determine minimal number $n$ for which it is possible.

For a rational number $r$, its *period* is the length of the smallest repeating block in its decimal expansion. for example, the number $r=0.123123123...$ has period $3$. If $S$ denotes the set of all rational numbers of the form $r=\overline{abcdefgh}$ having period $8$, find the sum of all elements in $S$.

Given is a set of $2n$ cards numbered $1,2, \cdots, n$, each number appears twice. The cards are put on a table with the face down. A set of cards is called good if no card appears twice. Baron Munchausen claims that he can specify $80$ sets of $n$ cards, of which at least one is sure to be good. What is the maximal $n$ for which the Baron's words could be true?

Let $M$ be a finite set of lattice points and $n$ be a positive integer. A $\textit{mine-avoiding path}$ is a path of lattice points with length $n$, beginning at $(0,0)$ and ending at a point on the line $x+y=n,$ that does not contain any point in $M$. Prove that if there exists a mine-avoiding path, then there exist at least $2^{n-|M|}$ mine-avoiding paths. [hide=*]A lattice point is a point $(x,y)$ where $x$ and $y$ are integers. A path of lattice points with length $n$ is a sequence of lattice points $P_0,P_1,\ldots, P_n$ in which any two adjacent points in the sequence have distance 1 from each other.[/hide] [i]Ankit Bisain and Holden Mui[/i]

A Saudi company has two offices. One office is located in Riyadh and the other in Jeddah. To insure the connection between the two offices, the company has designated from each office a number of correspondents so that : (a) each pair of correspondents from the same office share exactly one common correspondent from the other office. (b) there are at least $10$ correspondents from Riyadh. (c) Zayd, one of the correspondents from Jeddah, is in contact with exactly $8$ correspondents from Riyadh. What is the minimum number of correspondents from Jeddah who are in contact with the correspondent Amr from Riyadh?

Eve randomly chooses two $\textbf{distinct}$ points on the coordinate plane from the set of all $11^2$ lattice points $(x, y)$ with $0 \le x \le 10$, $0 \le y \le 10$. Then, Anne the ant walks from the point $(0,0)$ to the point $(10, 10)$ using a sequence of one-unit right steps and one-unit up steps. Let $P$ be the number of paths Anne could take that pass through both of the points that Eve chose. The expected value of $P$ is $\dbinom{20}{10} \cdot \dfrac{a}{b}$ for relatively prime positive integers $a$ and $b$. Compute $100a+b$. [i]Proposed by Michael Tang[/i]