Let $ABCD$ be a convex quadrilateral and let $P$ and $Q$ be variable points inside this quadrilateral so that $\angle APB=\angle CPD=\angle AQB=\angle CQD$. Prove that the lines $PQ$ obtained in this way all pass through a fixed point , or they are all parallel.

Consider all $100$-digit numbers divisible by $19$. Prove that the number of such numbers not containing the digits $4, 5$, and $6$ is the number of such numbers that do not contain the digits $1, 4$ and $7$.

Floyd looked at a standard $12$ hour analogue clock at $2\!:\!36$. When Floyd next looked at the clock, the angles through which the hour hand and minute hand of the clock had moved added to $247$ degrees. How many minutes after $3\!:\!00$ was that?

In an acute triangle $ ABC$ segments $ BE$ and $ CF$ are altitudes. Two circles passing through the point $ A$ and $ F$ and tangent to the line $ BC$ at the points $ P$ and $ Q$ so that $ B$ lies between $ C$ and $ Q$. Prove that lines $ PE$ and $ QF$ intersect on the circumcircle of triangle $ AEF$. [i]Proposed by Davood Vakili, Iran[/i]

$m\times n$ grid is tiled by mosaics $2\times2$ and $1\times3$ (horizontal and vertical). Prove that the number of ways to choose a $1\times2$ rectangle (horizontal and vertical) such that one of its cells is tiled by $2\times2$ mosaic and the other cell is tiled by $1\times3$ mosaic [horizontal and vertical] is an even number.

The number $d_1d_2\cdots d_9$ has nine (not necessarily distinct) decimal digits. The number $e_1e_2\cdots e_9$ is such that each of the nine $9$-digit numbers formed by replacing just one of the digits $d_i$ in $d_1d_2\cdots d_9$ by the corresponding digit $e_i \;\;(1 \le i \le 9)$ is divisible by $7$. The number $f_1f_2\cdots f_9$ is related to $e_1e_2\cdots e_9$ is the same way: that is, each of the nine numbers formed by replacing one of the $e_i$ by the corresponding $f_i$ is divisible by $7$. Show that, for each $i$, $d_i-f_i$ is divisible by $7$. [For example, if $d_1d_2\cdots d_9 = 199501996$, then $e_6$ may be $2$ or $9$, since $199502996$ and $199509996$ are multiples of $7$.]

Let $C', A', B'$ be the midpoints of sides $[AB]$, $[BC]$, $[CA]$ of $\triangle ABC$, respectively. Let $H$ be the foot of perpendicular from $A$ to $BC$. If $|A'C'| = 6$, what is $|B'H|$? $ \textbf{a)}\ 5 \qquad\textbf{b)}\ 6 \qquad\textbf{c)}\ 5\sqrt 2 \qquad\textbf{d)}\ 6\sqrt 2 \qquad\textbf{e)}\ 7 $

[b]a)[/b] Let $ \left( x_n \right)_{n\ge 1} $ be a sequence of real numbers having the property that $ \left| x_{n+1} -x_n \right|\leqslant 1/2^n, $ for any $ n\geqslant 1. $ Show that $ \left( x_n \right)_{n\ge 1} $ is convergent. [b]b)[/b] Create a sequence $ \left( y_n \right)_{n\ge 1} $ of real numbers that has the following properties: $ \text{(i) } \lim_{n\to\infty } \left( y_{n+1} -y_n \right) = 0 $ $ \text{(ii) } $ is bounded $ \text{(iii) } $ is divergent [i]Eugen Popa[/i]

Three pairwise intersecting rays are given. At some point in time not on every ray from its beginning a point begins to move with speed. It is known that these three points form a triangle at any time, and the center of the circumscribed circle of this the triangle also moves uniformly and on a straight line. Is it true, that all these triangles are similar to each other?

Let $n,k$ be positive integers such that $n>k$. There is a square-shaped plot of land, which is divided into $n\times n$ grid so that each cell has the same size. The land needs to be plowed by $k$ tractors; each tractor will begin on the lower-left corner cell and keep moving to the cell sharing a common side until it reaches the upper-right corner cell. In addition, each tractor can only move in two directions: up and right. Determine the minimum possible number of unplowed cells.

Find all continuous functions $f: \mathbb{R}\to \mathbb{R}$ such that \[ f(x)-f(y)\in \mathbb{Q}\quad \text{ for all }\quad x-y\in\mathbb{Q} \]

Prove that every positive $a$ and $b$ satisfy inequality $$\frac{(a+b)^2}{2} + \frac{a+b}{4} \ge a\sqrt b + b\sqrt a$$

Consider the natural implementation of computing Fibonacci numbers: \begin{tabular}{l} 1: \textbf{FUNCTION} $\text{FIB}(n)$: \\ 2:$\qquad$ \textbf{IF} $n = 0$ \textbf{OR} $n = 1$ \textbf{RETURN} 1 \\ 3:$\qquad$ \textbf{RETURN} $\text{FIB}(n-1) + \text{FIB}(n-2)$ \end{tabular} When $\text{FIB}(10)$ is evaluated, how many recursive calls to $\text{FIB}$ occur?

For an integer $a$ and positive integers $n$ and $k$, let $f_k(a, n)$ be the remainder when $a^k$ is divided by $n$. Find the largest composite integer $n\leq 100$ that guarantees the infinite sequence \[ f_1(a,n),f_2(a,n),f_3(a,n),\ldots,f_i(a,n),\ldots \] to be periodic for all integers $a$ (i.e., for each choice of $a$, there is some positive integer $T$ such that $f_k(a,n) = f_{k+T}(a,n)$ for all $k$).

Evaluate $\frac{\frac{1}{\frac{1}{10} - \frac{1}{12}}}{\frac{1}{\frac{1}{8} - \frac{1}{6}} + \frac{1}{\frac{1}{5} - \frac{1}{6}}}$.

For positive integral $k>1$, we let $p(k)$ be its smallest prime divisor. Given an integer $a_1>2$, we define an infinite sequence $a_n$ by $a_{n+1}=a_n^n-1$ for each $n\geq 1$. For which values of $a_1$ is the sequence $p(a_n)$ bounded?

What is the value of \[\left(9+\dfrac{9}{9}\right)^{9-9/9} - \dfrac{9}{9}?\] [i]Proposed by David Altizio[/i]

How many digits are in the base-ten representation of $8^5 \cdot 5^{10} \cdot 15^5$? $\textbf{(A)}~14\qquad\textbf{(B)}~15\qquad\textbf{(C)}~16\qquad\textbf{(D)}~17\qquad\textbf{(E)}~18\qquad$

Find all functions $f: \mathbb N \to \mathbb N$ for which \[ f(n) + f(n+1) = f(n+2)f(n+3)-1996\] holds for all positive integers $n$.

Prove that for any prime number $p$ the equation $2^p+3^p=a^n$ has no solution $(a,n)$ in integers greater than $1$.

According to Moor's Law, the number of shoes in Moor's room doubles every year. In 2013, Moor's room starts out having exactly one pair of shoes. If shoes always come in unique, matching pairs, what is the earliest year when Moor has the ability to wear at least 500 mismatches pairs of shoes? Note that left and right shoes are distinct, and Moor must always wear one of each.

Given a positive integer $n$, an allowed move is to form $2n+1$ or $3n+2$. The set $S_{n}$ is the set of all numbers that can be obtained by a sequence of allowed moves starting with $n$. For example, we can form $5 \rightarrow 11 \rightarrow 35$ so $5, 11$ and $35$ belong to $S_{5}$. We call $m$ and $n$ compatible if $S_{m}$ and $S_{n}$ has a common element. Which members of $\{1, 2, 3, ... , 2002\}$ are compatible with $2003$?

Given a convex polyhedron with an even number of edges. Prove that we can attach an arrow to each edge, such that for every vertex of the polyhedron, the number of the arrows ending in this vertex is even.

Find the greatest seven-digit integer divisible by $132$ whose digits, in order, are $2, 0, x, y, 1, 2, z$ where $x$, $y$, and $z$ are single digits.

A positive interger number $k$ is called “$t-m$”-property if forall positive interger number $a$, there exists a positive integer number $n$ such that ${{1}^{k}}+{{2}^{k}}+{{3}^{k}}+...+{{n}^{k}} \equiv a (\bmod m).$ a) Find all positive integer numbers $k$ which has $t-20$-property. b) Find smallest positive integer number $k$ which has $t-{{20}^{15}}$-property.