Alice, Bob, Carol, and David decide that they will share meals and that one of them will cook each night. Because David enjoys cooking, he will cook on $4$ days of the week, while Alice, Bob, and Carol each pick a day of the week to cook on. If Alice, Bob, and Carol each choose the day they cook uniformly at random so as to avoid overlap, what is the probability that David does not cook on three consecutive days? For example, Monday, Tuesday and Wednesday are considered as three consecutive days, so are Saturday, Sunday and Monday.

Josie and Ross are playing a game on a $20 \times 20$ chessboard. Initially the chessboard is empty. The two players alternately take turns, with Josie going first. On Josie’s turn, she selects any two different empty cells, and places one white stone in each of them. On Ross’ turn, he chooses any one white stone currently on the board, and replaces it with a black stone. If at any time there are $ 8$ consecutive cells in a line (horizontally or vertically) all of which contain a white stone, Josie wins. Is it possible that Ross can stop Josie winning - regardless of how Josie plays?

The plane is divided into squares by two sets of parallel lines, forming an infinite grid. Each unit square is coloured with one of $1201$ colours so that no rectangle with perimeter $100$ contains two squares of the same colour. Show that no rectangle of size $1\times1201$ or $1201\times1$ contains two squares of the same colour. [i]Note: Any rectangle is assumed here to have sides contained in the lines of the grid.[/i] [i](Bulgaria - Nikolay Beluhov)[/i]

A set of $103$ coins that look alike is given. Two coins (whose weights are equal) are counterfeit. The other $101$ (genuine) coins also have the same weight, but a different weight from that of the counterfeit coins. However it is not known whether it is the genuine coins or the counterfeit coins which are heavier. How can this question be resolved by three weighings on the one balance? (It is not required to separate the counterfeit coins from the genuine ones.) (D. Fomin, Leningrad)

From the set $ \{1,2,3,\ldots,2009\}$ we choose $ 1005$ numbers, such that sum of any $ 2$ numbers isn't neither $ 2009$ nor $ 2010$. Find all ways on we can choose these $ 1005$ numbers.

8 chess players participated in the chess tournament and everyone played exactly one game with everyone else. It is known that any two chess players who play a draw with each other ended up scoring different numbers of points. Find the greatest possible number of draws in this tournament. (For winning the game the chess player is awarded $1$ point, for a draw $1/2$ points, for defeat $0$ points.)

[b]p1.[/b] If $n$ is a positive integer such that $2n+1 = 144169^2$, find two consecutive numbers whose squares add up to $n + 1$. [b]p2.[/b] Katniss has an $n$-sided fair die which she rolls. If $n > 2$, she can either choose to let the value rolled be her score, or she can choose to roll a $n - 1$ sided fair die, continuing the process. What is the expected value of her score assuming Katniss starts with a $6$ sided die and plays to maximize this expected value? [b]p3.[/b] Suppose that $f(x) = x^6 + ax^5 + bx^4 + cx^3 + dx^2 + ex + f$, and that $f(1) = f(2) = f(3) = f(4) = f(5) = f(6) = 7$. What is $a$? [b]p4.[/b] $a$ and $b$ are positive integers so that $20a+12b$ and $20b-12a$ are both powers of $2$, but $a+b$ is not. Find the minimum possible value of $a + b$. [b]p5.[/b] Square $ABCD$ and rhombus $CDEF$ share a side. If $m\angle DCF = 36^o$, find the measure of $\angle AEC$. [b]p6.[/b] Tom challenges Harry to a game. Tom first blindfolds Harry and begins to set up the game. Tom places $4$ quarters on an index card, one on each corner of the card. It is Harry’s job to flip all the coins either face-up or face-down using the following rules: (a) Harry is allowed to flip as many coins as he wants during his turn. (b) A turn consists of Harry flipping as many coins as he wants (while blindfolded). When he is happy with what he has flipped, Harry will ask Tom whether or not he was successful in flipping all the coins face-up or face-down. If yes, then Harry wins. If no, then Tom will take the index card back, rotate the card however he wants, and return it back to Harry, thus starting Harry’s next turn. Note that Tom cannot touch the coins after he initially places them before starting the game. Assuming that Tom’s initial configuration of the coins weren’t all face-up or face-down, and assuming that Harry uses the most efficient algorithm, how many moves maximum will Harry need in order to win? Or will he never win? PS. You had better use hide for answers.

In a simple graph $G$, we call $t$ pairwise adjacent vertices a $t$[i]-clique[/i]. If a vertex is connected with all other vertices in the graph, we call it a [i]central[/i] vertex. Given are two integers $n,k$ such that $\dfrac {3}{2} \leq \dfrac{1}{2} n < k < n$. Let $G$ be a graph on $n$ vertices such that [b](1)[/b] $G$ does not contain a $(k+1)$-[i]clique[/i]; [b](2)[/b] if we add an arbitrary edge to $G$, that creates a $(k+1)$-[i]clique[/i]. Find the least possible number of [i]central[/i] vertices in $G$.

There is a knight in the left down corner of $2009 \times 2009$ chessboard. The row and the column containing this corner are painted. The knight cannot move into painted cell and after its move new row and column that contains a square with knight become painted. Is it possible to paint all rows and columns of the chessboard?

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]

For a positive integer $n$, and a non empty subset $A$ of $\{1,2,...,2n\}$, call $A$ good if the set $\{u\pm v|u,v\in A\}$ does not contain the set $\{1,2,...,n\}$. Find the smallest real number $c$, such that for any positive integer $n$, and any good subset $A$ of $\{1,2,...,2n\}$, $|A|\leq cn$.

[b]4.[/b] We see, in Figures 1 and 2, examples of lock screens from a cellphone that only works with a password that is not typed but drawn with straight line segments. Those segments form a polygonal line with vertices in a lattice. When drawing the pattern that corresponds to a password, the finger can't lose contact with the screen. Every polygonal line corresponds to a sequence of digits and this sequence is, in fact, the password. The tracing of the polygonal obeys the following rules: [i]i.[/i] The tracing starts at some of the detached points which correspond to the digits from $1$ to $9$ (Figure 3). [i]ii.[/i] Each segment of the pattern must have as one of its extremes (on which we end the tracing of the segment) a point that has not been used yet. [i]iii.[/i] If a segment connects two points and contains a third one (its middle point), then the corresponding digit to this third point is included in the password. That does not happen if this point/digit has already been used. [i]iv.[/i] Every password has at least four digits. Thus, every polygonal line is associated to a sequence of four or more digits, which appear in the password in the same order that they are visited. In Figure 1, for instance, the password is 218369, if the first point visited was $2$. Notice how the segment connecting the points associated with $3$ and $9$ includes the points associated to digit $6$. If the first visited point were the $9$, then the password would be $963812$. If the first visited point were the $6$, then the password would be $693812$. In this case, the $6$ would be skipped, because it can't be repeated. On the other side, the polygonal line of Figure 2 is associated to a unique password. Determine the smallest $n (n \geq 4)$ such that, given any subset of $n$ digits from $1$ to $9$, it's possible to elaborate a password that involves exactly those digits in some order.

On an $8 \times 8$ board, $10$ checkers have been placed, each occupying a square. On each square without a token, a number between $0$ and $8$ is written, which is equal to the number of tokens placed on its neighboring squares. Neighboring cells are those that have a side or a vertex in common. Give a distribution of the tiles that makes the sum of the numbers written on the board the greatest possible.

99 dwarfs stand in a circle, some of them wear hats. There are no adjacent dwarfs in hats and no dwarfs in hats with exactly 48 dwarfs standing between them. What is the maximal possible number of dwarfs in hats?

Can the set of lattice points $\{(x, y) \mid x, y \in \mathbb{Z}, 1 \le x, y \le 252, x \neq y\}$ be colored using 10 distinct colors such that for all $a \neq b$, $b \neq c$, the colors of $(a, b)$ and $(b, c)$ are distinct?

Find the least positive real number $\alpha$ with the following property: if the weight of a finite number of pumpkins is $1$ ton and the weight of each pumpkin is not greater than $\alpha$ tons then the pumpkins can be distributed in $50$ boxes (some boxes can be empty) so that there is no more than $\alpha$ tons of pumpkins in each box.

There are 2010 students and 100 classrooms in the Olympiad High School. At the beginning, each of the students is in one of the classrooms. Each minute, as long as not everyone is in the same classroom, somebody walks from one classroom into a different classroom with at least as many students in it (prior to his move). This process will terminate in $M$ minutes. Determine the maximum value of $M$.

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

[url=https://artofproblemsolving.com/community/c678145][b]Czech-Polish-Slovak Match 2018[/b][/url] [b]Austria, 24 - 27 June 2018[/b] [url=http://artofproblemsolving.com/community/c6h1667029p10595005][b]Problem 1.[/b][/url] Determine all functions $f : \mathbb R \to \mathbb R$ such that for all real numbers $x$ and $y$, $$f(x^2 + xy) = f(x)f(y) + yf(x) + xf(x+y).$$ [i]Proposed by Walther Janous, Austria[/i] [url=http://artofproblemsolving.com/community/c6h1667030p10595011][b]Problem 2.[/b][/url] Let $ABC$ be an acute scalene triangle. Let $D$ and $E$ be points on the sides $AB$ and $AC$, respectively, such that $BD=CE$. Denote by $O_1$ and $O_2$ the circumcentres of the triangles $ABE$ and $ACD$, respectively. Prove that the circumcircles of the triangles $ABC, ADE$, and $AO_1O_2$ have a common point different from $A$. [i]Proposed by Patrik Bak, Slovakia[/i] [url=http://artofproblemsolving.com/community/c6h1667031p10595016][b]Problem 3.[/b][/url] There are $2018$ players sitting around a round table. At the beginning of the game we arbitrarily deal all the cards from a deck of $K$ cards to the players (some players may receive no cards). In each turn we choose a player who draws one card from each of the two neighbors. It is only allowed to choose a player whose each neighbor holds a nonzero number of cards. The game terminates when there is no such player. Determine the largest possible value of $K$ such that, no matter how we deal the cards and how we choose the players, the game always terminates after a finite number of turns. [i]Proposed by Peter Novotný, Slovakia[/i] [url=http://artofproblemsolving.com/community/c6h1667033p10595021][b]Problem 4.[/b][/url] Let $ABC$ be an acute triangle with the perimeter of $2s$. We are given three pairwise disjoint circles with pairwise disjoint interiors with the centers $A, B$, and $C$, respectively. Prove that there exists a circle with the radius of $s$ which contains all the three circles. [i]Proposed by Josef Tkadlec, Czechia[/i] [url=http://artofproblemsolving.com/community/c6h1667034p10595023][b]Problem 5.[/b][/url] In a $2 \times 3$ rectangle there is a polyline of length $36$, which can have self-intersections. Show that there exists a line parallel to two sides of the rectangle, which intersects the other two sides in their interior points and intersects the polyline in fewer than $10$ points. [i]Proposed by Josef Tkadlec, Czechia and Vojtech Bálint, Slovakia[/i] [url=http://artofproblemsolving.com/community/c6h1667036p10595032][b]Problem 6.[/b][/url] We say that a positive integer $n$ is [i]fantastic[/i] if there exist positive rational numbers $a$ and $b$ such that $$ n = a + \frac 1a + b + \frac 1b.$$ [b](a)[/b] Prove that there exist infinitely many prime numbers $p$ such that no multiple of $p$ is fantastic. [b](b)[/b] Prove that there exist infinitely many prime numbers $p$ such that some multiple of $p$ is fantastic. [i]Proposed by Walther Janous, Austria[/i]

Let $r,n$ be positive integers. For a set $A$, let ${A \choose r}$ denote the family of all $r$-element subsets of $A$. Prove that if $A$ is infinite and $f : {A \choose r} \to {1,2,...,n}$ is any function, then there exists an infinite subset $B$ of $A$ such that $f(X) = f(Y)$ for all $X,Y \in {B \choose r}$.

On the real number line, paint red all points that correspond to integers of the form $81x+100y$, where $x$ and $y$ are positive integers. Paint the remaining integer point blue. Find a point $P$ on the line such that, for every integer point $T$, the reflection of $T$ with respect to $P$ is an integer point of a different colour than $T$.

Can it happen that $6$ parallelepipeds, no two of which have common points, are placed in space so that there is a point outside of them from which no vertex of a parallelepiped is visible? (The parallelepipeds are not transparent.) (V Proizvolov)

A marble is placed on each $33$ unit square of a $10*10$ chessboard. After that, the number of marbles in the same row or column with that square is written on each of the remaining empty unit squares. What is the maximum sum of the numbers written on the board?

Given distinct positive integers \( g \) and \( h \), let all integer points on the number line \( OX \) be vertices. Define a directed graph \( G \) as follows: for any integer point \( x \), \( x \rightarrow x + g \), \( x \rightarrow x - h \). For integers \( k, l (k < l) \), let \( G[k, l] \) denote the subgraph of \( G \) with vertices limited to the interval \([k, l]\). Find the largest positive integer \( \alpha \) such that for any integer \( r \), the subgraph \( G[r, r + \alpha - 1] \) of \( G \) is acyclic. Clarify the structure of subgraphs \( G[r, r + \alpha - 1] \) and \( G[r, r + \alpha] \) (i.e., how many connected components and what each component is like).