A total of $2010$ coins are distributed in $5$ boxes. At the beginning the quantities of coins in the boxes are consecutive natural numbers. Martha should choose and take one of the boxes, but before that she can do the following transformation finitely many times: from a box with at least 4 coins she can transfer one coin to each of the other boxes. What is the maximum number of coins that Martha can take away?

With positive $ a,b,c, $ prove: $$ \frac{a}{8a^2+5b^2+3c^2} +\frac{b}{8b^2+5c^2+3a^2} +\frac{c}{8c^2+5a^2+3b^2}\le\frac{1}{16}\left( \frac{1}{a} +\frac{1}{b} +\frac{1}{c} \right) $$ [i]Titu Zvonaru[/i]

Prove that for any positive integer $n\geq 2$ we have that \[\sum_{k=2}^n \lfloor \sqrt[k]{n}\rfloor=\sum_{k=2}^n\lfloor\log_{k}n\rfloor.\]

In the cells of an $8\times 8$ board, marbles are placed one by one. Initially there are no marbles on the board. A marble could be placed in a free cell neighboring (by side) with at least three cells which are still free. Find the greatest possible number of marbles that could be placed on the board according to these rules.

Let $a\leqslant b\leqslant c$ be non-negative integers. A triangle on a checkered plane with vertices in the nodes of the grid is called an $(a,b,c)$[i]-triangle[/i] if there are exactly $a{}$ nodes on one side of it (not counting vertices), exactly $b{}$ nodes on the second side, and exactly $c{}$ nodes on the third side. [list] [*]Does there exist a $(9,10,11)$-triangle? [*]Find all triples of non-negative integers $a\leqslant b\leqslant c$ for which there exists an $(a,b,c)$-triangle. [*]For each such triple, find the minimum possible area of the $(a,b,c)$-triangle. [/list] [i]Proposed by P. Kozhevnikov[/i]

If the interior angles of a triangle $ABC$ satisfy the equality, $$\sin ^2 A + \sin ^2 B + \sin^2 C = 2 \left( \cos ^2 A + \cos ^2 B + \cos ^2 C \right),$$ prove that the triangle must have a right angle.

Let $x_1, x_2, x_3$ be the solutions to $(x - 13)(x - 33)(x - 37) = 1337$. Find the value of $$\sum_{i=1}^3 \left[(x_i - 13)^3 + (x_i - 33)^3 + (x_i - 37)^3\right].$$

Let $ABC$ be an acute non isosceles triangle. The angle bisector of angle $A$ meets again the circumcircle of the triangle $ABC$ in $D$. Let $O$ be the circumcenter of the triangle $ABC$. The angle bisectors of $\angle AOB$, and $\angle AOC$ meet the circle $\gamma$ of diameter $AD$ in $P$ and $Q$ respectively. The line $PQ$ meets the perpendicular bisector of $AD$ in $R$. Prove that $AR // BC$.

Let $D$ be the foot of the altitude towards $BC$ in the triangle $ABC$. Let $E$ be the intersection of $AB$ with the bisector of angle $\angle C$. Assume that the angle $\angle AEC = 45^o$ . Determine the angle $\angle EDB$.

Given triangle $ABC$ and point $D$ on the $AC$ side. Let $r_1, r_2$ and $r$ denote the radii of the incircle of the triangles $ABD, BCD$, and $ABC$, respectively. Prove that $r_1 + r_2> r$.

Let $ABC$ be a triangle with circumcircle $\omega$ and circumcenter $O.$ Suppose that $AB = 15$, $AC = 14$, and $P$ is a point in the interior of $\triangle ABC$ such that $AP = \frac{13}{2}$, $BP^2 = \frac{409}{4}$, and $P$ is closer to $\overline{AC}$ than to $\overline{AB}$. Let $E$, $F$ be the points where $\overline{BP}$, $\overline{CP}$ intersect $\omega$ again, and let $Q$ be the intersection of $\overline{EF}$ with the tangent to $\omega$ at $A.$ Given that $AQOP$ is cyclic and that $CP^2$ is expressible in the form $\frac{a}{b} - c \sqrt{d}$ for positive integers $a$, $b$, $c$, $d$ such that $\gcd(a, b) = 1$ and $d$ is not divisible by the square of any prime, compute $1000a+100b+10c+d.$ [i]Proposed by Edward Wan[/i]

The solutions to the equation $(z+6)^8=81$ are connected in the complex plane to form a convex regular polygon, three of whose vertices are labeled $A,B,$ and $C$. What is the least possible area of $\triangle ABC?$ $\textbf{(A) } \frac{1}{6}\sqrt{6} \qquad \textbf{(B) } \frac{3}{2}\sqrt{2}-\frac{3}{2} \qquad \textbf{(C) } 2\sqrt3-3\sqrt2 \qquad \textbf{(D) } \frac{1}{2}\sqrt{2} \qquad \textbf{(E) } \sqrt 3-1$

In a circle, let $AB$ and $BC$ be chords , with $AB =\sqrt3, BC =3\sqrt3, \angle ABC =60^o$. Find the length of the circle chord that divides angle $ \angle ABC$ in half.

Given a circle and Points $P,B,A$ on it.Point $Q$ is Interior of this circle such that: $1)$ $\angle PAQ=90$. $ 2)PQ=BQ$. Prove that $\angle AQB - \angle PQA=\stackrel{\frown}{AB}$. proposed by Davoud Vakili, Iran.

Find all $ n > 1$ such that the inequality \[ \sum_{i\equal{}1}^nx_i^2\ge x_n\sum_{i\equal{}1}^{n\minus{}1}x_i\] holds for all real numbers $ x_1$, $ x_2$, $ \ldots$, $ x_n$.

Let $P_0(x) = x^3 + 313x^2 - 77x - 8$. For integers $n \ge 1$, define $P_n(x) = P_{n - 1}(x - n)$. What is the coefficient of $x$ in $P_{20}(x)$?

Let $ ABC $ be a right angle in $ A, $ and $ M $ be the mid of $ BC. $ On the perpendicular of $ AM $ through $ A $ choose a point $ D $ so that $ DM $ meets $ AB $ at a point, namely $ P. $ Let $ E $ be the projection of $ D $ on $ BC. $ Show that $ \angle BPM =\angle EAC. $

Find the greatest exponent $k$ for which $2001^{k}$ divides $2000^{2001^{2002}}+2002^{2001^{2000}}$.

Circles $w_1$ and $w_2$ with centers at points $O_1$ and $O_2$ respectively, intersect at points $A$ and $B$. A line passing through point $B$, intersects the circles $w_1$ and $w_2$ at points $C$ and $D$ other than $B$. Tangents to the circles $w_1$ and $w_2$ at points $C$ and $D$ intersect at point $E$. Line $EA$ intersects the circumscribed circle $w$ of triangle $AO_1O_2$ at point $F$. Prove that the length of the segment is $EF$ is equal to the diameter of the circle $w$. (Vovchenko V., Plotnikov M.)

Prove: From the set $\{1,2,...,n\}$, one can choose a subset with at most $2 \left\lfloor \sqrt n \right\rfloor +1$ elements such that the set of the pairwise differences from this subset is $\{1,2,...,n-1\}$. ($\left\lfloor x \right\rfloor$ means the greatest integer $\leq x$)

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

Find the angles of the pentagon $ABCDE$ in the figure below.

Find all polynomials $P_n(x)$ of the form $$P_n(x)=n!x^n+a_{n-1}x^{n-1}+\ldots+a_1x+(-1)^nn(n+1),$$with integer coefficients, such that its roots $x_1,x_2,\ldots,x_n$ satisfy $k\le x_k\le k+1$ for $k=1,2,\ldots,n$.

[u]Round 1[/u] [b]p1.[/b] Six pirates – Captain Jack and his five crewmen – sit in a circle to split a treasure of $99$ gold coins. Jack must decide how many coins to take for himself and how many to give each crewman (not necessarily the same number to each). The five crewmen will then vote on Jack's decision. Each is greedy and will vote “aye” only if he gets more coins than each of his two neighbors. If a majority vote “aye”, Jack's decision is accepted. Otherwise Jack is thrown overboard and gets nothing. What is the most coins Captain Jack can take for himself and survive? [b]p2[/b]. Rose and Bella take turns painting cells red and blue on an infinite piece of graph paper. On Rose's turn, she picks any blank cell and paints it red. Bella, on her turn, picks any blank cell and paints it blue. Bella wins if the paper has four blue cells arranged as corners of a square of any size with sides parallel to the grid lines. Rose goes first. Show that she cannot prevent Bella from winning. [img]https://cdn.artofproblemsolving.com/attachments/d/6/722eaebed21a01fe43bdd0dedd56ab3faef1b5.png[/img] [b]p3.[/b] A $25\times 25$ checkerboard is cut along the gridlines into some number of smaller square boards. Show that the total length of the cuts is divisible by $4$. For example, the cuts shown on the picture have total length $16$, which is divisible by $4$. [img]https://cdn.artofproblemsolving.com/attachments/c/1/e152130e48b804fe9db807ef4f5cd2cbad4947.png[/img] [b]p4.[/b] Each robot in the Martian Army is equipped with a battery that lasts some number of hours. For any two robots, one's battery lasts at least three times as long as the other's. A robot works until its battery is depleted, then recharges its battery until it is full, then goes back to work, and so on. A battery that lasts $N$ hours takes exactly $N$ hours to recharge. Prove that there will be a moment in time when all the robots are recharging (so you can invade the planet). [b]p5.[/b] A casino machine accepts tokens of $32$ different colors, one at a time. For each color, the player can choose between two fixed rewards. Each reward is up to $\$10$ cash, plus maybe another token. For example, a blue token always gives the player a choice of getting either $\$5$ plus a red token or $\$3$ plus a yellow token; a black token can always be exchanged either for $\$10$ (but no token) or for a brown token (but no cash). A player may keep playing as long as he has a token. Rob and Bob each have one white token. Rob watches Bob play and win $\$500$. Prove that Rob can win at least $\$1000$. [img]https://cdn.artofproblemsolving.com/attachments/6/6/e55614bae92233c9b2e7d66f5f425a18e6475a.png [/img] [u]Round 2[/u] [b]p6.[/b] The sum of $2015$ rational numbers is an integer. The product of every pair of them is also an integer. Prove that they are all integers. (A rational number is one that can be written as $m/n$, where $m$ and $n$ are integers and $n\ne 0$.) [b]p7.[/b] An $N \times N$ table is filled with integers such that numbers in cells that share a side differ by at most $1$. Prove that there is some number that appears in the table at least $N$ times. For example, in the $5 \times 5$ table below the numbers $1$ and $2$ appear at least $5$ times. [img]https://cdn.artofproblemsolving.com/attachments/3/8/fda513bcfbe6834d88fb8ca0bfcdb504d8b859.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Ann and Drew have purchased a mysterious slot machine; each time it is spun, it chooses a random positive integer such that $k$ is chosen with probability $2^{-k}$ for every positive integer $k$, and then it outputs $k$ tokens. Let $N$ be a fixed integer. Ann and Drew alternate turns spinning the machine, with Ann going first. Ann wins if she receives at least $N$ total tokens from the slot machine before Drew receives at least $M=2^{2018}$ total tokens, and Drew wins if he receives $M$ tokens before Ann receives $N$ tokens. If each person has the same probability of winning, compute the remainder when $N$ is divided by $2018$. [i]Proposed by Brandon Wang[/i]