For real $\theta_i$, $i = 1, 2, \dots, 2011$, where $\theta_1 = \theta_{2012}$, find the maximum value of the expression \[ \sum_{i=1}^{2011} \sin^{2012} \theta_i \cos^{2012} \theta_{i+1}. \] [i]Proposed by Lewis Chen [/i]

Let $x,y\in\mathbb{R}$ be such that $x = y(3-y)^2$ and $y = x(3-x)^2$. Find all possible values of $x+y$.

A polygon is called concave if it has at least one angle strictly greater than $180^{\circ}$. What is the maximum number of symmetries that an 11-sided concave polygon can have? (A [i]symmetry[/i] of a polygon is a way to rotate or reflect the plane that leaves the polygon unchanged.)

On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue. At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet. After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls. Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?

An investigator works out that he needs to ask at most $91$ questions on the basis that all the answers will be yes or no and all will be true. The questions may depend upon the earlier answers. Show that he can make do with $105$ questions if at most one answer could be a lie.

Given an $ a \times b$ rectangle with $ a > b > 0,$ determine the minimum side of a square that covers the rectangle. (A square covers the rectangle if each point in the rectangle lies inside the square.)

A cube is decomposed in a finite number of rectangular parallelepipeds such that the volume of the cube's circum sphere volume equals the sum of the volumes of all parallelepipeds' circum spheres. Prove that all these parallelepipeds are cubes.

Let $a, b, c$ be positive real numbers. Prove that $$\frac{a(b^2 + c^2)}{(b + c)(a^2 + bc)} + \frac{b(c^2 + a^2)}{(c + a)(b^2 + ca)} + \frac{c(a^2 + b^2)}{(a + b)(c^2 + ab)} \ge \frac32$$

We have a calculator with two buttons that displays and integer $x$. Pressing the first button replaces $x$ by $\lfloor \frac{x}{2} \rfloor$, and pressing the second button replaces $x$ by $4x+1$. Initially, the calculator displays $0$. How many integers less than or equal to $2014$ can be achieved through a sequence of arbitrary button presses? (It is permitted for the number displayed to exceed 2014 during the sequence. Here, $\lfloor y \rfloor$ denotes the greatest integer less than or equal to the real number $y$).

Prove that the number $A=\frac{(4n)!}{(2n)!n!}$ is an integer and divisible by $2^{n+1}$, where $n$ is a positive integer.

A triangle whose all sides have lengths greater than $1$ is contained in a unit square. Show that the center of the square lies inside the triangle.

One of the external common tangent lines of the two externally tangent circles with center $O_1$ and $O_2$ touches the circles at $B$ and $C$, respectively. Let $A$ be the common point of the circles. The line $BA$ meets the circle with center $O_2$ at $A$ and $D$. If $|BA|=5$ and $|AD|=4$, then what is $|CD|$? $ \textbf{(A)}\ \sqrt{20} \qquad\textbf{(B)}\ \sqrt{27} \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ \frac{15}2 \qquad\textbf{(E)}\ 4\sqrt5 $

Find integral solutions to the equation \[(m^{2}-n^{2})^{2}=16n+1.\]

There's a special computer and it has a memory. At first, it's memory just contains $x$. We fill up the memory with the following rules. 1) If $f\neq 0$ is in the memory, then we can also put $\frac{1}{f}$ in it. 2) If $f,g$ are in the memory, then we can also put $ f+g$ and $f-g$ in it. Find all natural number $n$ such that we can have $x^n$ in the memory.

There are $n$ cities on each side of Hung river, with two-way ferry routes between some pairs of cities across the river. A city is “convenient” if and only if the city has ferry routes to all cities on the other side. The river is “clear” if we can find $n$ different routes so that the end points of all these routes include all $2n$ cities. It is known that Hung river is currently unclear, but if we add any new route, then the river becomes clear. Determine all possible values for the number of convenient cities. [i] Proposed by usjl[/i]

Let $ABCD$ be a parallelogram whose diagonals intersect in $M$. Suppose that the circumcircle of $ABM$ intersects the segment $AD$ in a point $E \ne A$ and that the circumcircle of $EMD$ intersects the segment $BE$ in a point $F \ne E$. Show that $\angle ACB=\angle DCF$.

Let $A$ be a set contains $2000$ distinct integers and $B$ be a set contains $2016$ distinct integers. $K$ is the numbers of pairs $(m,n)$ satisfying \[ \begin{cases} m\in A, n\in B\\ |m-n|\leq 1000 \end{cases} \] Find the maximum value of $K$

If $ ABCDEFG$ is a regular $ 7$-gon with side $ 1$, show that: $ \frac{1}{AC}\plus{}\frac{1}{AD}\equal{}1$.

Let $k>1$ be the given natural number and $p\in \mathbb{P}$ such that $n=kp+1$ is composite number. Given that $n\mid 2^{n-1}-1.$ Prove that $n<2^k.$

For each integer $1\le j\le 2017$, let $S_j$ denote the set of integers $0\le i\le 2^{2017} - 1$ such that $\left\lfloor \frac{i}{2^{j-1}} \right\rfloor$ is an odd integer. Let $P$ be a polynomial such that \[P\left(x_0, x_1, \ldots, x_{2^{2017} - 1}\right) = \prod_{1\le j\le 2017} \left(1 - \prod_{i\in S_j} x_i\right).\] Compute the remainder when \[ \sum_{\left(x_0, \ldots, x_{2^{2017} - 1}\right)\in\{0, 1\}^{2^{2017}}} P\left(x_0, \ldots, x_{2^{2017} - 1}\right)\] is divided by $2017$. [i]Proposed by Ashwin Sah[/i]

Calculate the given expression $$\sum_{k=0}^{n} \frac{2^k}{3^{2^k}+1}$$

Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions: (i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$; (ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$. Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list] [i]Proposed by Hans Zantema, Netherlands[/i]

During a game of chess, at a certain point, in each row and column of the board there is an odd number of pieces. Prove that the number of pieces that are on black squares is even. (Note: a chessboard has $8$ rows and $8$ columns)

A spider has one sock and one shoe for each of its eight legs. In how many different orders can the spider put on its socks and shoes, assuming that, on each leg, the sock must be put on before the shoe? $ \textbf{(A)} \ 8! \qquad \textbf{(B)} \ 2^8 \cdot 8! \qquad \textbf{(C)} \ (8!)^2 \qquad \textbf{(D)} \ \frac {16!}{2^8} \qquad \textbf{(E)} \ 16!$

Let $f(n)$ be defined on the positive integers and satisfy: $f(prime) = 1$, $f(ab) = a f(b) + f(a) b$. Show that $f$ is unique and find all $n$ such that $n = f(n)$.