Let $\Gamma$ be the circumcircle of an acute triangle $ABC$. The perpendicular line to $AB$ passing through $C$ cuts $AB$ in $D$ and $\Gamma$ again in $E$. The bisector of the angle $C$ cuts $AB$ in $F$ and $\Gamma$ again in $G$. The line $GD$ meets $\Gamma$ again at $H$ and the line $HF$ meets $\Gamma$ again at $I$. Prove that $AI = EB$.

In a collection of red, blue, and green marbles, there are $ 25\%$ more red marbles than blue marbles, and there are $ 60\%$ more green marbles than red marbles. Suppose that there are $ r$ red marbles. What is the total number of marbles in that collection? $ \textbf{(A)}\ 2.85r \qquad \textbf{(B)}\ 3r \qquad \textbf{(C)}\ 3.4r \qquad \textbf{(D)}\ 3.85r \qquad \textbf{(E)}\ 4.25r$

Find all three real numbers $(x, y, z)$ satisfying the system of equations $$\frac{x}{y}+\frac{y}{z}+\frac{z}{x}=\frac{x}{z}+\frac{z}{y}+\frac{y}{x}$$ $$x^2 + y^2 + z^2 = xy + yz + zx + 4$$

A $1 \times 5$ rectangle is split into five unit squares (cells) numbered 1 through 5 from left to right. A frog starts at cell 1. Every second it jumps from its current cell to one of the adjacent cells. The frog makes exactly 14 jumps. How many paths can the frog take to finish at cell 5?

Prove that for $n\geq 2$, \[\underbrace{2^{2^{\cdots^{2}}}}_{n\text{ terms}}\equiv \underbrace{2^{2^{\cdots^{2}}}}_{n-1\text{ terms}}\; \pmod{n}.\]

If $a, b, c$ are real numbers such that $$a^2 + b^2 + c^2 = 1$$ prove the inequalities $$- \frac12 \le ab + bc + ca \le 1$$

Mugdho and Dipto play a game on a numbered row of $n \geq 5$ squares. At the beginning, a pebble is put on the first square and then the players make consecutive moves; Mugdho starts. During a move a player is allowed to choose one of the following: [list] [*] move the pebble one square rightward [*] move the pebble four squares rightward [*] move the pebble two squares leftward [/list] All of the possible moves are only allowed if the pebble stays within the borders of the square row. The player who moves the pebble to the last square (a. k. a $n$-th) wins. Determine for which values of $n$ each of the players has a winning strategy.

$\log_8 2 = 0.2525$ in base $8$ (to $4$ places of decimals). Find $\log_8 4$ in base $8$ (to $4$ places of decimals).

Convex quadrilateral $ ABCD$ is inscribed in a circle, $ \angle{A}\equal{}60^o$, $ BC\equal{}CD\equal{}1$, rays $ AB$ and $ DC$ intersect at point $ E$, rays $ BC$ and $ AD$ intersect each other at point $ F$. It is given that the perimeters of triangle $ BCE$ and triangle $ CDF$ are both integers. Find the perimeter of quadrilateral $ ABCD$.

The infinite sequence of 2's and 3's \[\begin{array}{l}2,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3, \\ 3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,\cdots \end{array}\] has the property that, if one forms a second sequence that records the number of 3's between successive 2's, the result is identical to the given sequence. Show that there exists a real number $r$ such that, for any $n$, the $n$th term of the sequence is 2 if and only if $n = 1+\lfloor rm \rfloor$ for some nonnegative integer $m$.

(a) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ : $$a_k = \frac12 a_{k- 1} + \frac12 a_{k+1 }$$ (b) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ : $$a_k = 1+\frac12 a_{k- 1} + \frac12 a_{k+1 }$$.

$f: \mathbb R^{n}\longrightarrow\mathbb R^{n}$ is a bijective map, that Image of every $n-1$-dimensional affine space is a $n-1$-dimensional affine space. 1) Prove that Image of every line is a line. 2) Prove that $f$ is an affine map. (i.e. $f=goh$ that $g$ is a translation and $h$ is a linear map.)

In a permutation $(x_1, x_2, \dots , x_n)$ of the set $1, 2, \dots , n$ we call a pair $(x_i, x_j )$ discordant if $i < j$ and $x_i > x_j$. Let $d(n, k)$ be the number of such permutations with exactly $k$ discordant pairs. Find $d(n, 2)$ and $d(n, 3).$

The points $D,E$ and $F$ are chosen on the sides $BC,AC$ and $AB$ of triangle $ABC$, respectively. Prove that triangles $ABC$ and $DEF$ have the same centroid if and only if \[\frac{BD}{DC} = \frac{CE}{EA}=\frac{AF}{FB}\]

Let $\vartriangle ABC$ have sidelengths $BC = 7$, $CA = 8$, and, $AB = 9$, and let $\Omega$ denote the circumcircle of $\vartriangle ABC$. Let circles $\omega_A$, $\omega_B$, $\omega_C$ be internally tangent to the minor arcs $BC$, $CA$, $AB$ of $\Omega$, respectively, and tangent to the segments $BC$, $CA$, $AB$ at points $X$, $Y$, and, $Z$, respectively. Suppose that $\frac{BX}{XC} = \frac{CY}{Y A} = \frac{AZ}{ZB} = \frac12$ . Let $t_{AB}$ be the length of the common external tangent of $\omega_A$ and $\omega_B$, let $t_{BC}$ be the length of the common external tangent of $\omega_B$ and $\omega_C$, and let $t_{CA}$ be the length of the common external tangent of $\omega_C$ and $\omega_A$. If $t_{AB} + t_{BC} + t_{CA}$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$, find $m + n$.

All the chairs in a classroom are arranged in a square $n\times n$ array (in other words, $n$ columns and $n$ rows), and every chair is occupied by a student. The teacher decides to rearrange the students according to the following two rules: (a) Every student must move to a new chair. (b) A student can only move to an adjacent chair in the same row or to an adjacent chair in the same column. In other words, each student can move only one chair horizontally or vertically. (Note that the rules above allow two students in adjacent chairs to exchange places.) Show that this procedure can be done if $n$ is even, and cannot be done if $n$ is odd.

Let $a, b,c$ and $d$ be rea] numbers such that $a^2 + b^2 = c^2 + d^2 = 1$ and $ac + bd = 0$. Determine the value of $ab + cd$.

Prove the following: a) If $ABCA'B'C'$ is a right prism and $M \in (BC), N \in (CA), P \in (AB)$ such that $A'M, B'N$ and $C'P$ are perpendicular each other and concurrent, then the prism $ABCA'B'C'$ is regular. b) If $ABCA'B'C'$ is a regular prism and $\frac{AA'}{AB}=\frac{\sqrt6}{4}$ , then there are $M \in (BC), N \in (CA), P \in (AB)$ so that the lines $A'M, B'N$ and $C'P$ are perpendicular each other and concurrent.

How many positive integers less than $1000$ are there such that they cannot be written as sum of $2$ or more successive positive integers? $ \textbf{(A)}\ 6 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 26 \qquad\textbf{(D)}\ 68 \qquad\textbf{(E)}\ 72 $

We want to arrange $7$ students to attend $5$ sports events, but students $A$ and $B$ can't take part in the same event, every event has its own participants, and every student can only attend one event. How many arrangements are there?

Find the value of $n$ such that $\frac{2019 + n}{2019 - n}= 5$

Determine all $n$ for which the system with of equations can be solved in $\mathbb{R}$: \[\sum^{n}_{k=1} x_k = 27\] and \[\prod^{n}_{k=1} x_k = \left( \frac{3}{2} \right)^{24}.\]

Let $n\geq 2$ be an integer and consider an array composed of $n$ rows and $2n$ columns. Half of the elements in the array are colored in red. Prove that for each integer $k$, $1<k\leq \dsp \left\lfloor \frac n2\right\rfloor+1$, there exist $k$ rows such that the array of size $k\times 2n$ formed with these $k$ rows has at least \[ \frac { k! (n-2k+2) } {(n-k+1)(n-k+2)\cdots (n-1)} \] columns which contain only red cells.

Let $m>1$ and $n>1$ be integers. Suppose that the product of the solutions for $x$ of the equation \[8(\log_n x)(\log_m x) - 7 \log_n x - 6 \log_m x - 2013 = 0\] is the smallest possible integer. What is $m+n$? ${ \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 48\qquad\textbf{(E)}\ 272 $

Compute \[\sum_{n=1}^\infty \dfrac{1}{n\cdot(n+1)\cdot(n+1)!}.\]