[u]Round 1[/u] [b]p1. [/b]The Queen of Bees invented a new language for her hive. The alphabet has only $6$ letters: A, C, E, N, R, T; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the word TRANCE immediately follows NECTAR. What is the last word in the dictionary? [b]p2.[/b] Is it possible to solve the equation $\frac{1}{x}= \frac{1}{y} +\frac{1}{z}$ with $x,y,z$ integers (positive or negative) such that one of the numbers $x,y,z$ has one digit, another has two digits, and the remaining one has three digits? [b]p3.[/b] The $10,000$ dots in a $100\times 100$ square grid are all colored blue. Rekha can paint some of them red, but there must always be a blue dot on the line segment between any two red dots. What is the largest number of dots she can color red? The picture shows a possible coloring for a $5\times 7$ grid. [img]https://cdn.artofproblemsolving.com/attachments/0/6/795f5ab879938ed2a4c8844092b873fb8589f8.jpg[/img] [b]p4.[/b] Six flies rest on a table. You have a swatter with a checkerboard pattern, much larger than the table. Show that there is always a way to position and orient the swatter to kill at least five of the flies. Each fly is much smaller than a swatter square and is killed if any portion of a black square hits any part of the fly. [b]p5.[/b] Maryam writes all the numbers $1-81$ in the cells of a $9\times 9$ table. Tian calculates the product of the numbers in each of the nine rows, and Olga calculates the product of the numbers in every column. Could Tian's and Olga's lists of nine products be identical? [u]Round 2[/u] [b]p6.[/b] A set of points in the plane is epic if, for every way of coloring the points red or blue, it is possible to draw two lines such that each blue point is on a line, but none of the red points are. The figure shows a particular set of $4$ points and demonstrates that it is epic. What is the maximum possible size of an epic set? [img]https://cdn.artofproblemsolving.com/attachments/e/f/44fd1679c520bdc55c78603190409222d0b721.jpg[/img] [b]p7.[/b] Froggy Chess is a game played on a pond with lily pads. First Judit places a frog on a pad of her choice, then Magnus places a frog on a different pad of his choice. After that, they alternate turns, with Judit moving first. Each player, on his or her turn, selects either of the two frogs and another lily pad where that frog must jump. The jump must reduce the distance between the frogs (all distances between the lily pads are different), but both frogs cannot end up on the same lily pad. Whoever cannot make a move loses. The picture below shows the jumps permitted in a particular situation. Who wins the game if there are $2017$ lily pads? [img]https://cdn.artofproblemsolving.com/attachments/a/9/1a26e046a2a614a663f9d317363aac61654684.jpg[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Some of $n$ towns are connected by two-way airlines. There are $m$ airlines in total. For $i = 1, 2, \cdots, n$, let $d_i$ be the number of airlines going from town $i$. If $1\le d_i \le 2010$ for each $i = 1, 2,\cdots, 2010$, prove that \[\displaystyle\sum_{i=1}^n d_i^2\le 4022m- 2010n\] Find all $n$ for which equality can be attained. [i]Proposed by Aleksandar Ilic[/i]

Two positive integers are written on the blackboard. Initially, one of them is $2000$ and the other is smaller than $2000$. If the arithmetic mean $ m$ of the two numbers on the blackboard is an integer, the following operation is allowed: one of the two numbers is erased and replaced by $ m$. Prove that this operation cannot be performed more than ten times. Give an example where the operation is performed ten times.

Two players play the following game. The first player starts by writing either $0$ or $1$ and then, on his every move, chooses either $0$ or $1$ and writes it to the right of the existing digits until there are $1999$ digits. Each time the first player puts down a digit (except the first one) , the second player chooses two digits among those already written and swaps them. Can the second player guarantee that after his last move the line of digits will be symmetrical about the middle digit? (I Izmestiev)

This problem is given by my teacher. :wink: [size=120]Seven skiers numbered 1,2,3,4,5,6,7 set out in turn at the starting point,each one slides the same distance at a constant speed. During this period,everyone just had two "beyond" experience.(going beyond one skier or be went beyond by another skier is called a "beyond" experience). When the race ended,we would decide the rank according to the order that skiers reached the ending. Prove that:there are two different rank at most.[/size]

Prove that in the set consisting of $\binom{2n}{n}$ people we can find a group of $n+1$ people in which everyone knows everyone or noone knows noone.

There are $mn$ line segments in a plane that connect $n$ given points. Prove that a sequence $V_0$, $V_1$, $...$, $V_m$ of different points can be selected from them such that $V_{i-1}$ and $V_i$ are connected by a line ($1 \le i \le m$).

Six mathematician sit around a round table. Each of them has a number and they do the following transformation: Each time, two mathematician sitting next to each other is chosen, they will add $1$ to their own number. Is it possible to make all the six numbers equal if the initial numbers are a) 6,5,4,3,2,1 b) 7,5,3,2,1,4

[b]p10.[/b] Square $ABCD$ has side length $n > 1$. Points $E$ and $F$ lie on $\overline{AB}$ and $\overline{BC}$ such that $AE = BF = 1$. Suppose $\overline{DE}$ and $\overline{AF}$ intersect at $X$ and $\frac{AX}{XF} = \frac{11}{111}$ . What is $n$? [b]p11.[/b] Let $x$ be the positive root of $x^2 - 10x - 10 = 0$. Compute $\frac{1}{20}x^4 - 6x^2 - 45$. [b]p12.[/b] Francesca has $7$ identical marbles and $5$ distinctly labeled pots. How many ways are there for her to distribute at least one (but not necessarily all) of the marbles into the pots such that at most two pots are nonempty? PS. You should use hide for answers.

Alphabet $A$ contains $n$ letters. $S$ is a set of words of finite length composed of letters of $A$. It is known that every infinite sequence of letters of $A$ begins with one and only one word of $S$. Prove that the set $S$ is finite. [i]Proposed by F. Bakharev[/i]

Prove that for every positive integer $n$ there exists a (not necessarily convex) polygon with no three collinear vertices, which admits exactly $n$ diffferent triangulations. (A [i]triangulation[/i] is a dissection of the polygon into triangles by interior diagonals which have no common interior points with each other nor with the sides of the polygon)

There is a set of weights with the following properties: 1) It contains 5 weights, pairs of different weights. 2) For any two weights, there are two other weights of the same total weight. What is the smallest number of weights that can be in this set?

We are given a 7x7 square board. In each square, one of the diagonals is traced, and then one of the two formed triangles is colored blue. What is the largest area a continuous blue component can have? (Note: continuous blue component means a set of blue triangles connected via their edges, passing through corners is not permitted)

How many subsets of $\{1, 2,...,9\}$ do not contain $2$ adjacent numbers?

There are $10000$ equal tiles in the shape of an equilateral triangle. With these little triangles, regular hexagons are formed, without overlaps or gaps. If the regular hexagon that wastes the fewest triangles is formed, how many triangles are left over?

We have an $n \times n$ board, and in every square there is an integer. The sum of all integers on the board is $0$. We define an action on a square where the integer in the square is decreased by the number of neighbouring squares, and the number inside each of the neighbouring squares is increased by 1. Determine if there exists $n\geq 2$ such that we can turn all the integers into zeros in a finite number of actions.

Divide the plane into $1$x$1$ squares formed by the lattice points. Let$S$ be the set-theoretic union of a finite number of such cells, and let $a$ be a positive real number less than or equal to 1/4.Show that S can be covered by a finite number of squares satisfying the following three conditions: 1) Each square in the cover is an array of $1$x$1$ cells 2) The squares in the cover have pairwise disjoint interios and 3)For each square $Q$ in the cover the ratio of the area $S \cap Q$ to the area of Q is at least $a$ and at most $a {(\lfloor a^{-1/2} \rfloor)} ^2$

The plan of a picture gallery is a chequered figure where each square is a room, and every room can be reached from each other by moving to rooms adjacent by side. A custodian in a room can watch all the rooms that can be reached from this room by one move of a chess rook (without leaving the gallery). What minimum number of custodians is sufficient to watch all the rooms in every gallery of $n$ rooms ($n > 1$)?

Determine whether there exist a positive integer $n<10^9$, such that $n$ can be expressed as a sum of three squares of positive integers by more than $1000$ distinct ways?

What sizes of squares with integer sides can be completely covered without overlap by identical tiles consisting of three squares with side $1$ joined together in one $L$ shape? [center][img]https://cdn.artofproblemsolving.com/attachments/3/f/9fe95b05527857f7e44dfd033e6fb01e5d25a2.png[/img][/center]

It is known that subsets $A_1,A_2, \cdots , A_n$ of set $I=\{1,2,\cdots ,101\}$ satisfy the following condition $$\text{For any } i,j \text{ } (1 \leq i < j \leq n) \text{, there exists } a,b \in A_i \cap A_j \text{ so that } (a,b)=1$$ Determine the maximum positive integer $n$. *$(a,b)$ means $\gcd (a,b)$

For a nonempty set $A$ of integers, let $\mathrm{range} \, A=\max A-\min A$. Find the number of subsets $S$ of \[ \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \] such that $\mathrm{range} \, S$ is an element of $S$.

Can we find $N$ such that all $m\times n$ rectangles with $m,n>N$ can be tiled with $4\times6$ and $5\times7$ rectangles?

In a circle of diameter $1$ consider $65$ points, no three of them collinear. Prove that there exist three among these points which are the vertices of a triangle with area less than or equal to $\frac{1}{72}$.

[b]p1.[/b] Jack made $3$ quarts of fruit drink from orange and apple juice. His drink contains $45\%$ of orange juice. Nick prefers more orange juice in the drink. How much orange juice should he add to the drink to obtain a drink composed of $60\%$ of orange juice? [b]p2.[/b] A square is tiled by smaller squares as shown in the figure. Find the area of the black square in the middle if the perimeter of the big square $ABCD$ is $40$ cm. [img]https://cdn.artofproblemsolving.com/attachments/8/c/d54925cba07f63ec8578048f46e1e730cb8df3.png[/img] [b]p3.[/b] For one particular number $a > 0$ the function f satisfies the equality $f(x + a) =\frac{1 + f(x)}{1 - f(x)}$ for all $x$. Show that $f$ is a periodic function. (A function $f$ is periodic with the period $T$ if $f(x + T) = f(x)$ for any $x$.) [b]p4.[/b] If $a, b, c, x, y, z$ are numbers so that $\frac{x}{a}+\frac{y}{b}+\frac{z}{c}= 1$ and $\frac{a}{x}+\frac{b}{y}+\frac{c}{z}= 0$. Show that $\frac{x^2}{a^2} +\frac{y^2}{b^2} +\frac{z^2}{c^2} = 1$ [b]p5.[/b] Is it possible that a four-digit number $AABB$ is a perfect square? (Same letters denote the same digits). [b]p6.[/b] A finite number of arcs of a circle are painted black (see figure). The total length of these arcs is less than $\frac15$ of the circumference. Show that it is possible to inscribe a square in the circle so that all vertices of the square are in the unpainted portion of the circle. [img]https://cdn.artofproblemsolving.com/attachments/2/c/bdfa61917a47f3de5dd3684627792a9ebf05d5.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].