From a point $P$ outside a circle, two tangents are drawn touching the circle at points $A$ and $C$. Let $B$ be a point on segment $AC$, and let segment $PB$ intersect the circle at point $Q$. The angle bisector of $\angle AQC$ intersects segment $AC$ at $R$. Show that $$\frac{AB}{BC} =\left(\frac{ AR}{RC}\right)^2$$

The figure shows a $2\times 2$ grid that has been filled with the numbers $a, b, c$, and $d$. We say that this grid is [i]ordered[/i] if it is true that $a > b > c > d$ or that $a > d > c > b$. $\begin{tabular}{|l|l|} \hline a & b \\ \hline d & c \\ \hline \end{tabular}$ In how many ways can the numbers from $1$ to $1000$ be arranged in the cells of a $2 \times 500$ grid ($2$ rows and $500$ columns) so that each $2 \times 2$ sub-grid is ordered?

Let $f,g:\mathbb{R}\to\mathbb{R}$ be functions which satisfy \[\inf_{x>a}f(x)=g(a)\text{ and }\sup_{x<a}g(x)=f(a),\]for all $a\in\mathbb{R}.$ Given that $f$ has Darboux's Property (intermediate value property), show that functions $f$ and $g$ are continuous and equal to each other. [i]Mathematical Gazette [/i]

Find all monotonic functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ with the property that $$ (f(\sin x))^2-3f(x)=-2, $$ for any real numbers $ x. $ [i]Dorin Andrica[/i] and [i]Mihai Piticari[/i]

All internal angles of a convex octagon $ABCDEFGH$ are equal to each other and the edges are alternatively equal: $$AB = CD = EF = GH,BC = DE = FG = HA$$ (we call such an octagon semiregular). The diagonals $AD$, $BE$, $CF$, $DG$, $EH$, $FA$, $GB$ and $HC$ divide the inside of the octagon into certain parts. Consider the part containing the centre of the octagon. If that part is an octagon, then this central octagon is semiregular (this is obvious). In this case we construct similar diagonals in the central octagon and so on. If, after several steps, the central figure is not an octagon, then the process stops. Prove that if the process never stops, then the initial octagon was regular. (A. Tolpygo, Kiev)

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Let $ D$ be an interior point of the side $ BC$ of a triangle $ ABC$, and let $ O_1$ and $ O_2$ be the circumcenters of triangles $ ABD$ and $ ADC$. The perpendicular bisector of the side $ AC$ meets the line $ AO_1$ at $ E$, and the perpendicular bisector of the side $ AB$ meets the line $ AO_2$ at $ F$. Prove that the bisectors of the angles $ \angle O_1EO_2$ and $ \angle O_1FO_2$ are orthogonal.

Determine the number of times and the positions in which it appears $\frac12$ in the following sequence of fractions: $$ \frac11, \frac21, \frac12 , \frac31 , \frac22 , \frac13 , \frac41,\frac32,\frac23,\frac14,..., \frac{1}{1992}$$

Each row of the Misty Moon Amphitheater has $ 33$ seats. Rows $ 12$ through $ 22$ are reserved for a youth club. How many seats are reserved for this club? $ \textbf{(A)}\ 297\qquad \textbf{(B)}\ 330\qquad \textbf{(C)}\ 363\qquad \textbf{(D)}\ 396\qquad \textbf{(E)}\ 726$

A ball $K$ of radius $r$ is touched from the outside by mutually equal balls of radius $R$. Two of these balls are tangent to each other. Moreover, for two balls $K_1$ and $K_2$ tangent to $K$ and tangent to each other there exist two other balls tangent to $K_1,K_2$ and also to $K$. How many balls are tangent to $K$? For a given $r$ determine $R$.

Let $G$ be a simple connected graph with $2016$ vertices and $k$ edges. We want to choose a set of vertices where there is no edge between them and delete all these chosen vertices (we delete both the vertices and all edges of these vertices) such that the remaining graph becomes unconnected. If we can do this task no matter how these $k$ edges are arranged (by making the graph connected), find the maximal value of $k$.

In the figure, the rectangle is formed by $4$ smaller equal rectangles. If we count the total number of rectangles in the figure we find $10$. How many rectangles in total will there be in a rectangle that is formed by $n$ smaller equal rectangles?

Let $ S $ be a nonempty subset of a finite group $ G, $ and $ \left( S^j \right)_{j\ge 1} $ be a sequence of sets defined as $ S^j=\left.\left\{\underbrace{xy\cdots z}_{\text{j terms}} \right| \underbrace{x,y,\cdots ,z}_{\text{j terms}} \in S \right\} . $ Prove that: [b]a)[/b] $ \exists i_0\in\mathbb{N}^*\quad i\ge i_0\implies \left| S^i\right| =\left| S^{1+i}\right| $ [b]b)[/b] $ S^{|G|}\le G $

Show that there are infinitely many perfect squares of the form $50^m-50^n$, but no perfect square of the form $2020^m+2020^n$, where $m$ and $n$ are positive integers.

Prove that there is a number such that its decimal represantation ends with 1994 and it can be written as $1994\cdot 1993^{n}$ ($n\in{Z^{+}}$)

In the lower left corner of the $8 \times 8$ chessboard there is a king. He can move one cell either to the right, or up, or diagonally - to the right and up. How many ways can the king go to the upper right corner of the board if his route does not contain cells located on opposite sides of the diagonal going from the lower left to the upper right corner of the board?

Determine all pairs $(k, n)$ of positive integers that satisfy $$1! + 2! + ... + k! = 1 + 2 + ... + n.$$

Compute the maximum area of a rectangle which can be inscribed in a triangle of area $M$.

Let S be the point of intersection of the two lines $ l_1 : 7x \minus{} 5y \plus{} 8 \equal{} 0$ and $ l_2 : 3x \plus{} 4y \minus{} 13 \equal{} 0.$ Let $ P \equal{} (3, 7), Q \equal{} (11, 13),$ and let $ A$ and $ B$ be points on the line $ PQ$ such that $ P$ is between $ A$ and $ Q,$ and $ B$ is between $ P$ and $ Q,$ and such that \[ \frac{PA}{AQ} \equal{} \frac{PB}{BQ} \equal{} \frac{2}{3}.\] Without finding the coordinates of $ B$ find the equations of the lines $ SA$ and $ SB.$

The positive numbers $a, b, c,d,e$ are such that the following identity hold for all real number $x$: $(x + a)(x + b)(x + c) = x^3 + 3dx^2 + 3x + e^3$. Find the smallest value of $d$.

Let $a_1,a_2,a_3,\cdots $ be an infinite sequence of distinct integers. Prove that there are infinitely many primes $p$ that distinct positive integers $i,j,k$ can be found such that $p\mid a_ia_ja_k-1$. [i]Proposed by Mohsen Jamali[/i]

Let $p = 2017$ be a prime number. Let $E$ be the expected value of the expression \[3 \;\square\; 3 \;\square\; 3 \;\square\; \cdots \;\square\; 3 \;\square\; 3\] where there are $p+3$ threes and $p+2$ boxes, and one of the four arithmetic operations $\{+, -, \times, \div\}$ is uniformly chosen at random to replace each of the boxes. If $E = \tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find the remainder when $m+n$ is divided by $p$. [i]Proposed by Michael Tang[/i]

Let $n$ be a positive integer and $p_1, p_2, p_3, \ldots p_n$ be $n$ prime numbers all larger than $5$ such that $6$ divides $p_1 ^2 + p_2 ^2 + p_3 ^2 + \cdots p_n ^2$. prove that $6$ divides $n$.

How many positive divisors does number $20!$ have?

Alice and Bob play a game. First, Alice secretly picks a finite set $S$ of lattice points in the Cartesian plane. Then, for every line $\ell$ in the plane which is horizontal, vertical, or has slope $+1$ or $-1$, she tells Bob the number of points of $S$ that lie on $\ell$. Bob wins if he can determine the set $S$. Prove that if Alice picks $S$ to be of the form \[S = \{(x, y) \in \mathbb{Z}^2 \mid m \le x^2 + y^2 \le n\}\] for some positive integers $m$ and $n$, then Bob can win. (Bob does not know in advance that $S$ is of this form.) [i]Proposed by Mark Sellke[/i]