Let the circle $\Omega$ and the line $\ell$ intersect at two different points $A{}$ and $B{}$. For different and non-points. Let $X$ and $T$ be points on $\ell$ and $Y$ and $Z$ be points on $\Omega$, all of them different from $A{}$ and $B{}$. Prove the following statements: [list=a] [*]The points $X,Y$ and $Z$ lie on the same line if and only if \[\frac{\overline{AX}}{\overline{BX}}=\pm\frac{AY}{BY}\cdot\frac{AZ}{BZ}.\] [*]The points $X,Y,Z$ and $T$ lie on the same circle if and only if \[\frac{\overline{AX}}{\overline{BX}}\cdot\frac{\overline{AT}}{\overline{BT}}=\pm\frac{AY}{BY}\cdot\frac{AZ}{BZ}.\] [/list] Note: In both points, the sign $+$ is selected in the right parts of the equalities if the points $Y{}$ and $Z{}$ lie on the same arc $AB$ of the circle $\Omega$, and the sign $-$ if $Y{}$ and $Z{}$ lie on different arcs $AB$. By $\overline{AX}/\overline{BX}$, we indicate the ratio of the lengths of $AX$ and $BX$, taken with the sign $+$ or $-$ depending on whether the $AX$ and $BX$ vectors are co-directed or oppositely directed. [i]Proposed by M. Skopenkov[/i]

Choose terms of the harmonic series so that the sum of the chosen terms be finite. Prove that the sequence of these terms is of density zero in the sequence $ 1,\frac12,\frac13,\dots,\frac1n,\dots$

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

The point $M$ varies on the segment $AB$ that measures $2$ m. a) Find the equation and the graphical representation of the locus of the points of the plane whose coordinates, $x$, and $y$, are, respectively, the areas of the squares of sides $AM$ and $MB$ . b) Find out what kind of curve it is. (Suggestion: make a $45^o$ axis rotation). c) Find the area of the enclosure between the curve obtained and the coordinate axes.

Compute \[\lim_{h\to 0}\dfrac{\sin(\frac{\pi}{3}+4h)-4\sin(\frac{\pi}{3}+3h)+6\sin(\frac{\pi}{3}+2h)-4\sin(\frac{\pi}{3}+h)+\sin(\frac{\pi}{3})}{h^4}.\]

Determine all polynomials $P (x)$ with real coefficients that apply $P (x^2) + 2P (x) = P (x)^2 + 2$.

Let $f: \mathbb{Z}_{>0} \rightarrow \mathbb{Z}$ be a function with the following properties: (i) $f(1) = 0$ (ii) $f(p) = 1$ for all prime numbers $p$ (iii) $f(xy) = y \cdot f(x) + x \cdot f(y)$ for all $x,y$ in $\mathbb{Z}_{>0}$ Determine the smallest integer $n \ge 2015$ that satisfies $f(n) = n$. (Gerhard J. Woeginger)

Suppose that $x^{10} + x + 1 = 0$ and $x^100 = a_0 + a_1x +... + a_9x^9$. Find $a_5$.

Let $P(x) = x^4 + a_1x^3 + a_2x^2 + a_3x + a_4$ be a polynomial with rational coefficients. Show that if $P(x)$ has exactly one real root $\xi$, then $\xi$ is a rational number.

If $x + y = 3$ and $x^2 + y^2 = 7$, compute $x^3 + y^3 + x^4 + y^4$.

Let $a_1, a_2, a_3$ be three distinct real numbers. Define $$\begin{cases} b_1=\left(1+\dfrac{a_1a_2}{a_1-a_2}\right)\left(1+\dfrac{a_1a_3}{a_1-a_3}\right) \\ \\ b_2=\left(1+\dfrac{a_2a_3}{a_2-a_3}\right)\left(1+\dfrac{a_2a_1}{a_2-a_1}\right) \\ \\ b_3=\left(1+\dfrac{a_3a_1}{a_3-a_1}\right)\left(1+\dfrac{a_3a_2}{a_3-a_2}\right) \end {cases}$$ Prove that $$1 + |a_1b_1+a_2b_2+a_3b_3| \le (1+|a_1|) (1+|a_2|)(1+|a_3|)$$ When does equality hold?

Find the sum of first two integers $n > 1$ such that $3^n$ is divisible by $n$ and $3^n - 1$ is divisible by $n - 1$.

We have some cards that have the same look, but at the back of some of them is written $0$ and for the others $1$.(We can't see the back of a card so we can't know what's the number on it's back). we have a machine. we give it two cards and it gives us the product of the numbers on the back of the cards. if we have $m$ cards with $0$ on their back and $n$ cards with $1$ on their back, at least how many times we must use the machine to be sure that we get the number $1$? (15 points)

Suppose 2017 points in a plane are given such that no three points are collinear. Among the triangles formed by any three of these 2017 points, those triangles having the largest area are said to be [i]good[/i]. Prove that there cannot be more than 2017 good triangles.

Suppose that $ 4^a \equal{} 5$, $ 5^b \equal{} 6$, $ 6^c \equal{} 7$, and $ 7^d \equal{} 8$. What is $ a\cdot b\cdot c\cdot d$? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ \frac{3}{2}\qquad \textbf{(C)}\ 2\qquad \textbf{(D)}\ \frac{5}{2}\qquad \textbf{(E)}\ 3$

Triangle $ABC$ has sides $AB=9,BC = 5\sqrt{3},$ and $AC=12$. Points $A=P_0, P_1, P_2, \dots, P_{2450} = B$ are on segment $\overline{AB}$ with $P_k$ between $P_{k-1}$ and $P_{k+1}$ for $k=1,2,\dots,2449$, and points $A=Q_0, Q_1, Q_2, \dots ,Q_{2450} = C$ for $k=1,2,\dots,2449$. Furthermore, each segment $\overline{P_kQ_k}, k=1,2,\dots,2449$, is parallel to $\overline{BC}$. The segments cut the triangle into $2450$ regions, consisting of $2449$ trapezoids and $1$ triangle. Each of the $2450$ regions have the same area. Find the number of segments $\overline{P_kQ_k}, k=1,2 ,\dots,2450$, that have rational length.

Given a cyclic quadrilateral $ABCD$. Suppose $E, F, G, H$ are respectively the midpoint of the sides $AB, BC, CD, DA$. The line passing through $G$ and perpendicular on $AB$ intersects the line passing through $H$ and perpendicular on $BC$ at point $K$. Prove that $\angle EKF = \angle ABC$.

Find the largest positive integer $k$ such that $\phi ( \sigma ( 2^k)) = 2^k$. ($\phi(n)$ denotes the number of positive integers that are smaller than $n$ and relatively prime to $n$, and $\sigma(n)$ denotes the sum of divisors of $n$). As a hint, you are given that $641|2^{32}+1$.

Let $K, L, M, N$ be the midpoints of sides $AB, BC, CD, DA$ of a cyclic quadrilateral $ABCD$. Prove that the orthocentres of triangles $ANK, BKL, CLM, DMN$ are the vertices of a parallelogram.

Let k be a positive integer. Find the number of non-negative integers n less than or equal to $10^k$ satisfying the following conditions: (i) n is divisible by 3; (ii) Each decimal digit of n is one of the digits 2,0,1 or 7.

Let $n>1$ be an integer. Prove that there exists an integer $n-1 \ge m \ge \left \lfloor \frac{n}{2} \right \rfloor$ such that the following equation has integer solutions with $a_m>0:$ $$\frac{a_{m}}{m+1}+\frac{a_{m+1}}{m+2}+ \cdots + \frac{a_{n-1}}{n}=\frac{1}{\textrm{lcm}\left ( 1,2, \cdots , n \right )}$$ [i]Proposed by Navid Safaei[/i]

Five consecutive positive integers have the property that the sum of the second, third, and fourth is a perfect square, while the sum of all five is a perfect cube. If $m$ is the first of these five integers, then the minimum possible value of $m$ satisfies $ \mathrm{(A) \ } m \leq 200 \qquad \mathrm{(B) \ } 200 < m \leq 400 \qquad \mathrm {(C) \ } 400 < m \leq 600 \qquad \mathrm{(D) \ } 600 < m \leq 800 \qquad \mathrm{(E) \ } 800 < m$

6. Consider a triangle $ABC$ with $1 < \frac{AB}{AC} < \frac{3}{2}$. Let $M$ and $N$, respectively, be variable points of the sides $AB$ and $AC$, different from $A$, such that $\frac{MB}{AC} - \frac{NC}{AB} = 1$. Show that circumcircle of triangle $AMN$ pass through a fixed point different from $A$.

Show that there are no integers $x$ and $y$ satisfying $x^2 + 5 = y^3$. Daniel Harrer

Let $\mathbb{F}_p$ denote the field of integers modulo a prime $p,$ and let $n$ be a positive integer. Let $v$ be a fixed vector in $\mathbb{F}_p^n,$ let $M$ be an $n\times n$ matrix with entries in $\mathbb{F}_p,$ and define $G:\mathbb{F}_p^n\to \mathbb{F}_p^n$ by $G(x)=v+Mx.$ Let $G^{(k)}$ denote the $k$-fold composition of $G$ with itself, that is, $G^{(1)}(x)=G(x)$ and $G^{(k+1)}(x)=G(G^{(k)}(x)).$ Determine all pairs $p,n$ for which there exist $v$ and $M$ such that the $p^n$ vectors $G^{(k)}(0),$ $k=1,2,\dots,p^n$ are distinct.