For each non-zero complex number $ z,$ let $\arg(z)$ be the unique real number $ t$ such that $ \minus{}\pi < t \leq \pi$ and $ z \equal{} |z|(\cos(t) \plus{} \textrm{i} sin(t)).$ Given a real number $ c > 0$ and a complex number $ z \neq 0$ with $\arg z \neq \pi,$ define \[ B(c, z) \equal{} \{b \in \mathbb{R} \ ; \ |w \minus{} z| < b \Rightarrow |\arg(w) \minus{} \arg(z)| < c\}.\] Determine necessary and sufficient conditions, in terms of $ c$ and $ z,$ such that $ B(c, z)$ has a maximum element, and determine what this maximum element is in this case.

$ 5 $ points are situated in the plane so that any three of them form a triangle of area at most $ 1. $ Prove that there is a trapezoid of area at most $ 3 $ which contains all these points ('including' here means that the points can also be on the sides of the trapezoid).

The nonzero coefficients of a polynomial $P$ with real coefficients are all replaced by their mean to form a polynomial $Q$. Which of the following could be a graph of $y = P(x)$ and $y = Q(x)$ over the interval $-4\leq x \leq 4$? [asy]//Choice A size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.101562 x^4+0.265625 x^3+0.0546875 x^2-0.109375 x+0.125; } real g(real x) { return 0.0625 x^4+0.0520833 x^3-0.21875 x^2-0.145833 x-2.5; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(A)}$", (-5,4.5)); [/asy] [asy]//Choice B size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.541667 x^4+0.458333 x^3-0.510417 x^2-0.927083 x-2; } real g(real x) { return -0.791667 x^4-0.208333 x^3-0.177083 x^2-0.260417 x-1; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(B)}$", (-5,4.5)); [/asy] [asy]//Choice C size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.21875 x^2+0.28125 x+0.5; } real g(real x) { return -0.375 x^2-0.75 x+0.5; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(C)}$", (-5,4.5)); [/asy] [asy]//Choice D size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.015625 x^5-0.244792 x^3+0.416667 x+0.6875; } real g(real x) { return 0.0284722 x^6-0.340278 x^4+0.874306 x^2-1.5625; } real z=3.14; draw(graph(f,-z, z), heavygray); draw(graph(g,-z, z), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(D)}$", (-5,4.5)); [/asy] [asy]//Choice E size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.026067 x^4-0.0136612 x^3-0.157131 x^2-0.00961796 x+1.21598; } real g(real x) { return -0.166667 x^3+0.125 x^2+0.479167 x-0.375; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(E)}$", (-5,4.5)); [/asy]

(1) Let $a,b$ be coprime positive integers. Prove that there exists constants $\lambda$ and $\beta$ such that for all integers $m$, $$\left| \sum\limits_{k=1}^{m-1} \left\{ \frac{ak}{m} \right\}\left\{ \frac{bk}{m} \right\} - \lambda m \right| \le \beta$$ (2) Prove that there exists $N$ such that for all $p>N$ (where $p$ is a prime number), and any positive integers $a,b,c$ positive integers satisfying $p\nmid (a+b)(b+c)(c+a)$, there are at least $\lfloor \frac{p}{12} \rfloor$ solutions $k\in \{1,\cdots,p-1\}$ such that $$ \left\{\frac{ak}{p}\right\} + \left\{\frac{bk}{p}\right\} + \left\{\frac{ck}{p}\right\} \le 1 $$

Let $p$ be a prime number and $k$ is a integer with $p|2^k-1$ for $a\in \{ 1,2,\ldots,p-1\}$ , let $m_{a}$ be the only element that satisfies $p|am_{a}-1$ and define $T_{a}= \{ x \in \{1,2,\ldots p-1\} | \{ \frac {m_{a}x}{p} - \frac {x}{ap} \} < \frac{1}{2}$and there exists integer y satisfying $p | x-y^\[k+1\] \}$ Try to proof that there exists an integer $m$ and integers $1 \le a_1 <a_2< \ldots < a_{m} \le p-1$ satisfying $$ |T_{a_1}| = |T_{a_2}| = \ldots = |T_{a_{m}}| = m $$

Let $a$ be a constant. In the $xy$ palne, the curve $C_1:y=\frac{\ln x}{x}$ touches $C_2:y=ax^2$. Find the volume of the solid generated by a rotation of the part enclosed by $C_1,\ C_2$ and the $x$ axis about the $x$ axis. [i]2011 Yokohama National Universty entrance exam/Engineering[/i]

66 players take part in the chess tournament, each player plays one game against each other, and the games take place in four cities. Prove that three players play all their games in the same city.

Let $O{}$ be the center of the circumscribed sphere of the tetrahedron $ABCD$. Let $L,M,N$ respectively be the midpoints of the segments $BC,CA,AB$. It is known that $AB+BC=AD+CD$, $BC+CA=BD+AD$, $CA+AB=CD+BD$. Prove that $\angle LOM=\angle MON=\angle NOL$. Find their value.

Let $f(x)=\frac 12e^{2x}+2e^x+x$. Answer the following questions. (1) For a real number $t$, set $g(x)=tx-f(x).$ When $x$ moves in the range of all real numbers, find the range of $t$ for which $g(x)$ has maximum value, then for the range of $t$, find the maximum value of $g(x)$ and the value of $x$ which gives the maximum value. (2) Denote by $m(t)$ the maximum value found in $(1)$. Let $a$ be a constant, consider a function of $t$, $h(t)=at-m(t)$. When $t$ moves in the range of $t$ found in $(1)$, find the maximum value of $h(t)$.

Determine the smallest real number $a$ such that there is a square of side $a$ such that contains $5$ unit circles inside it without common interior points in pairs.

An infinite arithmetic progression is given. The products of the pairs of its members are considered. Prove that two of these numbers differ by no more than 1. [i]Proposed by A. Kuznetsov[/i]

Let $R$, $S$, and $T$ be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the x-axis. The left edge of $R$ and the right edge of $S$ are on the $y$-axis, and $R$ contains $\frac{9}{4}$ as many lattice points as does $S$. The top two vertices of $T$ are in $R \cup S$, and $T$ contains $\frac{1}{4}$ of the lattice points contained in $R \cup S$. See the figure (not drawn to scale). [asy] //kaaaaaaaaaante314 size(8cm); import olympiad; label(scale(.8)*"$y$", (0,60), N); label(scale(.8)*"$x$", (60,0), E); filldraw((0,0)--(55,0)--(55,55)--(0,55)--cycle, yellow+orange+white+white); label(scale(1.3)*"$R$", (55/2,55/2)); filldraw((0,0)--(0,28)--(-28,28)--(-28,0)--cycle, green+white+white); label(scale(1.3)*"$S$",(-14,14)); filldraw((-10,0)--(15,0)--(15,25)--(-10,25)--cycle, red+white+white); label(scale(1.3)*"$T$",(3.5,25/2)); draw((0,-10)--(0,60),EndArrow(TeXHead)); draw((-34,0)--(60,0),EndArrow(TeXHead));[/asy] The fraction of lattice points in $S$ that are in $S \cap T$ is 27 times the fraction of lattice points in $R$ that are in $R \cap T$. What is the minimum possible value of the edge length of $R$ plus the edge length of $S$ plus the edge length of $T$? $\textbf{(A) }336\qquad\textbf{(B) }337\qquad\textbf{(C) }338\qquad\textbf{(D) }339\qquad\textbf{(E) }340$

Let $p \geq 5$ be a prime and let \begin{align*} (p-1)^p +1 = \prod _{i=1}^n q_i^{\beta_i} \end{align*} where $q_i$ are primes. Prove, \begin{align*} \sum_{i=1}^n q_i \beta_i >p^2 \end{align*}

Find a right triangle that can be cut into $365$ equal triangles.

Let $ABCD$ be a parallelogram. Let $X$ and $Y$ be arbitrary points on sides $BC$ and $CD$, respectively. Segments $BY$ and $DX$ intersect at $P$. Prove that the line going through the midpoints of segments $BD$ and $XY$ is either parallel to or coincides with line $AP$.

What should the angle at the vertex of an isosceles triangle be so that it is possible to construct a triangle with sides equal to the height, base, and one of the other sides of the isosceles triangle?

Find $$ \inf_{\substack{ n\ge 1 \\ a_1,\ldots ,a_n >0 \\ a_1+\cdots +a_n <\pi }} \left( \sum_{j=1}^n a_j\cos \left( a_1+a_2+\cdots +a_j \right)\right) . $$

Let triangle $ABC$ be an acute scalene triangle with orthocenter $H$. The foot of perpendicular from $A$ to $BC$ is $O$, and denote $K,L$ by the midpoints of $AB, AC$, respectively. For a point $D(\neq O,B,C)$ on segment $BC$, let $E,F$ be the orthocenters of triangles $ABD, ACD$, respectively, and denote $M,N$ by the midpoints of $DE,DF$. The perpendicular line from $M$ to $KH$ cuts the perpendicular line from $N$ to $LH$ at $P$. If $Q$ is the midpoint of $EF$, and $S$ is the orthocenter of triangle $HPQ$, then prove that as $D$ varies on $BC$, the ratio $\frac{OS}{OH}$, $\frac{OQ}{OP}$ remains constant.

Let $ABC$ be a triangle with circumcenter $O$ and $\angle BAC = 60^{\circ}$. The internal angle bisector of $\angle BAC$ meets line $BC$ and the circumcircle of $\triangle ABC$ in points $M,L$ respectively. Let $K$ denote the reflection of $BL\cap AC$ over the line $BC$. Let $D$ be on the line $CO$ with $DM$ perpendicular to $KL$. Prove that points $K,A,D$ are collinear. [i]Proposed by Sanjana Philo Chacko[/i]

There are 2018 points marked on a sphere. A zebra wants to paint each point white or black and, perhaps, connect some pairs of points of different colors with a segment. Find the residue modulo 5 of the number of ways to do this.

In the country of Sikinia there are finitely many cities. From each city, exactly three roads go out and each road goes to another Sikinian city. A tourist starts a trip from city $A$ and drives according to the following rule: he turns left at the first city, then right at the next city, and so on, alternately. Show that he will eventually return to $A.$

Two parabolas, $y = ax^2 + bx + c$ and $y = -ax^2- bx - c$, intersect at $x = 2$ and $x = -2$. If the $y$-intercepts of the two parabolas are exactly $2$ units apart from each other, compute $|a+b+c|$.

Let $f (x) = x^2 + ax + b$ be a quadratic function with real coefficients $a, b$. It is given that the equation $f (f (x)) = 0$ has $4$ distinct real roots and the sum of $2$ roots among these roots is equal to $-1$. Prove that $b \le -\frac14$

Given sequences $a_n=\frac{1}{n}{\sqrt[n] {_{2n}P_n}},\ b_n=\frac{1}{n^2}{\sqrt[n] {_{4n}P_{2n}}}$ and $c_n=\sqrt[n]{\frac{_{8n}P_{4n}}{_{6n}P_{4n}}}$, find $\lim_{n\to\infty} a_n,\ \lim_{n\to\infty} b_n$and $\lim_{n\to\infty} c_n.$

$\frac{3}{2}+\frac{5}{4}+\frac{9}{8}+\frac{17}{16}+\frac{33}{32}+\frac{65}{64}-7=$ $\textbf{(A) }-\frac{1}{64}\qquad\textbf{(B) }-\frac{1}{16}\qquad\textbf{(C) }0\qquad\textbf{(D) }\frac{1}{16}\qquad\textbf{(E) }\frac{1}{64}$