If $x_i\geq0(i=1,2,\cdots,n)$, and $$\sum_{i=1}^n x_i^2 + 2\sum_{1 \leq k < j \leq n} \sqrt{\frac{k}{j}}x_kx_j = 1.$$ Find the maximum and minumum value of $\sum_{i=1}^n x_i$.

Let $\alpha,\beta,\gamma$ be positive real numbers such that $\alpha+\beta+\gamma < \pi$, $\alpha+\beta > \gamma$,$ \beta+\gamma > \alpha$, $\gamma + \alpha > \beta.$ Prove that with the segments of lengths $\sin \alpha, \sin \beta, \sin \gamma $ we can construct a triangle and that its area is not greater than \[A=\dfrac 18\left( \sin 2\alpha+\sin 2\beta+ \sin 2\gamma \right).\] [i]Proposed by Soviet Union[/i]

Prove that among any $16$ perfect cubes we can always find two cubes whose difference is divisible by $91$.

[b]10.[/b] A car is used by $n$ drivers. Every morning the drivers choose by drawing that one of them who will drive the car that day. Let us define the random variable $\mu (n)$ as the least positive integer such that each driver drives at least one day during the first $\mu (n)$ days. Find the limit distribution of the random variable $\frac {\mu (n) -n \log n}{n}$ as $n \to \infty$. [b](P. 9)[/b]

Let be a natural number $ n\ge 2. $ Prove that there exist exactly two subsets of the set $ \left\{ \left.\left(\begin{matrix} a& b\\-b& a \end{matrix}\right)\right| a,b\in\mathbb{R} \right\} $ that are closed under multiplication and their cardinal is $ n. $ [i]Marcel Tena[/i]

Let $D$ be a point inside an acute triangle $ABC$ such that $\angle ADC = \angle A +\angle B$, $\angle BDA = \angle B + \angle C$ and $\angle CDB = \angle C + \angle A$. Prove that $\frac{AB \cdot CD}{AD} = \frac{AC \cdot CB} {AB}$.

For integer $n\geq 2$ and real $0\leq p\leq 1$, define $\mathcal{W}_{n,p}$ to be the complete weighted undirected random graph with vertex set $\{1,2,\ldots,n\}$: the edge $(i,j)$ will have weight $\min(i,j)$ with probability $p$ and weight $\max(i,j)$ otherwise. Let $\mathcal{L}_{n,p}$ denote the total weight of the minimum spanning tree of $\mathcal{W}_{n,p}$. Find the largest integer less than the expected value of $\mathcal{L}_{2018,1/2}$.

Let $ABC$ be an equilateral triangle with side length $8$, and let $D$, $E$, and $F$ be points on the sides $BC$, $CA$, and $AB$ respectively. Suppose that $BD = 2$ and $\angle ADE = \angle DEF = 60^\circ$. Calculate the length of segment $AF$.

The numbers $\frac 32$, $\frac 43$ and $\frac 65$ are intially written on the blackboard. A move consists of erasing one of the numbers from the blackboard, call it $a$, and replacing it with $bc-b-c+2$, where $b,c$ are the other two numbers currently written on the blackboard. Is it possible that $\frac{1000}{999}$ would eventually appear on the blackboard? What about $\frac{113}{108}$? [i] (Andrei Bâra)[/i]

Lets say that a positive integer is $good$ if its equal to the the subtraction of two positive integer cubes. For example: $7$ is a $good$ prime because $2^3-1^3=7$. Determine how much the last digit of a $good$ prime may be worth. Give all the possibilities.

[u]Round 9[/u] [b]p25.[/b] Let $S$ be the region bounded by the lines $y = x/2$, $y = -x/2$, and $x = 6$. Pick a random point $P = (x, y)$ in $S$ and translate it $3$ units right to $P' = (x + 3, y)$. What is the probability that $P'$ is in $S$? [b]p26.[/b] A triangle with side lengths $17$, $25$, and $28$ has a circle centered at each of its three vertices such that the three circles are mutually externally tangent to each other. What is the combined area of the circles? [b]p27.[/b] Find all ordered pairs $(x, y)$ of integers such that $x^2 - 2x + y^2 - 6y = -9$. [u]Round 10[/u] [b]p28.[/b] In how many ways can the letters in the word $SCHAFKOPF$ be arranged if the two $F$’s cannot be next to each other and the $A$ and the $O$ must be next to each other? [b]p29.[/b] Let a sequence $a_0, a_1, a_2, ...$ be defined by $a_0 = 20$, $a_1 = 11$, $a_2 = 0$, and for all integers $n \ge 3$, $$a_n + a_{n-1 }= a_{n-2} + a_{n-3}.$$ Find the sum $a_0 + a_1 + a_2 + · · · + a_{2010} + a_{2011}$. [b]p30.[/b] Find the sum of all positive integers b such that the base $b$ number $190_b$ is a perfect square. [u]Round 11[/u] [b]p31.[/b] Find all real values of x such that $\sqrt[3]{4x -1} + \sqrt[3]{4x + 1 }= \sqrt[3]{8x}$. [b]p32.[/b] Right triangle $ABC$ has a right angle at B. The angle bisector of $\angle ABC$ is drawn and extended to a point E such that $\angle ECA = \angle ACB$. Let $F$ be the foot of the perpendicular from $E$ to ray $\overrightarrow{BC}$. Given that $AB = 4$, $BC = 2$, and $EF = 8$, find the area of triangle $ACE$. [b]p33.[/b] You are the soul in the southwest corner of a four by four grid of distinct souls in the Fields of Asphodel. You move one square east and at the same time all the other souls move one square north, south, east, or west so that each square is now reoccupied and no two souls switched places directly. How many end results are possible from this move? [u]Round 12[/u] [b]p34.[/b] A [i]Pythagorean [/i] triple is an ordered triple of positive integers $(a, b, c)$ with $a < b < c $and $a^2 + b^2 = c^2$ . A [i]primitive [/i] Pythagorean triple is a Pythagorean triple where all three numbers are relatively prime to each other. Find the number of primitive Pythagorean triples in which all three members are less than $100,000$. If $P$ is the true answer and $A$ is your team’s answer to this problem, your score will be $max \left\{15 -\frac{|A -P|}{500} , 0 \right\}$ , rounded to the nearest integer. [b]p35.[/b] According to the Enable2k North American word list, how many words in the English language contain the letters $L, M, T$ in order but not necessarily together? If $A$ is your team’s answer to this problem and $W$ is the true answer, the score you will receive is $max \left\{15 -100\left| \frac{A}{W}-1\right| , 0 \right\}$, rounded to the nearest integer. [b]p36.[/b] Write down $5$ positive integers less than or equal to $42$. For each of the numbers written, if no other teams put down that number, your team gets $3$ points. Otherwise, you get $0$ points. Any number written that does not satisfy the given requirement automatically gets $0$ points. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2952214p26434209]here[/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3133709p28395558]here[/url]. Rest Rounds soon. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]a)[/b] Prove that for any two square matrices $ A,B $ of same order the equality $ \text{ord} (AB)=\text{ord} (BA) $ is true. [b]b)[/b] Show that $ \text{ord} (ab) =\text{ord} (ba) $ if $ a,b $ are elements of a monoid and one of them is an unit.

Given two natural numbers $ w$ and $ n,$ the tower of $ n$ $ w's$ is the natural number $ T_n(w)$ defined by \[ T_n(w) = w^{w^{\cdots^{w}}},\] with $ n$ $ w's$ on the right side. More precisely, $ T_1(w) = w$ and $ T_{n+1}(w) = w^{T_n(w)}.$ For example, $ T_3(2) = 2^{2^2} = 16,$ $ T_4(2) = 2^{16} = 65536,$ and $ T_2(3) = 3^3 = 27.$ Find the smallest tower of $ 3's$ that exceeds the tower of $ 1989$ $ 2's.$ In other words, find the smallest value of $ n$ such that $ T_n(3) > T_{1989}(2).$ Justify your answer.

Let $ABCD$ be a convex quadrilateral such that your diagonals $AC$ and $BD$ are perpendiculars. Let $P$ be the intersection of $AC$ and $BD$, let $M$ a midpoint of $AB$. Prove that the quadrilateral $ABCD$ is cyclic, if and only if, the lines $PM$ and $DC$ are perpendiculars.

For how many integers $a$ with $|a| \leq 2005$, does the system $x^2=y+a$ $y^2=x+a$ have integer solutions?

The sum of two natural numbers is $17,402.$ One of the two numbers is divisible by $10.$ If the units digit of that number is erased, the other number is obtained. What is the difference of these two numbers? $\textbf{(A) }10,272 \qquad \textbf{(B) }11,700 \qquad \textbf{(C) }13,362 \qquad \textbf{(D) }14,238 \qquad \textbf{(E) }15,426$

There are $k$ piles of stones with $2020$ stones in each pile. Amber can choose any two non-empty piles of stones, and Barbara can take one stone from one of the two chosen piles and puts it into the other pile. Amber wins if she can eventually make an empty pile. What is the least $k$ such that Amber can always win?

Find all natural numbers $n$, such that there exist relatively prime integers $x$ and $y$ and an integer $k > 1$ satisfying the equation $3^n =x^k + y^k$. [i]A. Kovaldji, V. Senderov[/i]

What is the largest number of regions into which a plane can be divided by drawing $n$ pairs of parallel lines?

Identical rectangular cardboard pieces are handed out to $30$ students, one to each. Each student cuts (parallel to the edges) his or her piece into equally large squares. Two different students’ squares do not necessarily have the same size. After all the cutting it turns out that the total number of squares is a prime. Prove that the original cardboard pieces must have been quadratic.

i) Given line segments $A,B,C,D$ with $A$ the longest, construct a quadrilateral with these sides and with $A$ and $B$ parallel, when possible. ii) Given any acute-angled triangle $ABC$ and one altitude $AH$, select any point $D$ on $AH$, then draw $BD$ and extend until it intersects $AC$ in $E$, and draw $CD$ and extend until it intersects $AB$ in $F$. Prove that $\angle AHE = \angle AHF$.

Function $f(x)$ is defined on $[0,1]$, $f(0)=f(1)$. For any $x_1,x_2\in [0,1], |f(x_1)-f(x_2)|<|x_1-x_2|(x_1\neq x_2)$. Prove that $|f(x_1)-f(x_2)|<\frac{1}{2}$.

Determine all functions $f$ from the set of non-negative integers to itself such that $f(a + b) = f(a) + f(b) + f(c) + f(d)$, whenever $a, b, c, d$, are non-negative integers satisfying $2ab = c^2 + d^2$.

Let $x_n$ the sequence defined by any nonnegatine integer $x_0$ and $x_{n+1}=1+\prod_{0 \leq i \leq n}{x_i}$ Show that there exists prime $p$ such that $p\not|x_n$ for any $n$.

In the nation of Onewaynia, certain pairs of cities are connected by roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges). Some roads have a traffic capacity of 1 unit and other roads have a traffic capacity of 2 units. However, on every road, traffic is only allowed to travel in one direction. It is known that for every city, the sum of the capacities of the roads connected to it is always odd. The transportation minister needs to assign a direction to every road. Prove that he can do it in such a way that for every city, the difference between the sum of the capacities of roads entering the city and the sum of the capacities of roads leaving the city is always exactly one. [i]Proposed by Zuming Feng and Yufei Zhao[/i]