Construct a convex quadrilateral given two opposite angles and sides.

Let $P$ be a cyclic polygon with circumcenter $O$ that does not lie on any diagonal, and let $S$ be the set of points on 2D plane containing $P$ and $O$. The $\textit{Matcha Sweep Game}$ is a game between two players $A$ and $B$, with $A$ going first, such that each choosing a nonempty subset $T$ of points in $S$ that has not been previously chosen, and such that if $T$ has at least $3$ vertices then $T$ forms a convex polygon. The game ends with all points have been chosen, with the player picking the last point wins. For which polygons $P$ can $A$ guarantee a win? [i]Proposed by Anzo Teh Zhao Yang[/i]

Once upon a time, three boys visited a library for the first time. The first decided to visit the library every second day. The second decided to visit the library every third day. The third decided to visit the library every fourth day. The librarian noticed, that the library doesn't work on Wednesdays. The boys decided to visit library on Thursdays, if they have to do it on Wednesdays, but to restart the day counting in these cases. They strictly obeyed these rules. Some Monday later I met them all in that library. What day of week was when they visited a library for the first time?

Find all positive integer $n$ satisfying the conditions $a)n^2=(a+1)^3-a^3$ $b)2n+119$ is a perfect square.

[asy] fill(circle((4,0),4),grey); fill((0,0)--(8,0)--(8,-4)--(0,-4)--cycle,white); fill(circle((7,0),1),white); fill(circle((3,0),3),white); draw((0,0)--(8,0),black+linewidth(1)); draw((6,0)--(6,sqrt(12)),black+linewidth(1)); MP("A", (0,0), W); MP("B", (8,0), E); MP("C", (6,0), S); MP("D",(6,sqrt(12)), N); [/asy] In this diagram semi-circles are constructed on diameters $\overline{AB}$, $\overline{AC}$, and $\overline{CB}$, so that they are mutually tangent. If $\overline{CD} \bot \overline{AB}$, then the ratio of the shaded area to the area of a circle with $\overline{CD}$ as radius is: $\textbf{(A)}\ 1:2\qquad \textbf{(B)}\ 1:3\qquad \textbf{(C)}\ \sqrt{3}:7\qquad \textbf{(D)}\ 1:4\qquad \textbf{(E)}\ \sqrt{2}:6$

Let $ABC$ be an acute triangle.The lines $l_1$ and $l_2$ are perpendicular to $AB$ at the points $A$ and $B$, respectively.The perpendicular lines from the midpoint $M$ of $AB$ to the lines $AC$ and $BC$ intersect $l_1$ and $l_2$ at the points $E$ and $F$, respectively.If $D$ is the intersection point of the lines $EF$ and $MC$, prove that \[\angle ADB = \angle EMF.\]

Find, as a function of $\, n, \,$ the sum of the digits of \[ 9 \times 99 \times 9999 \times \cdots \times \left( 10^{2^n} - 1 \right), \] where each factor has twice as many digits as the previous one.

How many triangles with positive area are there whose vertices are points in the $xy$-plane whose coordinates are integers $(x,y)$ satisfying $1 \le x \le 4$ and $1 \le y \le 4$? $ \textbf{(A)}\ 496 \qquad\textbf{(B)}\ 500 \qquad\textbf{(C)}\ 512 \qquad\textbf{(D)}\ 516 \qquad\textbf{(E)}\ 560 $

Find the smallest possible area of an ellipse passing through $(2,0)$, $(0,3)$, $(0,7)$, and $(6,0)$.

Let $f(x)$ be a function, where if $q$ is an integer, then $f(\tfrac{1}{q})=q,$ and if $m$ and $n$ are real numbers, $f(m\cdot n)$ $ =$ $ f(m)\cdot f(n).$ If $f(\sqrt{2})$ can be written as $\tfrac{\sqrt{a}}{b}$ where $a$ is not divisible by the square of any prime and $b$ is a positive integer, then what is $a+b$?

Let $ABC$ be a triangle with given sides $a,b,c$. Determine the minimal possible length of the diagonal of an inscribed rectangle in this triangle. [i]Note: A rectangle is inscribed in the triangle if two of its consecutive vertices lie on one side of the triangle, while the other two vertices lie on the other two sides of the triangle. [/i]

$S_{1},S_{2},S_{3}$ are three spheres in $\mathbb R^{3}$ that their centers are not collinear. $k\leq8$ is the number of planes that touch three spheres. $A_{i},B_{i},C_{i}$ is the point that $i$-th plane touch the spheres $S_{1},S_{2},S_{3}$. Let $O_{i}$ be circumcenter of $A_{i}B_{i}C_{i}$. Prove that $O_{i}$ are collinear.

Let $n$ be some positive integer. Free university accepts $n^2$ freshmen, where no two students know each other initially. It's known that students can only get to know eachother on parties, which are organized by the university's administration. The administration's goal is to ensure that there does not exist a group of $n$ students where none of them know each other. Organizing a party with $m$ members incurs a cost of $m^2 - m$. Determine the minimal cost for the administration to fulfill their goal. [i]Proposed by Luka Macharashvili, Georgia[/i]

Let $ABCD$ be a trapezium and $AB$ and $CD$ be it's parallel edges. Find, with proof, the set of interior points $P$ of the trapezium which have the property that $P$ belongs to at least two lines each intersecting the segments $AB$ and $CD$ and each dividing the trapezium in two other trapezoids with equal areas.

Let $\triangle ABC$ be an acute-angled triangle. Let $P$ be the midpoint of $BC$, and $K$ the foot of the altitude from $A$ to side $BC$. Let $D$ be a point on segment $AP$ such that $\angle BDC = 90^\circ$. Let $E$ be the second point of intersection of line $BC$ with the circumcircle of $\triangle ADK$. Let $F$ be the second point of intersection of line $AE$ with the circumcircle of $\triangle ABC$. Prove that $\angle AFD = 90^\circ$.

Starting with the triple $(1007\sqrt{2},2014\sqrt{2},1007\sqrt{14})$, define a sequence of triples $(x_{n},y_{n},z_{n})$ by $x_{n+1}=\sqrt{x_{n}(y_{n}+z_{n}-x_{n})}$ $y_{n+1}=\sqrt{y_{n}(z_{n}+x_{n}-y_{n})}$ $ z_{n+1}=\sqrt{z_{n}(x_{n}+y_{n}-z_{n})}$ for $n\geq 0$.Show that each of the sequences $\langle x_n\rangle _{n\geq 0},\langle y_n\rangle_{n\geq 0},\langle z_n\rangle_{n\geq 0}$ converges to a limit and find these limits.