Let $r\geq 2$ be a positive integer, and let each positive integer be painted in one of $r$ different colors. For every positive integer $n$ and every pair of colors $a$ and $b$, if the difference between the number of divisors of $n$ that are painted in color $a$ and the number of divisors of $n$ that are painted in color $b$ is at most $1$, find all possible values of $r$.

There is a set of $50$ cards. Each card on both sides is colored in one of three colors — red, blue or white, and for each card its two sides are colored in different colors. The cards were laid out on the table. The card [i]lies beautifully[/i] if at least one of two conditions is met: its upper side — red; its underside is blue. It turned out that exactly $25$ cards are lying beautifully. Then all the cards were turned over. Now some of the cards are lying beautifully on the table. How many of them can there be? [i]K.A.Sukhov[/i]

In a tournament, each of $15$ teams played with each other exactly once. Let us call the game “[i]odd[/i]” if the total number of games previously played by both competing teams was odd. [b](a)[/b] Prove that there was at least one “[i]odd[/i]” game. [b](b)[/b] Could it happen that there was exactly one “[i]odd[/i]” game?

(a) Consider a $6 \times 6$ board with two squares removed at diagonally opposite corners. Prove that it is not possible to exactly cover it with $2 \times 1$ dominoes. (b) Consider a box with dimensions $4 \times 4 \times 4$ from which two $1 \times 1 \times 1$ cubes have been removed at diagonally opposite corners. Is it possible to fill the remaining space exactly with bricks of dimensions $2 \times 1 \times 1$?

Danielle has an $m \times n$ board and wants to fill it with pieces composed of two or more diagonally connected squares as shown, without overlapping or leaving gaps: a) Find all values of $(m,n)$ for which it is possible to fill the board. b) If it is possible to fill an $m \times n$ board, find the minimum number of pieces Danielle can use to fill it. [i]Note: The pieces can be rotated[/i].

We are given a hexagon with a number written on each of its sides and vertices. Each number on a vertex is equal to the sum of the two numbers on neighbouring sides. Assume all numbers of the sides and one vertex number were erased. Is it possible to find out the number that had been erased from a vertex? (Folklore)

$60$ symbols, each of which is either $X$ or $O$, are written consecutively on a strip of paper. This strip must then be cut into pieces with each piece containing symbols symmetric about their centre, e.g. $O, XX, OXXXXX, XOX$, etc. (a) Prove that there is a way of cutting the strip so that there are no more than $24$ such pieces. (b) Give an example of such an arrangement of the signs for which the number of pieces cannot be less than $15$. (c) Try to improve the result of (b).

On a square board with $9$ squares (three by three), nine elements of the set $S=\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$ must be placed, different from each other, so that each one is in a box and the following conditions are met: $\bullet$ The sums of the numbers in the second and third rows are, respectively, double and triple the sum of the numbers in the first row. $\bullet$ The sum of the numbers in the second and third columns are, respectively, double and triple the sum of the numbers in the first column. Show all the possible ways to place elements of $S$ on the board, fulfilling the indicated conditions.

In his youth, Professor John Horton Conway lived on a farm with $2009$ cows. Conway wishes to move the cows from the negative $x$ axis to the positive $x$ axis. The cows are initially lined up in order $1, 2, . . . , 2009$ on the negative $x$ axis. Conway can give two possible commands to the cows. One is the PUSH command, upon which the first cow from the negative $x$ axis moves to the lowest position on the positive $y$ axis. The other is the POP command, upon which the cow in the lowest position on the $y$ axis moves to the positive $x$ axis. For example, if Conway says PUSH POP $2009$ times, then the resulting permutation of cows is the same, $1, 2, . . . , 2009$. If Conway says PUSH $2009$ times followed by POP $2009$ times, the resulting permutation of cows is $2009, . . . , 2, 1$. How many output permutations are possible after Conway finishes moving all the cows from the negative $x$ axis to the positive $x$ axis?

On a $n \times n$ grid, each edge are written with $=$ or $\neq$. We need to filled every cells with color black or white. Find the largest constant $k$, such that for every $n>777771449$ and any layout of $=$ and $\neq$, we can always find a way to colored every cells, such that at least $k \cdot 2n(n-1)$ neighboring cells, there colors conform to the symbols on the edge. (Namely, two cells are filled with the same color if $=$ was written on their edge; two cells are filled with different colors if $\neq$ was written on their edge) [i]Proposed by chengbilly & sn6dh[/i]

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

A $10 \times 10 \times 10$ cube is made up up from $500$ white unit cubes and $500$ black unit cubes, arranged in such a way that every two unit cubes that shares a face are in different colors. A line is a $1 \times 1 \times 10$ portion of the cube that is parallel to one of cube’s edges. From the initial cube have been removed $100$ unit cubes such that $300$ lines of the cube has exactly one missing cube. Determine if it is possible that the number of removed black unit cubes is divisible by $4$.

In each vertex of a regular $n$-gon, there is a fortress. At the same moment, each fortress shoots one of the two nearest fortresses and hits it. The [i]result of the shooting[/i] is the set of the hit fortresses; we do not distinguish whether a fortress was hit once or twice. Let $P(n)$ be the number of possible results of the shooting. Prove that for every positive integer $k\geqslant 3$, $P(k)$ and $P(k+1)$ are relatively prime. [i](4th Middle European Mathematical Olympiad, Team Competition, Problem 3)[/i]

Let $n \geq 2$ be a natural number. Find a way to assign natural numbers to the vertices of a regular $2n$-gon such that the following conditions are satisfied: (1) only digits $1$ and $2$ are used; (2) each number consists of exactly $n$ digits; (3) different numbers are assigned to different vertices; (4) the numbers assigned to two neighboring vertices differ at exactly one digit.

$2019$ circles split a plane into a number of parts whose boundaries are arcs of those circles. How many colors are needed to color this geographic map if any two neighboring parts must be coloured with different colours?

[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the playboard shown beside, players $A$ and $B$ alternately fill the empty cells by integers, player $A$ starting. In each step the empty cell and the integer can be chosen arbitrarily. Show that player $A$ can always achieve that all the equalities hold after the last step. [img]https://cdn.artofproblemsolving.com/attachments/c/0/524195b1a8ab8457b72005a162f8124c2b1bd2.png[/img]

Let $1\le k\le n$ be integers. At most how many $k$-element subsets can we select from $\{1,2,\dots,n\}$ such that for any two selected subsets, one of the subsets consists of the $k$ smallest elements of their union?

For any set of points $A_1, A_2,...,A_n$ on the plane, one defines $r( A_1, A_2,...,A_n)$ as the radius of the smallest circle that contains all of these points. Prove that if $n \ge 3$, there are indices $i,j,k$ such that $r( A_1, A_2,...,A_n)=r( A_i, A_j,A_k)$

[u]Round 1[/u] [b]1.1.[/b] A circle has a circumference of $20\pi$ inches. Find its area in terms of $\pi$. [b]1.2.[/b] Let $x, y$ be the solution to the system of equations: $x^2 + y^2 = 10 \,\,\, , \,\,\, x = 3y$. Find $x + y$ where both $x$ and $y$ are greater than zero. [b]1. 3.[/b] Chris deposits $\$ 100$ in a bank account. He then spends $30\%$ of the money in the account on biology books. The next week, he earns some money and the amount of money he has in his account increases by $30 \%$. What percent of his original money does he now have? [u]Round 2[/u] [b]2.1.[/b] The bell rings every $45$ minutes. If the bell rings right before the first class and right after the last class, how many hours are there in a school day with $9$ bells? [b]2.2.[/b] The middle school math team has $9$ members. They want to send $2$ teams to ABMC this year: one full team containing 6 members and one half team containing the other $3$ members. In how many ways can they choose a $6$ person team and a $3$ person team? [b]2.3.[/b] Find the sum: $$1 + (1 - 1)(1^2 + 1 + 1) + (2 - 1)(2^2 + 2 + 1) + (3 - 1)(3^2 + 3 + 1) + ...· + (8 - 1)(8^2 + 8 + 1) + (9 - 1)(9^2 + 9 + 1).$$ [u]Round 3[/u] [b]3.1.[/b] In square $ABHI$, another square $BIEF$ is constructed with diagonal $BI$ (of $ABHI$) as its side. What is the ratio of the area of $BIEF$ to the area of $ABHI$? [b]3.2.[/b] How many ordered pairs of positive integers $(a, b)$ are there such that $a$ and $b$ are both less than $5$, and the value of $ab + 1$ is prime? Recall that, for example, $(2, 3)$ and $(3, 2)$ are considered different ordered pairs. [b]3.3.[/b] Kate Lin drops her right circular ice cream cone with a height of $ 12$ inches and a radius of $5$ inches onto the ground. The cone lands on its side (along the slant height). Determine the distance between the highest point on the cone to the ground. [u]Round 4[/u] [b]4.1.[/b] In a Museum of Fine Mathematics, four sculptures of Euler, Euclid, Fermat, and Allen, one for each statue, are nailed to the ground in a circle. Bob would like to fully paint each statue a single color such that no two adjacent statues are blue. If Bob only has only red and blue paint, in how many ways can he paint the four statues? [b]4.2.[/b] Geo has two circles, one of radius 3 inches and the other of radius $18$ inches, whose centers are $25$ inches apart. Let $A$ be a point on the circle of radius 3 inches, and B be a point on the circle of radius $18$ inches. If segment $\overline{AB}$ is a tangent to both circles that does not intersect the line connecting their centers, find the length of $\overline{AB}$. [b]4.3.[/b] Find the units digit to $2017^{2017!}$. [u]Round 5[/u] [b]5.1.[/b] Given equilateral triangle $\gamma_1$ with vertices $A, B, C$, construct square $ABDE$ such that it does not overlap with $\gamma_1$ (meaning one cannot find a point in common within both of the figures). Similarly, construct square $ACFG$ that does not overlap with $\gamma_1$ and square $CBHI$ that does not overlap with $\gamma_1$. Lines $DE$, $FG$, and $HI$ form an equilateral triangle $\gamma_2$. Find the ratio of the area of $\gamma_2$ to $\gamma_1$ as a fraction. [b]5.2.[/b] A decimal that terminates, like $1/2 = 0.5$ has a repeating block of $0$. A number like $1/3 = 0.\overline{3}$ has a repeating block of length $ 1$ since the fraction bar is only over $ 1$ digit. Similarly, the numbers $0.0\overline{3}$ and $0.6\overline{5}$ have repeating blocks of length $ 1$. Find the number of positive integers $n$ less than $100$ such that $1/n$ has a repeating block of length $ 1$. [b]5.3.[/b] For how many positive integers $n$ between $1$ and $2017$ is the fraction $\frac{n + 6}{2n + 6}$ irreducible? (Irreducibility implies that the greatest common factor of the numerator and the denominator is $1$.) [u]Round 6[/u] [b]6.1.[/b] Consider the binary representations of $2017$, $2017 \cdot 2$, $2017 \cdot 2^2$, $2017 \cdot 2^3$, $... $, $2017 \cdot 2^{100}$. If we take a random digit from any of these binary representations, what is the probability that this digit is a $1$ ? [b]6.2.[/b] Aaron is throwing balls at Carlson’s face. These balls are infinitely small and hit Carlson’s face at only $1$ point. Carlson has a flat, circular face with a radius of $5$ inches. Carlson’s mouth is a circle of radius $ 1$ inch and is concentric with his face. The probability of a ball hitting any point on Carlson’s face is directly proportional to its distance from the center of Carlson’s face (so when you are $2$ times farther away from the center, the probability of hitting that point is $2$ times as large). If Aaron throws one ball, and it is guaranteed to hit Carlson’s face, what is the probability that it lands in Carlson’s mouth? [b]6.3.[/b] The birth years of Atharva, his father, and his paternal grandfather form a geometric sequence. The birth years of Atharva’s sister, their mother, and their grandfather (the same grandfather) form an arithmetic sequence. If Atharva’s sister is $5$ years younger than Atharva and all $5$ people were born less than $200$ years ago (from $2017$), what is Atharva’s mother’s birth year? [u]Round 7[/u] [b]7. 1.[/b] A function $f$ is called an “involution” if $f(f(x)) = x$ for all $x$ in the domain of $f$ and the inverse of $f$ exists. Find the total number of involutions $f$ with domain of integers between $ 1$ and $ 8$ inclusive. [b]7.2.[/b] The function $f(x) = x^3$ is an odd function since each point on $f(x)$ corresponds (through a reflection through the origin) to a point on $f(x)$. For example the point $(-2, -8)$ corresponds to $(2, 8)$. The function $g(x) = x^3 - 3x^2 + 6x - 10$ is a “semi-odd” function, since there is a point $(a, b)$ on the function such that each point on $g(x)$ corresponds to a point on $g(x)$ via a reflection over $(a, b)$. Find $(a, b)$. [b]7.3.[/b] A permutations of the numbers $1, 2, 3, 4, 5$ is an arrangement of the numbers. For example, $12345$ is one arrangement, and $32541$ is another arrangement. Another way to look at permutations is to see each permutation as a function from $\{1, 2, 3, 4, 5\}$ to $\{1, 2, 3, 4, 5\}$. For example, the permutation $23154$ corresponds to the function f with $f(1) = 2$, $f(2) = 3$, $f(3) = 1$, $f(5) = 4$, and $f(4) = 5$, where $f(x)$ is the $x$-th number of the permutation. But the permutation $23154$ has a cycle of length three since $f(1) = 2$, $f(2) = 3$, $f(3) = 1$, and cycles after $3$ applications of $f$ when regarding a set of $3$ distinct numbers in the domain and range. Similarly the permutation $32541$ has a cycle of length three since $f(5) = 1$, $f(1) = 3$, and $f(3) = 5$. In a permutation of the natural numbers between $ 1$ and $2017$ inclusive, find the expected number of cycles of length $3$. [u]Round 8[/u] [b]8.[/b] Find the number of characters in the problems on the accuracy round test. This does not include spaces and problem numbers (or the periods after problem numbers). For example, “$1$. What’s $5 + 10$?” would contain $11$ characters, namely “$W$,” “$h$,” “$a$,” “$t$,” “$’$,” “$s$,” “$5$,” “$+$,” “$1$,” “$0$,” “?”. If the correct answer is $c$ and your answer is $x$, then your score will be $$\max \left\{ 0, 13 -\left\lceil \frac{|x-c|}{100} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

What is the minimum number of movements that a horse must carry out on chess, on an $8\times 8$ board, to reach the upper right square starting at the lower left? Remember that the horse moves in the usual $L$-shaped manner.

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

Alice and Bob play the following game on a $100\times 100$ grid, taking turns, with Alice starting first. Initially the grid is empty. At their turn, they choose an integer from $1$ to $100^2$ that is not written yet in any of the cells and choose an empty cell, and place it in the chosen cell. When there is no empty cell left, Alice computes the sum of the numbers in each row, and her score is the maximum of these $100$ numbers. Bob computes the sum of the numbers in each column, and his score is the maximum of these $100$ numbers. Alice wins if her score is greater than Bob's score, Bob wins if his score is greater than Alice's score, otherwise no one wins. Find if one of the players has a winning strategy, and if so which player has a winning strategy. [i]Théo Lenoir, France[/i]

Given an integer $n \ge 2$, determine the number of ordered $n$-tuples of integers $(a_1, a_2,...,a_n)$ such that (a) $a_1 + a_2 + .. + a_n \ge n^2$ and (b) $a_1^2 + a_2^2 + ... + a_n^2 \le n^3 + 1$