On Binary Island, residents communicate using special paper. Each piece of paper is a $1 \times n$ row of initially uncolored squares. To send a message, each square on the paper must either be colored either red or green. Unfortunately the paper on the island has become damaged, and each sheet of paper has $10$ random consecutive squares each of which is randomly colored red or green. Malmer and Weven would like to develop a scheme that allows them to send messages of length $2016$ between one another. They would like to be able to send any message of length $2016$, and they want their scheme to work with perfect accuracy. What is the smallest value of $n$ for which they can develop such a strategy? [i]Note that when sending a message, one can see which 10 squares are colored and what colors they are. One also knows on which square the message begins, and on which square the message ends.[/i]

The cells of an $n \times n$ table are filled with the numbers $1,2,\dots,n$ for the first row, $n+1,n+2,\dots,2n$ for the second, and so on until $n^2-n,n^2-n+1,\dots,n^2$ for the $n$-th row. Peter picks $n$ numbers from this table such that no two of them lie on the same row or column. Peter then calculates the sum $S$ of the numbers he has chosen. Prove that Peter always gets the same number for $S$, no matter how he chooses his $n$ numbers.

A group of $4046$ friends will play a videogame tournament. For that, $2023$ of them will go to one room which the computers are labeled with $a_1,a_2,\dots,a_{2023}$ and the other $2023$ friends go to another room which the computers are labeled with $b_1,b_2,\dots,b_{2023}$. The player of computer $a_i$ [b]always[/b] challenges the players of computer $b_i,b_{i+2},b_{i+3},b_{i+4}$(the player doesn't challenge $b_{i+1}$). After the first round, inside both rooms, the players may switch the computers. After the reordering, all the players realize that they are challenging the same players of the first round. Prove that if [b]one[/b] player has [b]not[/b] switched his computer, then all the players have not switched their computers.

Two players play a game on four piles of pebbles labeled with the numbers $1,2,3,4$ respectively. The players take turns in an alternating fashion. On his or her turn, a player selects integers $m$ and $n$ with $1\leq m<n\leq 4$, removes $m$ pebbles from pile $n$, and places one pebble in each of the piles $n-1,n-2,\dots,n-m$. A player loses the game if he or she cannot make a legal move. For each starting position, determine the player with a winning strategy.

Solve for real $x,y$: $x+y=2$ $x^5+y^5=82$

The function $f: N \to N_0$ is such that $f (2) = 0, f (3)> 0, f (6042) = 2014$ and $f (m + n)- f (m) - f (n) \in\{0,1\}$ for all $m,n \in N$. Determine $f (2014)$. $N_0=\{0,1,2,...\}$

The excircle of a triangle $ABC$ corresponding to $A$ touches the side $BC$ at $K$ and the rays $AB$ and $AC$ at $P$ and $Q$, respectively. The lines $OB$ and $OC$ intersect $PQ$ at $M$ and $N$, respectively. Prove that $$\frac{QN}{AB}=\frac{NM}{BC}=\frac{MP}{CA}.$$

Let $ABCD$ be a trapezium in which $AB$ is parallel to $CD$. The circles on $AD$ and $BC$ as diameters intersect at two distinct points $P$ and $Q$. Prove that the lines $PQ,AC,BD$ are concurrent.

For Kelvin the Frog's birthday, Alex the Kat gives him one brick weighing $x$ pounds, two bricks weighing $y$ pounds, and three bricks weighing $z$ pounds, where $x,y,z$ are positive integers of Kelvin the Frog's choice. Kelvin the Frog has a balance scale. By placing some combination of bricks on the scale (possibly on both sides), he wants to be able to balance any item of weight $1,2,\ldots,N$ pounds. What is the largest $N$ for which Kelvin the Frog can succeed?

I have two cents and Bill has $n$ cents. Bill wants to buy some pencils, which come in two different packages. One package of pencils costs 6 cents for 7 pencils, and the other package of pencils costs a [i]dime for a dozen[/i] pencils (i.e. 10 cents for 12 pencils). Bill notes that he can spend [b]all[/b] $n$ of his cents on some combination of pencil packages to get $P$ pencils. However, if I [i]give my two cents[/i] to Bill, he then notes that he can instead spend [b]all[/b] $n+2$ of his cents on some combination of pencil packages to get fewer than $P$ pencils. What is the smallest value of $n$ for which this is possible? Note: Both times Bill must spend [b]all[/b] of his cents on pencil packages, i.e. have zero cents after either purchase.

Suppose $a$ real number so that there is a non-constant polynomial $P (x)$ such that $\frac{P(x+1)-P(x)}{P(x+\pi)}= \frac{a}{x+\pi}$ for each real number $x$, with $x+\pi \ne 0$ and $P(x+\pi)\ne 0$. Show that $a$ is a natural number.

In the adjoining figure, $AB$ is a diameter of the circle, $CD$ is a chord parallel to $AB$, and $AC$ intersects $BD$ at $E$, with $\angle AED = \alpha$. The ratio of the area of $\triangle CDE$ to that of $\triangle ABE$ is [asy] size(200); defaultpen(fontsize(10pt)+linewidth(.8pt)); pair A=(-1,0), B=(1,0), E=(0,-.4), C=(.6,-.8), D=(-.6,-.8), E=(0,-.8/(1.6)); draw(unitcircle); draw(A--B--D--C--A); draw(Arc(E,.2,155,205)); label("$A$",A,W); label("$B$",B,C); label("$C$",C,C); label("$D$",D,W); label("$\alpha$",E-(.2,0),W); label("$E$",E,N);[/asy] $ \textbf{(A)}\ \cos\ \alpha\qquad\textbf{(B)}\ \sin\ \alpha\qquad\textbf{(C)}\ \cos^2\alpha\qquad\textbf{(D)}\ \sin^2\alpha\qquad\textbf{(E)}\ 1 - \sin\ \alpha $

For any real number $p\geq1$ consider the set of all real numbers $x$ with \[p<x<\left(2+\sqrt{p+\frac{1}{4}}\right)^2.\] Prove that from any such set one can select four mutually distinct natural numbers $a, b, c, d$ with $ab=cd.$

What is the greatest number of positive integers lesser than or equal to 2016 we can choose such that it doesn't have two of them differing by 1,2, or 6?

Let $p, k$ and $x$ be positive integers such that $p \geq k$ and $x < \left[ \frac{p(p-k+1)}{2(k-1)} \right]$, where $[q]$ is the largest integer no larger than $q$. Prove that when $x$ balls are put into $p$ boxes arbitrarily, there exist $k$ boxes with the same number of balls.

Let $ n$ be the smallest positive integer such that $ n$ is divisible by $ 20$, $ n^2$ is a perfect cube, and $ n^3$ is a perfect square. What is the number of digits of $ n$? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$

$f(x) = x^3-ax+1$ , $a \in R$ has three different zeros in $R$. Prove that for the zero $x_o$ with the smallest absolute value holds: $\frac{1}{a}< x_0 < \frac{2}{a}$

Let $ABC$ be a triangle with $AB=3, BC=4, CA=5$. Let $M$ be the midpoint of $BC$, and $\Gamma$ be a circle through $A$ and $M$ that intersects $AB$ and $AC$ again at $D$ and $E$, respectively. Given that $AD=AE$, find the area of quadrilateral $MEAD$. [i]Individual #9[/i]

Triangle $\vartriangle ABC$ has side lengths $AB = 5$, $BC = 8$, and $CA = 7$. Let the perpendicular bisector of $BC$ intersect the circumcircle of $\vartriangle ABC$ at point $D$ on minor arc $BC$ and point $E$ on minor arc $AC$, and $AC$ at point $F$. The line parallel to $BC$ passing through $F$ intersects $AD$ at point $G$ and $CE$ at point $H$. Compute $\frac{[CHF]}{[DGF]}$ . (Given a triangle $\vartriangle ABC$, $[ABC]$ denotes its area.)

Does there exist an integer such that its cube is equal to $3n^2 + 3n + 7,$ where $n$ is an integer.

Consider $\vartriangle ABC$ and a point $S$ inside it. Let $A_1, B_1, C_1$ be the intersection points of $AS, BS, CS$ with $BC, AC, AB$, respectively. Prove that at least in one of the resulting quadrilaterals $AB_1SC_1, C_1SA_1B, A_1SB_1C$ both angles at either $C_1$ and $B_1$, or $C_1$ and $A_1$, or $A_1$ and $B_1$ are not acute.

If the sum of digits of only $m$ and $m+n$ from the numbers $m$, $m+1$, $\cdots$, $m+n$ are divisible by $8$ where $m$ and $n$ are positive integers, what is the largest possible value of $n$? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ \text{None of the preceding} $

A box contains 11 balls, numbered 1,2,3,....,11. If 6 balls are drawn simultaneously at random, what is the probability that the sum of the numbers on the balls drawn is odd? A. $\frac{100}{231}$ B. $\frac{115}{231}$ C. $\frac{1}{2}$ D. $\frac{118}{231}$ E. $\frac{6}{11}$

Let $C_1,C_2$ be two circles such that the center of $C_1$ is on the circumference of $C_2$. Let $C_1,C_2$ intersect each other at points $M,N$. Let $A,B$ be two points on the circumference of $C_1$ such that $AB$ is the diameter of it. Let lines $AM,BN$ meet $C_2$ for the second time at $A',B'$, respectively. Prove that $A'B'=r_1$ where $r_1$ is the radius of $C_1$.

Let $P(x)$ be the unique polynomial of degree four for which $P(165) = 20$, and \[ P(42) = P(69) = P(96) = P(123) = 13. \] Compute $P(1) - P(2) + P(3) - P(4) + \dots + P(165)$. [i]Proposed by Evan Chen[/i]