On a circle we consider a set $M$ consisting of $n$ ($n \ge 3$) points, of which only one is colored red. Determine of which polygons inscribed in a circle having the vertices in the set $M$ are more: those that contain the red dot or those that do not contain those points? How many more are there than others?

Is it possible to paint the cells of a $5\times 5$ board in $4$ colors so that the cells standing at the intersection of any two rows and any two columns were painted in at least $ 3$ colors?

At a two-round volleyball tournament participated 99 teams. Each played a match at home and a match away. Each team won exactly half of their home matches and exactly half of their away matches. Prove that one of the teams beat another team twice. [i]Proposed by M. Antipov[/i]

We recursively define a set of [i]goody pairs[/i] of words on the alphabet $\{a,b\}$ as follows: - $(a,b)$ is a goody pair; - $(\alpha, \beta) \not= (a,b)$ is a goody pair if and only if there is a goody pair $(u,v)$ such that $(\alpha, \beta) = (uv,v)$ or $(\alpha, \beta) = (u,uv)$ Show that if $(\alpha, \beta)$ is a good pair then there exists a palindrome $\gamma$ (possibly empty) such that $\alpha\beta = a \gamma b$

The natural numbers from $1$ up to $300$ are evenly located around a circle. We say that such an ordering is [i]alternate [/i ]if each number is less than its two neighbors or is greater than its two neighbors. We will call a pair of neighboring numbers a [i]good [/i] pair if, by removing that pair from the circumference, the remaining numbers form an alternate ordering. Determine the least possible number of good pairs in which there can be an alternate ordering of the numbers from $1$ at $300$ inclusive.

The average age of the participants in a mathematics competition (gymnasts and high school students) increases by exactly one month if three high school age students $18$ years each are included in the competition or if three gymnasts aged $12$ years each are excluded from the competition. How many participants were initially in the contest?

In a sport competition, $m$ teams have participated. We know that each two teams have competed exactly one time and the result is winning a team and losing the other team (i.e. there is no equal result). Prove that there exists a team $x$ such that for each team $y,$ either $x$ wins $y$ or there exists a team $z$ for which $x$ wins $z$ and $z$ wins $y.$ [i][i.e. prove that in every tournament there exists a king.][/i]

Nico picks $13$ pairwise distinct $3-$digit positive integers. Ian then selects several of these 13 numbers, the ones he wants, and using only once each selected number and some of the operations addition, subtraction, multiplication and division ($+,-,\times ,:$) must get an expression whose value is greater than $3$ and less than $4$. If he succeeds, Ian wins; otherwise, Nico wins. Which of the two has a winning strategy?

Let $k$ be a given integer, $3 < k \leq n$. Consider a graph $G$ with $n$ vertices satisfying the condition: for any two non-adjacent vertices $x$ and $y$ in graph $G$, the sum of their degrees must satisfy $d(x) + d(y) \geq k$. Please answer the following questions and prove your conclusions. (1) Suppose the length of the longest path in graph $G$ is $l$ satisfying the inequality $3 \leq l < k$, does graph $G$ necessarily contain a cycle of length $l+1$? (The length of a path or cycle refers to the number of edges that make up the path or cycle.) (2) For the case where $3 < k \leq n-1$ and graph $G$ is connected, can we determine that the length of the longest path in graph $G$, $l \geq k$? (3) For the case where $3 < k = n-1$, is it necessary for graph $G$ to have a path of length $n-1$ (i.e., a Hamiltonian path)?

The numbers $1,2,\dots, 49$ are written on unit squares of a $7\times 7$ chessboard such that consequtive numbers are on unit squares sharing a common edge. At most how many prime numbers can a row have? $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 3 $

Given a rectangular grid, split into $m\times n$ squares, a colouring of the squares in two colours (black and white) is called valid if it satisfies the following conditions: [list] [*]All squares touching the border of the grid are coloured black. [*]No four squares forming a $2\times 2$ square are coloured in the same colour. [*]No four squares forming a $2\times 2$ square are coloured in such a way that only diagonally touching squares have the same colour.[/list] Which grid sizes $m\times n$ (with $m,n\ge 3$) have a valid colouring?

There are cities in country, and some cities are connected by roads. Not more than $100$ roads go from every city. Set of roads is called as ideal if all roads in set have not common ends, and we can not add one more road in set without breaking this rule. Every day minister destroy one ideal set of roads. Prove, that he need not more than $199$ days to destroy all roads in country.

On a $123 \times 123$ board, each square is painted red or blue according to the following conditions: a) Each square painted red that is not on the edge of the board has exactly $5$ blue squares among its $8$ neighboring squares. b) Each square painted blue that is not on the edge of the board has exactly $4$ red squares among its $8$ neighboring squares. Determine the number of red-painted squares on the board.

Consider a game in the integer points of the real line, where an Angel tries to escape from a Devil. A positive integer $k$ is chosen, and the Angel and the Devil take turns playing. Initially, no point is blocked. The Angel, in point $A$, can move to any point $P$ such that $|AP| \le k$, as long as $P$ is not blocked. The Devil may block an arbitrary point. The Angel loses if it cannot move and wins if it does not lose in finitely many turns. Let $f(k)$ denote the least number of rounds the Devil takes to win. Prove that $$0.5 k \log_2 (k) (1 + o(1)) \le f(k) \le k \log_2(k) (1 +o(1)).$$ Note: $a(x) = b(x) (1+o(1))$ if $\lim_{x \to \infty} \frac{b(x)}{a(x)} = 1$.

Let $n$ be a positive integer. Let $\mathcal{F}$ be a family of sets that contains more than half of all subsets of an $n$-element set $X$. Prove that from $\mathcal{F}$ we can select $\lceil \log_2 n \rceil + 1$ sets that form a separating family on $X$, i.e., for any two distinct elements of $X$ there is a selected set containing exactly one of the two elements. Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=614827&hilit=Schweitzer+2014+separating

A utility company is building a network to send electricity to fifty houses, with addresses $0, 1, 2, \ldots , 49. $ The power center only connects directly to house $0$, so electricity reaches all other houses through a system of wires that connects specific pairs of houses. To save money, the company only lays wires between as few pairs of distinct houses as possible; additionally, two houses with addresses $a$ and $b$ can only have a wire between them if at least one of the following three conditions is met: [list] [*]$10$ divides both $a$ and $b.$ [*]$\lfloor \tfrac{a}{10} \rfloor \equiv \lfloor \tfrac{b}{10}\rfloor \pmod{5}.$ [*]$\lceil \tfrac{a}{10} \rceil\equiv \lceil \tfrac{b}{10}\rceil\pmod{5}.$ [/list] Letting $N$ be the number of distinct ways such a wire system can be configured so that every house receives electricity , find the remainder when $N$ is divided by $1000.$

How many integers belong to ($a,2008a$), where $a$ ($a > 0$) is given.

Show that no matter how $15$ points are plotted within a circle of radius $2$ (circle border included), there will be a circle with radius $1$ (circle border including) which contains at least three of the $15$ points.

Let $N\ge2$ be a fixed positive integer. There are $2N$ people, numbered $1,2,...,2N$, participating in a tennis tournament. For any two positive integers $i,j$ with $1\le i<j\le 2N$, player $i$ has a higher skill level than player $j$. Prior to the first round, the players are paired arbitrarily and each pair is assigned a unique court among $N$ courts, numbered $1,2,...,N$. During a round, each player plays against the other person assigned to his court (so that exactly one match takes place per court), and the player with higher skill wins the match (in other words, there are no upsets). Afterwards, for $i=2,3,...,N$, the winner of court $i$ moves to court $i-1$ and the loser of court $i$ stays on court $i$; however, the winner of court 1 stays on court 1 and the loser of court 1 moves to court $N$. Find all positive integers $M$ such that, regardless of the initial pairing, the players $2, 3, \ldots, N+1$ all change courts immediately after the $M$th round. [i]Proposed by Ray Li[/i]

Let $S$ be the set containing all positive integers whose decimal representations contain only 3’s and 7’s, have at most 1998 digits, and have at least one digit appear exactly 999 times. If $N$ denotes the number of elements in $S$, find the remainder when $N$ is divided by 1000.

The numbers from 1 to $n$ are arranged in some way on a circle. What’s the smallest value of $n$, for which no matter how the numbers are arranged there exist ten consecutively increasing numbers $A_1<A_2<A_3…<A_{10}$ such that $A_1 A_2…A_{10}$ is a convex decagon?

Let $S$ be a finite set of points in the plane, such that for each $2$ points $A$ and $B$ in $S$, the segment $AB$ is a side of a regular polygon all of whose vertices are contained in $S$. Find all possible values for the number of elements of $S$. Proposed by [i]Viktor Simjanoski, Macedonia[/i]

A tourist traveling on a bus from the VIAZUL company arrived at the station in the city of Cienfuegos and immediately set out to take a walking tour of the city. After visiting the Terry theater in this city, decided to return to the station but walking only for blocks traveled an odd number of times in his previous walk. Can he do this on his return regardless. of the initial route?

[u]Round 5 [/u] [b]p13.[/b] A palindrome is a number that reads the same forward as backwards; for example, $121$ and $36463$ are palindromes. Suppose that $N$ is the maximal possible difference between two consecutive three-digit palindromes. Find the number of pairs of consecutive palindromes $(A, B)$ satisfying $A < B$ and $B - A = N$. [b]p14.[/b] Suppose that $x, y$, and $z$ are complex numbers satisfying $x +\frac{1}{yz} = 5$, $y +\frac{1}{zx} = 8$, and $z +\frac{1}{xy} = 6$. Find the sum of all possible values of $xyz$. [b]p15.[/b] Let $\Omega$ be a circle with radius $25\sqrt2$ centered at $O$, and let $C$ and $J$ be points on $\Omega$ such that the circle with diameter $\overline{CJ}$ passes through $O$. Let $Q$ be a point on the circle with diameter $\overline{CJ}$ satisfying $OQ = 5\sqrt2$. If the area of the region bounded by $\overline{CQ}$, $\overline{QJ}$, and minor arc $JC$ on $\Omega$ can be expressed as $\frac{a\pi-b}{c}$ for integers $a, b$, and $c$ with $gcd \,\,(a, c) = 1$, then find $a + b + c$. [u]Round 6[/u] [b]p16.[/b] Veronica writes $N$ integers between $2$ and $2020$ (inclusive) on a blackboard, and she notices that no number on the board is an integer power of another number on the board. What is the largest possible value of $N$? [b]p17.[/b] Let $ABC$ be a triangle with $AB = 12$, $AC = 16$, and $BC = 20$. Let $D$ be a point on $AC$, and suppose that $I$ and $J$ are the incenters of triangles $ABD$ and $CBD$, respectively. Suppose that $DI = DJ$. Find $IJ^2$. [b]p18.[/b] For each positive integer $a$, let $P_a = \{2a, 3a, 5a, 7a, . . .\}$ be the set of all prime multiples of $a$. Let $f(m, n) = 1$ if $P_m$ and $P_n$ have elements in common, and let $f(m, n) = 0$ if $P_m$ and $P_n$ have no elements in common. Compute $$\sum_{1\le i<j\le 50} f(i, j)$$ (i.e. compute $f(1, 2) + f(1, 3) + ,,, + f(1, 50) + f(2, 3) + f(2, 4) + ,,, + f(49, 50)$.) [u]Round 7[/u] [b]p19.[/b] How many ways are there to put the six letters in “$MMATHS$” in a two-by-three grid such that the two “$M$”s do not occupy adjacent squares and such that the letter “$A$” is not directly above the letter “$T$” in the grid? (Squares are said to be adjacent if they share a side.) [b]p20.[/b] Luke is shooting basketballs into a hoop. He makes any given shot with fixed probability $p$ with $p < 1$, and he shoots n shots in total with $n \ge 2$. Miraculously, in $n$ shots, the probability that Luke makes exactly two shots in is twice the probability that Luke makes exactly one shot in! If $p$ can be expressed as $\frac{k}{100}$ for some integer $k$ (not necessarily in lowest terms), find the sum of all possible values for $k$. [b]p21.[/b] Let $ABCD$ be a rectangle with $AB = 24$ and $BC = 72$. Call a point $P$ [i]goofy [/i] if it satisfies the following conditions: $\bullet$ $P$ lies within $ABCD$, $\bullet$ for some points $F$ and $G$ lying on sides $BC$ and $DA$ such that the circles with diameter $BF$ and $DG$ are tangent to one another, $P$ lies on their common internal tangent. Find the smallest possible area of a polygon that contains every single goofy point inside it. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2800971p24674988]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The set of integers is coloured in $100$ colours in such a way that all the colours are used and the following is true. For any choice of intervals $[a, b]$ and $[c,d]$ of equal length and with integral endpoints, if a and c as well as $b$ and $d$, respectively, have the same colour, then the whole intervals $[a, b]$ and $[c,d]$ are identically coloured in that, for any integer $x$, $0 \le x \le b - a$, the numbers $a + x$ and $c + x$ are of the same colour. Prove that $-1982$ and $1982$ are of different colours