15000 years ago Tilif ministry in Persia decided to define a code for $n\geq2$ cities. Each code is a sequence of $0,1$ such that no code start with another code. We know that from $2^{m}$ calls from foreign countries to Persia $2^{m-a_{i}}$ of them where from the $i$-th city (So $\sum_{i=1}^{n}\frac1{2^{a_{i}}}=1$). Let $l_{i}$ be length of code assigned to $i$-th city. Prove that $\sum_{i=1}^{n}\frac{l_{i}}{2^{i}}$ is minimum iff $\forall i,\ l_{i}=a_{i}$

Suppose $S$ is a subset of $\{1, 2, 3, 4, 5, 6, 7\}$. How many different possible values are there for the product of the elements in $S$?

At the meeting, each person is familiar with 22 people. If two persons $A$ and $B$ know each with one another, among the remaining people they do not have a common friend. For each pair individuals $A$ and $B$ are not familiar with each other, there are among the remaining six common acquaintances. How many people were at the meeting?

A football tournament is played between 5 teams, each two of which playing exactly one match. 5 points are awarded for a victory and 0 – for a loss. In case of a draw 1 point is awarded to both teams, if no goals are scored, and 2 – if they have scored any. In the final ranking the five teams had points that were 5 consecutive numbers. Determine the least number of goals that could be scored in the tournament.

There are $n -1$ red balls, $n$ green balls and $n + 1$ blue balls in a bag. The number of ways of choosing two balls from the bag that have different colours is $299$. What is the value of $n$?

Exactly 1600 Coconuts are distributed on exactly 100 monkeys, where some monkeys also can have 0 coconuts. Prove that, no matter how you distribute the coconuts, at least 4 monkeys will always have the same amount of coconuts. (The original problem is written in German. So, I apologize when I've changed the original problem or something has become unclear while translating.)

Prove that from any sequence of $1996$ real numbers $a_1$, $a_2$,$...$, $a_{1996}$ one can choose one or several numbers standing successively one after another so that their sum differs from an integer by less than $0.001$. (A Kanel)

Find the number of ways there are to permute the elements of the set $\{1,2,3,4,5,6,7,8,9\}$ such that no two adjacent numbers are both even or both odd. [i]Proposed by Ephram Chun[/i]

[b]p1.[/b] What is the smallest possible value for the product of two real numbers that differ by ten? [b]p2.[/b] Determine the number of positive integers $n$ with $1 \le n \le 400$ that satisfy the following: $\bullet$ $n$ is a square number. $\bullet$ $n$ is one more than a multiple of $5$. $\bullet$ $n$ is even. [b]p3.[/b] How many positive integers less than $2019$ are either a perfect cube or a perfect square but not both? [b]p4.[/b] Felicia draws the heart-shaped figure $GOAT$ that is made of two semicircles of equal area and an equilateral triangle, as shown below. If $GO = 2$, what is the area of the figure? [img]https://cdn.artofproblemsolving.com/attachments/3/c/388daa657351100f408ab3f1185f9ab32fcca5.png[/img] [b]p5.[/b] For distinct digits $A, B$, and $ C$: $$\begin{tabular}{cccc} & A & A \\ & B & B \\ + & C & C \\ \hline A & B & C \\ \end{tabular}$$ Compute $A \cdot B \cdot C$. [b]p6 [/b] What is the difference between the largest and smallest value for $lcm(a,b,c)$, where $a,b$, and $c$ are distinct positive integers between $1$ and $10$, inclusive? [b]p7.[/b] Let $A$ and $B$ be points on the circumference of a circle with center $O$ such that $\angle AOB = 100^o$. If $X$ is the midpoint of minor arc $AB$ and $Y$ is on the circumference of the circle such that $XY\perp AO$, find the measure of $\angle OBY$ . [b]p8. [/b]When Ben works at twice his normal rate and Sammy works at his normal rate, they can finish a project together in $6$ hours. When Ben works at his normal rate and Sammy works as three times his normal rate, they can finish the same project together in $4$ hours. How many hours does it take Ben and Sammy to finish that project if they each work together at their normal rates? [b][b]p9.[/b][/b] How many positive integer divisors $n$ of $20000$ are there such that when $20000$ is divided by $n$, the quotient is divisible by a square number greater than $ 1$? [b]p10.[/b] What’s the maximum number of Friday the $13$th’s that can occur in a year? [b]p11.[/b] Let circle $\omega$ pass through points $B$ and $C$ of triangle $ABC$. Suppose $\omega$ intersects segment $AB$ at a point $D \ne B$ and intersects segment $AC$ at a point $E \ne C$. If $AD = DC = 12$, $DB = 3$, and $EC = 8$, determine the length of $EB$. [b]p12.[/b] Let $a,b$ be integers that satisfy the equation $2a^2 - b^2 + ab = 18$. Find the ordered pair $(a,b)$. [b]p13.[/b] Let $a,b,c$ be nonzero complex numbers such that $a -\frac{1}{b}= 8, b -\frac{1}{c}= 10, c -\frac{1}{a}= 12.$ Find $abc -\frac{1}{abc}$ . [b]p14.[/b] Let $\vartriangle ABC$ be an equilateral triangle of side length $1$. Let $\omega_0$ be the incircle of $\vartriangle ABC$, and for $n > 0$, define the infinite progression of circles $\omega_n$ as follows: $\bullet$ $\omega_n$ is tangent to $AB$ and $AC$ and externally tangent to $\omega_{n-1}$. $\bullet$ The area of $\omega_n$ is strictly less than the area of $\omega_{n-1}$. Determine the total area enclosed by all $\omega_i$ for $i \ge 0$. [b]p15.[/b] Determine the remainder when $13^{2020} +11^{2020}$ is divided by $144$. [b]p16.[/b] Let $x$ be a solution to $x +\frac{1}{x}= 1$. Compute $x^{2019} +\frac{1}{x^{2019}}$ . [b]p17. [/b]The positive integers are colored black and white such that if $n$ is one color, then $2n$ is the other color. If all of the odd numbers are colored black, then how many numbers between $100$ and $200$ inclusive are colored white? [b]p18.[/b] What is the expected number of rolls it will take to get all six values of a six-sided die face-up at least once? [b]p19.[/b] Let $\vartriangle ABC$ have side lengths $AB = 19$, $BC = 2019$, and $AC = 2020$. Let $D,E$ be the feet of the angle bisectors drawn from $A$ and $B$, and let $X,Y$ to be the feet of the altitudes from $C$ to $AD$ and $C$ to $BE$, respectively. Determine the length of $XY$ . [b]p20.[/b] Suppose I have $5$ unit cubes of cheese that I want to divide evenly amongst $3$ hungry mice. I can cut the cheese into smaller blocks, but cannot combine blocks into a bigger block. Over all possible choices of cuts in the cheese, what’s the largest possible volume of the smallest block of cheese? PS. You had better use hide for answers.

In a $3 \times 25$ board, $1 \times 3$ pieces are placed (vertically or horizontally) so that they occupy entirely $3$ boxes on the board and do not have a common point. What is the maximum number of pieces that can be placed, and for that number, how many configurations are there? [hide=original formulation] Num tabuleiro 3 × 25 s˜ao colocadas pe¸cas 1 × 3 (na vertical ou na horizontal) de modo que ocupem inteiramente 3 casas do tabuleiro e n˜ao se toquem em nenhum ponto. Qual ´e o n´umero m´aximo de pe¸cas que podem ser colocadas, e para esse n´umero, quantas configura¸c˜oes existem? [url=https://www.obm.org.br/content/uploads/2018/09/Provas_OMCPLP_2018.pdf]source[/url][/hide]

A ternary sequence is one whose terms all lie in the set $\{0, 1, 2\}$. Let $w$ be a length $n$ ternary sequence $(a_1,\ldots,a_n)$. Prove that $w$ can be extended leftwards and rightwards to a length $m=6n$ ternary sequence \[(d_1,\ldots,d_m) = (b_1,\ldots,b_p,a_1,\ldots,a_n,c_1,\ldots,c_q), \quad p,q\geqslant 0,\]containing no length $t > 2n$ palindromic subsequence. (A sequence is called palindromic if it reads the same rightwards and leftwards. A length $t$ subsequence of $(d_1,\ldots,d_m)$ is a sequence of the form $(d_{i_1},\ldots,d_{i_t})$, where $1\leqslant i_1<\cdots<i_t \leqslant m$.)

Let $A$ be the number of arrangements of the letters in JOHNS HOPKINS such that no two Os are adjacent, no two Hs are adjacent, no two Ns are adjacent, and no two Ss are adjacent. Find $\frac{A}{8!}$.

Let $S$ be the set of $n$-uples $\left( x_{1}, x_{2}, \ldots, x_{n}\right)$ such that $x_{i}\in \{ 0, 1 \}$ for all $i \in \overline{1,n}$, where $n \geq 3$. Let $M(n)$ be the smallest integer with the property that any subset of $S$ with at least $M(n)$ elements contains at least three $n$-uples \[\left( x_{1}, \ldots, x_{n}\right), \, \left( y_{1}, \ldots, y_{n}\right), \, \left( z_{1}, \ldots, z_{n}\right) \] such that \[\sum_{i=1}^{n}\left( x_{i}-y_{i}\right)^{2}= \sum_{i=1}^{n}\left( y_{i}-z_{i}\right)^{2}= \sum_{i=1}^{n}\left( z_{i}-x_{i}\right)^{2}. \] (a) Prove that $M(n) \leq \left\lfloor \frac{2^{n+1}}{n}\right\rfloor+1$. (b) Compute $M(3)$ and $M(4)$.

There are three boxes, one blue, one white and one red, and $8$ balls. Each of the balls has a number from $1$ to $8$ written on it, without repetitions. The $8$ balls are distributed in the boxes, so that there are at least two balls in each box. Then, in each box, add up all the numbers written on the balls it contains. The three outcomes are called the blue sum, the white sum, and the red sum, depending on the color of the corresponding box. Find all possible distributions of the balls such that the red sum equals twice the blue sum, and the red sum minus the white sum equals the white sum minus the blue sum.

Given a set $S$, of integers, an [i]optimal partition[/i] of S into sets T, U is a partition which minimizes the value $|t - u|$, where $t$ and $u$ are the sum of the elements of $T$ and U respectively. Let $P$ be a set of distinct positive integers such that the sum of the elements of $P$ is $2k$ for a positive integer $k$, and no subset of $P$ sums to $k$. Either show that there exists such a $P$ with at least $2020$ different optimal partitions, or show that such a $P$ does not exist.

A and B play a game on a square board consisting of $n \times n$ white tiles, where $n \ge 2$. A moves first, and the players alternate taking turns. A move consists of picking a square consisting of $2\times 2$ or $3\times 3$ white tiles and colouring all these tiles black. The first player who cannot find any such squares has lost. Show that A can always win the game if A plays the game right.

[b]p1[/b]. Prove that there is no interger $n$ such that $n^2 +1$ is divisible by $7$. [b]p2.[/b] Find all solutions of the system $$x^2-yz=1$$ $$y^2-xz=2$$ $$z^2-xy=3$$ [b]p3.[/b] A triangle with long legs is an isoceles triangle in which the length of the two equal sides is greater than or equal to the length of the remaining side. What is the maximum number, $n$ , of points in the plane with the property that every three of them form the vertices of a triangle with long legs? Prove all assertions. [b]p4.[/b] Prove that the area of a quadrilateral of sides $a, b, c, d$ which can be inscribed in a circle and circumscribed about another circle is given by $A=\sqrt{abcd}$ [b]p5.[/b] Prove that all of the squares of side length $$\frac{1}{2},\frac{1}{3},\frac{1}{4},\frac{1}{5},\frac{1}{6},...,\frac{1}{n},...$$ can fit inside a square of side length $1$ without overlap. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n \geqslant 2$ be an integer. We consider a square grid of size $2n \times 2n$ divided into $4n^2$ unit squares. The grid is called [i]balanced[/i] if: [list] [*]Each cell contains a number equal to $-1$, $0$ or $1$. [*]The absolute value of the sum of the numbers in the grid does not exceed $4n$. [/list] Determine, as a function of $n$, the smallest integer $k \geqslant 1$ such that any balanced grid always contains an $n \times n$ square whose absolute sum of the $n^2$ cells is less than or equal to $k$.

[b]p1.[/b] (a) Suppose $101$ Dalmatians chase $2012$ squirrels. Each squirrel gets chased by at most one Dalmatian, and each Dalmatian chases at least one squirrel. Show that two Dalmatians chase the same number of squirrels. (b) What is the largest number of Dalmatians that can chase $2012$ squirrels in a way that each Dalmatian chases at least one squirrel and no two Dalmatians chase the same number of squirrels? [b]p2.[/b] Lucy and Linus play the following game. They start by putting the integers $1, 2, 3, ..., 2012$ in a hat. In each round of the game, Lucy and Linus each draw a number from the hat. If the two numbers are $a$ and $b$, they throw away these numbers and put the number $|a - b|$ back into the hat. After $2011$ rounds, there is only one number in the hat. If it is even, Lucy wins. If it is odd, Linus wins. (a) Prove that there is a sequence of drawings that makes Lucy win. (b) Prove that Lucy always wins. [b]p3.[/b] Suppose $x$ is a positive real number and $x^{1990}$, $x^{2001}$, and $x^{2012}$ differ by integers. Prove that $x$ is an integer. [b]p4.[/b] Suppose that each point in three-dimensional space is colored with one of five colors and suppose that each color is used at least once. Prove that there is some plane that contains at least four of the colors. [b]p5.[/b] Two circles, $C_1$ and $C_2$, are tangent at point $A$, with $C_1$ lying inside $C_2$ (and $C_1 \ne C_2$). The line through their centers intersects $C_1$ at $B_1$ and $C_2$ at $B_2$. A line $L$ is drawn through $A$ and it intersects $C_1$ at $P_1$ (with $P_1 \ne A$) and intersects $C_2$ at $P_2$ (with $P_2 \ne A$). The perpendicular from $P_2$ to the line $B_1B_2$ intersects the line $B_1B_2$ at $F$. Prove that if the line $P_1F$ is tangent to $C_1$ then $F$ is the midpoint of the line segment $B_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/9/e/4db59be9fa764d3e910a828ed3296907ca5657.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Find all triples of positive integers such that the sum of their reciprocals is equal to one. [b]p2.[/b] Prove that $a(a + 1)(a + 2)(a + 3)$ is divisible by $24$. [b]p3.[/b] There are $20$ very small red chips and some blue ones. Find out whether it is possible to put them on a large circle such that (a) for each chip positioned on the circle the antipodal position is occupied by a chip of different color; (b) there are no two neighboring blue chips. [b]p4.[/b] A $12$ liter container is filled with gasoline. How to split it in two equal parts using two empty $5$ and $8$ liter containers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A collection of $2000$ congruent circles is given on the plane such that no two circles are tangent and each circle meets at least two other circles. Let $N$ be the number of points that belong to at least two of the circles. Find the smallest possible value of $N$.

$(MON 3)$ Let $A_k (1 \le k \le h)$ be $n-$element sets such that each two of them have a nonempty intersection. Let $A$ be the union of all the sets $A_k,$ and let $B$ be a subset of $A$ such that for each $k (1\le k \le h)$ the intersection of $A_k$ and $B$ consists of exactly two different elements $a_k$ and $b_k$. Find all subsets $X$ of the set $A$ with $r$ elements satisfying the condition that for at least one index $k,$ both elements $a_k$ and $b_k$ belong to $X$.

A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles. [i]Calvin Deng.[/i]

$\textbf{Problem C.1}$ There are two piles of coins, each containing $2010$ pieces. Two players $A$ and $B$ play a game taking turns ($A$ plays first). At each turn, the player on play has to take one or more coins from one pile or exactly one coin from each pile. Whoever takes the last coin is the winner. Which player will win if they both play in the best possible way?

There are $100$ points on the circumference of a circle, arbitrarily labelled by $1,2,\ldots,100$. For each three points, call their triangle [b]clockwise[/b] if the increasing order of them is in clockwise order. Prove that it is impossible to have exactly $2017$ [b]clockwise[/b] triangles.