A number of objects, each coloured in one of two given colours, are arranged in a line (there is at least one object having each of the given colours). It is known that each two objects, between which there are exactly $10$ or $15$ other objects, are of the same colour. What is the greatest possible number of such pieces?

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

Mykolka the numismatist possesses $241$ coins, each worth an integer number of turgiks. The total value of the coins is $360$ turgiks. Is it necessarily true that the coins can be divided into three groups of equal total value?

[u]Round 5 [/u] [b]p13.[/b] Suppose $\vartriangle ABC$ is an isosceles triangle with $\overline{AB} = \overline{BC}$, and $X$ is a point in the interior of $\vartriangle ABC$. If $m \angle ABC = 94^o$, $m\angle ABX = 17^o$, and $m\angle BAX = 13^o$, then what is $m\angle BXC$ (in degrees)? [b]p14.[/b] Find the remainder when $\sum^{2019}_{n=1} 1 + 2n + 4n^2 + 8n^3$ is divided by $2019$. [b]p15.[/b] How many ways can you assign the integers $1$ through $10$ to the variables $a, b, c, d, e, f, g, h, i$, and $j$ in some order such that $a < b < c < d < e, f < g < h < i$, $a < g, b < h, c < i$, $f < b, g < c$, and $h < d$? [u]Round 6 [/u] [b]p16.[/b] Call an integer $n$ equi-powerful if $n$ and $n^2$ leave the same remainder when divided by 1320. How many integers between $1$ and $1320$ (inclusive) are equi-powerful? [b]p17.[/b] There exists a unique positive integer $j \le 10$ and unique positive integers $n_j$ , $n_{j+1}$, $...$, $n_{10}$ such that $$j \le n_j < n_{j+1} < ... < n_{10}$$ and $${n_{10} \choose 10}+ {n_9 \choose 9}+ ... + {n_j \choose j}= 2019.$$ Find $n_j + n_{j+1} + ... + n_{10}$. [b]p18.[/b] If $n$ is a randomly chosen integer between $1$ and $390$ (inclusive), what is the probability that $26n$ has more positive factors than $6n$? [u]Round 7[/u] [b]p19.[/b] Suppose $S$ is an $n$-element subset of $\{1, 2, 3, ..., 2019\}$. What is the largest possible value of $n$ such that for every $2 \le k \le n$, $k$ divides exactly $n - 1$ of the elements of $S$? [b]p20.[/b] For each positive integer $n$, let $f(n)$ be the fewest number of terms needed to write $n$ as a sum of factorials. For example, $f(28) = 3$ because $4! + 2! + 2! = 28$ and 28 cannot be written as the sum of fewer than $3$ factorials. Evaluate $f(1) + f(2) + ... + f(720)$. [b]p21.[/b] Evaluate $\sum_{n=1}^{\infty}\frac{\phi (n)}{101^n-1}$ , where $\phi (n)$ is the number of positive integers less than or equal to n that are relatively prime to $n$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2788993p24519281]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Andrea flips a fair coin repeatedly, continuing until she either flips two heads in a row (the sequence HH) or flips tails followed by heads (the sequence TH). What is the probability that she will stop after flipping HH?

Let $n$ be a positive integer. A regular hexagon with side length $n$ is divided into equilateral triangles with side length $1$ by lines parallel to its sides. Find the number of regular hexagons all of whose vertices are among the vertices of those equilateral triangles. [i]UK - Sahl Khan[/i]

Prove that for all positive integers $n$ we can find a permutation of {$1,2,...,n$} such that the average of two numbers doesn't appear in-between them.For example {$1,3,2,4$}works,but {$1,4,2,3$} doesn't because $2$ is between $1$ and $3$.

A token is placed in one square of a $m\times n$ board, and is moved according to the following rules: [list] [*]In each turn, the token can be moved to a square sharing a side with the one currently occupied. [*]The token cannot be placed in a square that has already been occupied. [*]Any two consecutive moves cannot have the same direction.[/list] The game ends when the token cannot be moved. Determine the values of $m$ and $n$ for which, by placing the token in some square, all the squares of the board will have been occupied in the end of the game.

Alex starts at the origin $O$ of a hexagonal lattice. Every second, he moves to one of the six vertices adjacent to the vertex he is currently at. If he ends up at $X$ after $2018$ moves, then let $p$ be the probability that the shortest walk from $O$ to $X$ (where a valid move is from a vertex to an adjacent vertex) has length $2018$. Then $p$ can be expressed as $\tfrac{a^m-b}{c^n}$, where $a$, $b$, and $c$ are positive integers less than $10$; $a$ and $c$ are not perfect squares; and $m$ and $n$ are positive integers less than $10000$. Find $a+b+c+m+n$.

$3n$ points are given ($n\ge 1$) in the plane, each $3$ of them are not collinear. Prove that there are $n$ distinct triangles with the vertices those points.

Given an integer $n > 2$, give an example of a set of $n$ mutually different numbers $a_1,...,a_n$ for which the set of their pairwise sums $a_i + a_j$ ($i \ne j$) contains as few different numbers as possible; also give an example of a set of n different numbers $b_1,...,b_n$ for which the set of their pairwise sums $b_i+b_j$ ($i \ne j$) contains as many different numbers as possible;

A sequence of real numbers is called a [i]Fibonacci [/i] sequence if $$t_{n+2} = t_{n+1} + t_n$$ for $n= 1,2,3,. .$ . Two Fibonacci sequences are said to be [i]essentially different[/i] if the terms of one sequence cannot be obtained by multiplying the terms of the other by a constant. For example, the Fibonacci sequences $1,2,3,5,8,...$ and $1,3,4,7,11,...$ are essentially different, but the sequences $1,2,3,5,8,...$ and $2,4,6,10,16,...$ are not. (a) Prove that there exist real numbers $p$ and $q$ such that the sequences $1,p,p^2,p^3,...$ and $1,q,q^2,q^3,...$ are essentially different Fibonacci sequences. (b) Let $a_1,a_2,a_3,...$ and $b_1,b_2,b_3,...$ be essentially different Fibonacci sequences. Prove that for every Fibonacci sequence $t_1,t_2,t_3,...$, there exists exactly one number $\alpha$ and exactly one number $\beta$, such that: $$t_n = \alpha a_n + \beta b_n$$ for $n = 1,2,3,...$ (c) $t_1,t_2,t_3,...$, is the Fibonacci sequence with $t_1 = 1$ and $t_2= 2$. Express $t_n$ in terms of $n$.

In the country of Princetonia, there are an infinite number of cities, connected by roads. For every two distinct cities, there is a unique sequence of roads that leads from one city to the other. Moreover, there are exactly three roads from every city. On a sunny morning in early July, n tourists have arrived at the capital of Princetonia. They repeat the following process every day: in every city that contains three or more tourists, three tourists are picked and one moves to each of the three cities connected to the original one by roads. If there are $2$ or fewer tourists in the city, they do nothing. After some time, all tourists will settle and there will be no more changing cities. For how many values of n from $1$ to $2020$ will the tourists end in a configuration in which no two of them are in the same city?

The management of a secret society is made up of $4$ people. To admit new partners they use the following criteria: $\bullet$ Only the $4$ members of the directory vote, being able to do it in $3$ ways: in favor, against or abstaining. $\bullet$ Each aspiring partner must obtain at least $2$ votes in favor and none against. At the last management meeting, $8$ requests for admission were examined. Of the total votes cast, there were $23$ votes in favor, $2$ votes against and $7$ abstaining. What is the highest and what is the lowest value that the number of approved admission requests can have on that occasion?

There is a set of $17$ consecutive positive integers. Let $m$ be the smallest of these numbers. Determine for which values of $m$ the set can be divided into three subsets disjoint, such that the sum of the elements of each subset is the same.

Raina the frog is playing a game in a circular pond with six lilypads around its perimeter numbered clockwise from $1$ to $6$ (so that pad $1$ is adjacent to pad $6$). She starts at pad $1$, and when she is on pad i, she may jump to one of its two adjacent pads, or any pad labeled with $j$ for which $j - i$ is even. How many jump sequences enable Raina to hop to each pad exactly once?

A graph is called 2-connected if after removing any vertex the remaining graph is still connected. Prove that for any 2-connected graph with degrees more than two, one can remove a vertex so that the remaining graph is still 2-connected.

Two players play the following game on a circular board with 2009 houses. The two plays put, alternatively, on an empty house, one of three pieces, called [i]explorer (E)[/i], [i]trap (T)[/i] or [i]stone (S)[/i]. A treasure is a sequence of three consecutive filled houses such that the first one (on any direction) has an explorer and the middle one doesn't have a trap. For example, [i]STE[/i] is not a treasure, while [i]TEE[/i] is a treasure. The first player forming a treasure wins. Can any of the players guarantee the victory? And, in affirmative case, who?

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] All the positive integers from 1 till 1000 are written on the blackboard in some order and there is a collection of cards each containing 10 numbers. If there is a card with numbers $1\le a_1<a_2<\ldots<a_{10}\le1000$ in collection then it is allowed to arrange in increasing order the numbers at places $a_1, a_2, \ldots, a_{10},$ counting from left to right. What is the smallest amount of cards in the collection which enables us to arrange in increasing order all the numbers for any initial arrangement of them?

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

Determine the number of times and the positions in which it appears $\frac12$ in the following sequence of fractions: $$ \frac11, \frac21, \frac12 , \frac31 , \frac22 , \frac13 , \frac41,\frac32,\frac23,\frac14,..., \frac{1}{1992}$$

A strategical video game consists of a map of finitely many towns. In each town there are $k$ directions, labelled from $1$ through $k$. One of the towns is designated as initial, and one – as terminal. Starting from the initial town the hero of the game makes a finite sequence of moves. At each move the hero selects a direction from the current town. This determines the next town he visits and a certain positive amount of points he receives. Two strategical video games are equivalent if for every sequence of directions the hero can reach the terminal town from the initial in one game, he can do so in the other game, and, in addition, he accumulates the same amount of points in both games. For his birthday John receives two strategical video games – one with $N$ towns and one with $M$ towns. He claims they are equivalent. Marry is convinced they are not. Marry is right. Prove that she can provide a sequence of at most $N +M$ directions that shows the two games are indeed not equivalent. [i]Stefan Gerdjikov, Bulgaria[/i]

For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Let $m, n$ be positive integers. Consider a sequence of positive integers $a_1, a_2, ... , a_n$ that satisfies $m = a_1 \ge a_2\ge ... \ge a_n \ge 1$. Then define, for $1\le  i\le  m$, $b_i =$ # $\{ j \in \{1, 2, ... , n\}: a_j \ge i\}$, so $b_i$ is the number of terms $a_j $ of the given sequence for which $a_j  \ge i$. Similarly, we define, for $1\le   j \le  n$, $c_j=$ # $\{ i \in \{1, 2, ... , m\}: b_i \ge j\}$ , thus $c_j$ is the number of terms bi in the given sequence for which $b_i \ge j$. E.g.: If $a$ is the sequence $5, 3, 3, 2, 1, 1$ then $b$ is the sequence $6, 4, 3, 1, 1$. (a) Prove that $a_j = c_j $ for $1  \le j  \le n$. (b) Prove that for $1\le  k \le m$: $\sum_{i=1}^{k} b_i = k \cdot b_k + \sum_{j=b_{k+1}}^{n} a_j$.

The Queen of Hearts rules a kingdom with $n$ (distinguishable) cities. Each pair of cities is either connected with a bridge or not connected with a bridge. Each day, the Queen of Hearts visits $2021$ cities. For every pair of cities, if she sees a bridge she gets angry and destroys it; otherwise she feels nice and constructs a bridge between them. We call two configurations of bridges [i]equivalent[/i] if one can be reached from the other after a finite number of days. Show that there is some integer $M$ such that if $n>M$, two configurations are equivalent if both of the following conditions hold: [list] [*] The parity of the total number of bridges is the same in both configurations [*] For every city, the parity of the number of bridges going out of that city is the same in both configurations. [/list]