Initially, Igna distributes $1000$ balls into $30$ boxes. Then, Igna and Mica alternate turns, starting with Igna. Each player, on their turn, chooses a box and removes one ball. When a player removes the last ball from a box, they earn a coin. Find the maximum integer $k$ such that, regardless of how Mica plays, Igna can earn at least $k$ coins.

Let the sequence $\{K_{n}\}_{n \ge 1}$ be defined by \[K_{1}=2, K_{2}=8, K_{n+2}=3K_{n+1}-K_{n}+5(-1)^{n}.\] Prove that if $K_{n}$ is prime, then $n$ must be a power of $3$.

Let $\gamma_A, \gamma_B, \gamma_C$ be excircles of triangle $ABC$, touching the sides $BC$, $CA$, $AB$ respectively. Let $l_A$ denote the common external tangent to $\gamma_B$ and $\gamma_C$ distinct from $BC$. Define $l_B, l_C$ similarly. The tangent from a point $P$ of $l_A$ to $\gamma_B$ distinct from $l_A$ meets $l_C$ at point $X$. Similarly the tangent from $P$ to $\gamma_C$ meets $l_B$ at $Y$. Prove that $XY$ touches $\gamma_A$.

For any positive integer $n$, we denote by $F(n)$ the number of ways in which $n$ can be expressed as the sum of three different positive integers, without regard to order. Thus, since $10 = 7+2+1 = 6+3+1 = 5+4+1 = 5+3+2$, we have $F(10) = 4$. Show that $F(n)$ is even if $n \equiv 2$ or $4 \pmod 6$, but odd if $n$ is divisible by $6$.

Given a triangle $ ABC$. The angle bisectors of the angles $ ABC$ and $ BCA$ intersect the sides $ CA$ and $ AB$ at the points $ B_1$ and $ C_1$, and intersect each other at the point $ I$. The line $ B_1C_1$ intersects the circumcircle of triangle $ ABC$ at the points $ M$ and $ N$. Prove that the circumradius of triangle $ MIN$ is twice as long as the circumradius of triangle $ ABC$.

The following facts are known in a mathematical contest: [list] (a) The number of problems tested was $n\ge 4$ (b) Each problem was solved by exactly four contestants. (c) For each pair of problems, there is exactly one contestant who solved both problems [/list] Assuming the number of contestants is greater than or equal to $4n$, find the minimum value of $n$ for which there always exists a contestant who solved all the problems.

Given $ n \geq 3$, $ n$ is a integer. Prove that: \[ (2^n \minus{} 2) \cdot \sqrt{2i\minus{}1} \geq \left( \sum_{j\equal{}0}^{i\minus{}1}C_n^j \plus{} C_{n\minus{}1}^{i\minus{}1} \right) \cdot \sqrt{n}\] where if $ n$ is even, then $ \displaystyle 1 \leq i \leq \frac{n}{2}$; if $ n$ is odd, then $ \displaystyle 1 \leq i \leq \frac{n\minus{}1}{2}$.

Is it possible to color the cells of a table 19 x 19 in yellow, blue, red, and green so that each rectangle $a$ x $b$ ($a,b\geq 2$) in the table has at least 2 cells in different color?

Given an integer $n\geq 2,$ let $a_{n},b_{n},c_{n}$ be integer numbers such that \[ \left( \sqrt[3]{2}-1\right) ^{n}=a_{n}+b_{n}\sqrt[3]{2}+c_{n}\sqrt[3]{4}. \] Prove that $c_{n}\equiv 1\pmod{3} $ if and only if $n\equiv 2\pmod{3}.$

For three points $A,B,C$ in the plane, we define $m(ABC)$ to be the smallest length of the three heights of the triangle $ABC$, where in the case $A$, $B$, $C$ are collinear, we set $m(ABC) = 0$. Let $A$, $B$, $C$ be given points in the plane. Prove that for any point $X$ in the plane, \[ m(ABC) \leq m(ABX) + m(AXC) + m(XBC). \]

Let $n,k$ be positive integers such that n is not divisible by 3 and $k \geq n$. Prove that there exists a positive integer $m$ which is divisible by $n$ and the sum of its digits in decimal representation is $k$.

A square matrix is sum-magic if the sum of all elements in each row, column and major diagonal is constant. Similarly, a square matrix is product-magic if the product of all elements in each row, column and major diagonal is constant. Determine if there exist $3\times 3$ matrices of real numbers which are both sum-magic and product-magic.

In acute triangle $ABC$, $D,E$ are two points on side $BC$, satisfying that $\angle BAE=\angle CAF$. $FM\perp AB,EN\perp AC$ ($M,N$ are foot points). $AE$ intersects the circumcircle of $\triangle ABC$ at $D$. Prove that the area of $\triangle ABC$ and quadrilateral $AMDN$ are equal.

An (unordered) partition $P$ of a positive integer $n$ is an $n$-tuple of nonnegative integers $P=(x_1,x_2,\cdots,x_n)$ such that $\sum_{k=1}^n kx_k=n$. For positive integer $m\leq n$, and a partition $Q=(y_1,y_2,\cdots,y_m)$ of $m$, $Q$ is called compatible to $P$ if $y_i\leq x_i$ for $i=1,2,\cdots,m$. Let $S(n)$ be the number of partitions $P$ of $n$ such that for each odd $m<n$, $m$ has exactly one partition compatible to $P$ and for each even $m<n$, $m$ has exactly two partitions compatible to $P$. Find $S(2010)$.

Kevin is running $1000$ meters. He wants to have an average speed of $10$ meters a second. He runs the first $100$ meters at a speed of $4$ meters a second. Compute how quickly, in meters per second, he must run the last $900$ meters to attain his desired average speed of $10$ meters a second.

Given an integer $n\geq 2,$ colour red exactly $n$ cells of an infinite sheet of grid paper. A rectangular grid array is called special if it contains at least two red opposite corner cells; single red cells and 1-row or 1-column grid arrays whose end-cells are both red are special. Given a configuration of exactly $n$ red cells, let $N$ be the largest number of red cells a special rectangular grid array may contain. Determine the least value $N$ may take over all possible configurations of exactly $n$ red cells

The following bar graph represents the length (in letters) of the names of 19 people. What is the median length of these names? $\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad \textbf{(E) }7$ [asy] unitsize(0.9cm); draw((-0.5,0)--(10,0), linewidth(1.5)); draw((-0.5,1)--(10,1)); draw((-0.5,2)--(10,2)); draw((-0.5,3)--(10,3)); draw((-0.5,4)--(10,4)); draw((-0.5,5)--(10,5)); draw((-0.5,6)--(10,6)); draw((-0.5,7)--(10,7)); label("frequency",(-0.5,8)); label("0", (-1, 0)); label("1", (-1, 1)); label("2", (-1, 2)); label("3", (-1, 3)); label("4", (-1, 4)); label("5", (-1, 5)); label("6", (-1, 6)); label("7", (-1, 7)); filldraw((0,0)--(0,7)--(1,7)--(1,0)--cycle, black); filldraw((2,0)--(2,3)--(3,3)--(3,0)--cycle, black); filldraw((4,0)--(4,1)--(5,1)--(5,0)--cycle, black); filldraw((6,0)--(6,4)--(7,4)--(7,0)--cycle, black); filldraw((8,0)--(8,4)--(9,4)--(9,0)--cycle, black); label("3", (0.5, -0.5)); label("4", (2.5, -0.5)); label("5", (4.5, -0.5)); label("6", (6.5, -0.5)); label("7", (8.5, -0.5)); label("name length", (4.5,-1.5)); [/asy]

''Moskvich'' and ''Zaporozhets'' drove past the observer on the highway and the Niva moving towards them. It is known that when the Moskvich caught up with the observer, it was equidistant from the Zaporozhets and the Niva, and when the Niva caught up with the observer, it was equal. but removed from ''Moskvich'' and ''Zaporozhets''. Prove that ''Zaporozhets'' at the moment of passing by the observer was equidistant from the Niva and ''Moskvich''.

Let $ABC$ be a triangle, $X$ the midpoint of arc $BC$ on the circumcircle. The tangents from $X$ to the incircle meet the circumcircle again at $X_1,X_2$, and $X_1X_2$ intersects the incircle at $P,Q$. Let $M$ be the midpoint of $PQ$, and let $A_1$ be the tangency point of the $A$-mixtillinear incircle with the circumcircle. Show that $A,M,A_1$ are collinear.

In a graph with $2n-1$ vertices throwing out any vertex the remaining graph has a complete subgraph with $n$ vertices. Prove that the initial graph has a complete subgraph with $n+1$ vertices.

Assume $f:\mathbb N_0\to\mathbb N_0$ is a function such that $f(1)>0$ and, for any nonnegative integers $m$ and $n$, $$f\left(m^2+n^2\right)=f(m)^2+f(n)^2.$$(a) Calculate $f(k)$ for $0\le k\le12$. (b) Calculate $f(n)$ for any natural number $n$.

Define $\left\lVert A-B \right\rVert = (x_A-x_B)^2+(y_A-y_B)^2$ for every two points $A = (x_A, y_A)$ and $B = (x_B, y_B)$ in the plane. Let $S$ be the set of points $(x,y)$ in the plane for which $x,y \in \left\{ 0,1,\dots,100 \right\}$. Find the number of functions $f : S \to S$ such that $\left\lVert A-B \right\rVert \equiv \left\lVert f(A)-f(B) \right\rVert \pmod{101}$ for any $A, B \in S$. [i] Proposed by Victor Wang [/i]

Inside a circle, point $K$ is taken such that the ray drawn from $K$ through the centre $O$ of the circle and the chord perpendicular to this ray passing through $K$ divide the circle into three pieces with equal area. Let $L$ be one of the endpoints of the chord mentioned. Does the inequality $\angle KOL < 75^o$ hold?

Let $S$ be the center of a square $ABCD$ and $P$ be the midpoint of $AB$. The lines $AC$ and $PD$ meet at $M$, and the lines $BD$ and $PC$ meet at $N$. Prove that the radius of the incircle of the quadrilateral $PMSN$ equals $MP-MS$.

How many ordered pairs $(a, b)$ of positive integers with $1 \le a, b \le 10$ are there such that in the geometric sequence whose first term is $a$ and whose second term is $b$, the third term is an integer?