A toy factory produces several kinds of clay toys. The toys are painted in $k$ colours. [i]Diversity[/i] of a colour is the number of [i]different[/i] toys of that colour. (Thus, if there are $5$ blue cats, $7$ blue mice and nothing else is blue, the diversity of colour blue is $2$.) The painting protocol requires that [i]each colour is used and the diversities of each two colours are different[/i]. The toys in the store could be painted according to the protocol. However, a batch of clay Cheburashkas arrived at the store before painting (there were no Cheburashkas before). The number of Cheburashkas is not less that the number of the toys of any other kind. The total number of all toys, including Cheburashkas, is at least $\frac{(k+1)(k+2)}{2}$. Prove that now the toys can be painted in $k + 1$ colours according to the protocol. [i]Proposed by F. Petrov[/i]

Let $n \ge 2$ be a positive integer and $\mathcal{F}$ the set of functions $f:\{1,2,\ldots,n\} \to \{1,2,\ldots,n\}$ that satisfy $f(k) \le f(k+1) \le f(k)+1,$ for all $k \in \{1,2,\ldots,n-1\}.$ a) Find the cardinal of the set $\mathcal{F}.$ b) Find the total number of fixed points of the functions in $\mathcal{F}.$

There are $28$ students who have to be separated into two groups such that the number of students in each group is a multiple of $4$. The number of ways to split them into the groups can be written as $$\sum_{k \ge 0} 2^k a_k = a_0 +2a_1 +4a_2 +...$$ where each $a_i$ is either $0$ or $1$. Find the value of $$\sum_{k \ge 0} ka_k = 0+ a_1 +2a_2 +3a3_ +....$$

[b]p1.[/b] Let $x_1 = 0$, $x_2 = 1/2$ and for $n >2$, let $x_n$ be the average of $x_{n-1}$ and $x_{n-2}$. Find a formula for $a_n = x_{n+1} - x_{n}$, $n = 1, 2, 3, \dots$. Justify your answer. [b]p2.[/b] Given a triangle $ABC$. Let $h_a, h_b, h_c$ be the altitudes to its sides $a, b, c,$ respectively. Prove: $\frac{1}{h_a}+\frac{1}{h_b}>\frac{1}{h_c}$ Is it possible to construct a triangle with altitudes $7$, $11$, and $20$? Justify your answer. [b]p3.[/b] Does there exist a polynomial $P(x)$ with integer coefficients such that $P(0) = 1$, $P(2) = 3$ and $P(4) = 9$? Justify your answer. [b]p4.[/b] Prove that if $\cos \theta$ is rational and $n$ is an integer, then $\cos n\theta$ is rational. Let $\alpha=\frac{1}{2010}$. Is $\cos \alpha $ rational ? Justify your answer. [b]p5.[/b] Let function $f(x)$ be defined as $f(x) = x^2 + bx + c$, where $b, c$ are real numbers. (A) Evaluate $f(1) -2f(5) + f(9)$ . (B) Determine all pairs $(b, c)$ such that $|f(x)| \le 8$ for all $x$ in the interval $[1, 9]$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be an equilateral triangle and $\mathcal{E}$ the set of all points contained in the three segments $AB$, $BC$, and $CA$ (including $A$, $B$, and $C$). Determine whether, for every partition of $\mathcal{E}$ into two disjoint subsets, at least one of the two subsets contains the vertices of a right-angled triangle.

A person moves in the $x-y$ plane moving along points with integer co-ordinates $x$ and $y$ only. When she is at a point $(x,y)$, she takes a step based on the following rules: (a) if $x+y$ is even she moves to either $(x+1,y)$ or $(x+1,y+1)$; (b) if $x+y$ is odd she moves to either $(x,y+1)$ or $(x+1,y+1)$. How many distinct paths can she take to go from $(0,0)$ to $(8,8)$ given that she took exactly three steps to the right $((x,y)$ to $(x+1,y))$?

Some players participate in a competition. Suppose that each player plays one game against every other player and there is no draw game in the competition. Player $A$ is regarded as an excellent player if the following condition is satisfied: for any other player $B$, either $A$ beats $B$ or there exists another player $C$ such that $C$ beats $B$ and $A$ beats $C$. It is known that there is only one excellent player in the end, prove that this player beats all other players.

Write $2017$ following numbers on the blackboard: $-\frac{1008}{1008}, -\frac{1007}{1008}, ..., -\frac{1}{1008}, 0,\frac{1}{1008},\frac{2}{1008}, ... ,\frac{1007}{1008},\frac{1008}{1008}$ . One processes some steps as: erase two arbitrary numbers $x, y$ on the blackboard and then write on it the number $x + 7xy + y$. After $2016$ steps, there is only one number. The last one on the blackboard is (A): $-\frac{1}{1008}$ (B): $0$ (C): $\frac{1}{1008}$ (D): $-\frac{144}{1008}$ (E): None of the above

At the end of the school year it became clear that for any arbitrarily chosen group of no less than 5 students, 80% of the marks “F” received by this group were given to no more than 20% of the students in the group. Prove that at least 3/4 of all “F” marks were given to the same student.

Find the number of permutations of the letters $AAAABBBCC$ where no letter is next to another letter of the same type. For example, count $ABCABCABA$ and $ABABCABCA$ but not $ABCCBABAA$.

An $n\times n\times n$ cube is divided into unit cubes. We are given a closed non-self-intersecting polygon (in space), each of whose sides joins the centers of two unit cubes sharing a common face. The faces of unit cubes which intersect the polygon are said to be distinguished. Prove that the edges of the unit cubes may be colored in two colors so that each distinguished face has an odd number of edges of each color, while each nondistinguished face has an even number of edges of each color. [i]M. Smurov[/i]

A machine accepts coins of $k{}$ values $1 = a_1 <\cdots < a_k$ and sells $k{}$ different drinks with prices $0<b_1 < \cdots < b_k$. It is known that if we start inserting coins into the machine in an arbitrary way, sooner or later the total value of the coins will be equal to the price of a drink. For which sets of numbers $(a_1,\ldots,a_k;b_1,\ldots,b_k)$ does this property hold?

On a plane are given $6$ red, $6$ blue, and $6$ green points, such that no three of the given points lie on a line. Prove that the sum of the areas of the triangles whose vertices are of the same color does not exceed quarter the sum of the areas of all triangles with vertices in the given points.

The Frontier Lands have $50$ towns, some pairs of which are directly connected by Morton’s railroad tracks (which are bidirectional and may pass over each other), and it is possible to travel from any town to any other town via these tracks, possibly stopping at other towns on the way. Morton decides that he wants some tracks destroyed so that each town is directly connected to an odd number of other towns. (After Morton destroys the tracks, it might no longer be possible to travel from any town to any other town.) Prove that this is possible.

Some edges are painted in red. We say that a coloring of this kind is [i]good[/i], if for each vertex of the polyhedron, there exists an edge which concurs in that vertex and is not painted red. Moreover, we say that a coloring where some of the edges of a regular polyhedron is [i]completely good[/i], if in addition to being [i]good[/i], no face of the polyhedron has all its edges painted red. What regular polyhedrons is equal the maximum number of edges that can be painted in a [i]good[/i] color and a [i]completely good[/i]? Explain your answer.

There are $2022$ equally spaced points on a circular track $\gamma$ of circumference $2022$. The points are labeled $A_1, A_2, \ldots, A_{2022}$ in some order, each label used once. Initially, Bunbun the Bunny begins at $A_1$. She hops along $\gamma$ from $A_1$ to $A_2$, then from $A_2$ to $A_3$, until she reaches $A_{2022}$, after which she hops back to $A_1$. When hopping from $P$ to $Q$, she always hops along the shorter of the two arcs $\widehat{PQ}$ of $\gamma$; if $\overline{PQ}$ is a diameter of $\gamma$, she moves along either semicircle. Determine the maximal possible sum of the lengths of the $2022$ arcs which Bunbun traveled, over all possible labellings of the $2022$ points. [i]Kevin Cong[/i]

Let $n$ be a positive integer. Dominoes are placed on a $2n \times 2n$ board in such a way that every cell of the board is adjacent to exactly one cell covered by a domino. For each $n$, determine the largest number of dominoes that can be placed in this way. (A domino is a tile of size $2 \times 1$ or $1 \times 2$. Dominoes are placed on the board in such a way that each domino covers exactly two cells of the board, and dominoes do not overlap. Two cells are said to be adjacent if they are different and share a common side.)

[b]p1.[/b] Compute the greatest integer less than or equal to $$\frac{10 + 12 + 14 + 16 + 18 + 20}{21}$$ [b]p2.[/b] Let$ A = 1$.$B = 2$, $C = 3$, $...$, $Z = 26$. Find $A + B +M + C$. [b]p3.[/b] In Mr. M's farm, there are $10$ cows, $8$ chickens, and $4$ spiders. How many legs are there (including Mr. M's legs)? [b]p4.[/b] The area of an equilateral triangle with perimeter $18$ inches can be expressed in the form $a\sqrt{b}{c}$ , where $a$ and $c$ are relatively prime and $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p5.[/b] Let $f$ be a linear function so $f(x) = ax + b$ for some $a$ and $b$. If $f(1) = 2017$ and $f(2) = 2018$, what is $f(2019)$? [b]p6.[/b] How many integers $m$ satisfy $4 < m^2 \le 216$? [b]p7.[/b] Allen and Michael Phelps compete at the Olympics for swimming. Allen swims $\frac98$ the distance Phelps swims, but Allen swims in $\frac59$ of Phelps's time. If Phelps swims at a rate of $3$ kilometers per hour, what is Allen's rate of swimming? The answer can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$. [b]p8.[/b] Let $X$ be the number of distinct arrangements of the letters in "POONAM," $Y$ be the number of distinct arrangements of the letters in "ALLEN" and $Z$ be the number of distinct arrangements of the letters in "NITHIN." Evaluate $\frac{X+Z}{Y}$ : [b]p9.[/b] Two overlapping circles, both of radius $9$ cm, have centers that are $9$ cm apart. The combined area of the two circles can be expressed as $\frac{a\pi+b\sqrt{c}+d}{e}$ where $c$ is not divisible by the square of any prime and the fraction is simplified. Find $a + b + c + d + e$. [b]p10.[/b] In the Boxborough-Acton Regional High School (BARHS), $99$ people take Korean, $55$ people take Maori, and $27$ people take Pig Latin. $4$ people take both Korean and Maori, $6$ people take both Korean and Pig Latin, and $5$ people take both Maori and Pig Latin. $1$ especially ambitious person takes all three languages, and and $100$ people do not take a language. If BARHS does not oer any other languages, how many students attend BARHS? [b]p11.[/b] Let $H$ be a regular hexagon of side length $2$. Let $M$ be the circumcircle of $H$ and $N$ be the inscribed circle of $H$. Let $m, n$ be the area of $M$ and $N$ respectively. The quantity $m - n$ is in the form $\pi a$, where $a$ is an integer. Find $a$. [b]p12.[/b] How many ordered quadruples of positive integers $(p, q, r, s)$ are there such that $p + q + r + s \le 12$? [b]p13.[/b] Let $K = 2^{\left(1+ \frac{1}{3^2} \right)\left(1+ \frac{1}{3^4} \right)\left(1+ \frac{1}{3^8}\right)\left(1+ \frac{1}{3^{16}} \right)...}$. What is $K^8$? [b]p14.[/b] Neetin, Neeton, Neethan, Neethine, and Neekhil are playing basketball. Neetin starts out with the ball. How many ways can they pass 5 times so that Neethan ends up with the ball? [b]p15.[/b] In an octahedron with side lengths $3$, inscribe a sphere. Then inscribe a second sphere tangent to the first sphere and to $4$ faces of the octahedron. The radius of the second sphere can be expressed in the form $\frac{\sqrt{a}-\sqrt{b}}{c}$ , where the square of any prime factor of $c$ does not evenly divide into $b$. Compute $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. We know that the set $I_n = \{ 1, 2,\ldots , n\}$ has exactly $2^n$ subsets, so there are $8^n$ ordered triples $(A, B, C)$, where $A, B$, and $C$ are subsets of $I_n$. For each of these triples we consider the number $\mid A \cap B \cap C\mid$. Prove that the sum of the $8^n$ numbers considered is a multiple of $n$. Clarification: $\mid Y\mid$ denotes the number of elements in the set $Y$.

[b]p1.[/b] Prove that if $a, b, c, d$ are real numbers, then $$\max \{a + c, b + d\} \le \max \{a, b\} + \max \{c, d\}$$ [b]p2.[/b] Find the smallest positive integer whose digits are all ones which is divisible by $3333333$. [b]p3.[/b] Find all integer solutions of the equation $\sqrt{x} +\sqrt{y} =\sqrt{2560}$. [b]p4.[/b] Find the irrational number: $$A =\sqrt{ \frac12+\frac12 \sqrt{\frac12+\frac12 \sqrt{ \frac12 +...+ \frac12 \sqrt{ \frac12}}}}$$ ($n$ square roots). [b]p5.[/b] The Math country has the shape of a regular polygon with $N$ vertexes. $N$ airports are located on the vertexes of that polygon, one airport on each vertex. The Math Airlines company decided to build $K$ additional new airports inside the polygon. However the company has the following policies: (i) it does not allow three airports to lie on a straight line, (ii) any new airport with any two old airports should form an isosceles triangle. How many airports can be added to the original $N$? [b]p6.[/b] The area of the union of the $n$ circles is greater than $9$ m$^2$(some circles may have non-empty intersections). Is it possible to choose from these $n$ circles some number of non-intersecting circles with total area greater than $1$ m$^2$? PS. You should use hide for answers.

Prove that there are $2012$ points in the plane, none of which are three on one straight line and in pairs have integer distances .

What is the maximum number of subsets of size $5$, taken from the set $A=\{1,2,3,...,20\}$ such that any $2$ of them share exactly $1$ element.

In some country several pairs of cities are connected by direct two-way flights. It is possible to go from any city to any other by a sequence of flights. The distance between two cities is defined to be the least possible numbers of flights required to go from one of them to the other. It is known that for any city there are at most $100$ cities at distance exactly three from it. Prove that there is no city such that more than $2550$ other cities have distance exactly four from it.

Among a group of programmers, every two either know each other or do not know each other. Eleven of them are geniuses. Two companies hire them one at a time, alternately, and may not hire someone already hired by the other company. There are no conditions on which programmer a company may hire in the first round. Thereafter, a company may only hire a programmer who knows another programmer already hired by that company. Is it possible for the company which hires second to hire ten of the geniuses, no matter what the hiring strategy of the other company may be?

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )