A triangle $ABC$ is inscribed in a circle $G$. For any point $M$ inside the triangle, $A_1$ denotes the intersection of the ray $AM$ with $G$. Find the locus of point $M$ for which $\frac{BM\cdot CM}{MA_1}$ is minimal, and find this minimum value.

* Given $\vartriangle ABC$, divide it into the minimal number of parts so that after being flipped over these parts can constitute the same $\vartriangle ABC$.

The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a $2 \times 2$ square. What is the smallest possible number of polygons? [missing figure]

For each positive integer $n$, let $S(n)$ be the sum of the digits of $n$. Determines the smallest positive integer $a$ such that there are infinite positive integers $n$ for which you have $S (n) -S (n + a) = 2018$.

Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if (i) $a_n < a_{n+1}$ for all $n\ge 1$, (ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.

$1+2+3+4+5+6=6+7+8$. What is the smallest number $k$ greater than $6$ for which: $1 + 2 +...+ k = k + (k+1) +...+ n$, with $n$ an integer greater than $k$ ?

In three houses $A,B$ and $C$, forming a right triangle with the legs $AC=30$ and $CB=40$, live three beetles $a,b$ and $c$, capable of moving at speeds of $2, 3$ and $4$, respectively. Suppose that you simultaneously release these bugs from point $M$ and mark the time after which beetles reach their homes. Find on the plane such a point $M$, where is the last time to reach the house a bug would be minimal.

Into an angle $A$ of size $a$, a circle is inscribed tangent to its sides at points $B$ and $C$. A line tangent to this circle at a point M meets the segments $AB$ and $AC$ at points $P$ and $Q$ respectively. What is the minimum $a$ such that the inequality $S_{PAQ}<S_{BMC}$ is possible?

Convex quadrilateral $ABCD$ is given. Lines $BC$ and $AD$ intersect at point $O$, with $B$ lying on the segment $OC$, and $A$ on the segment $OD$. $I$ is the center of the circle inscribed in the $OAB$ triangle, $J$ is the center of the circle exscribed in the triangle $OCD$ touching the side of $CD$ and the extensions of the other two sides. The perpendicular from the midpoint of the segment $IJ$ on the lines $BC$ and $AD$ intersect the corresponding sides of the quadrilateral (not the extension) at points $X$ and $Y$. Prove that the segment $XY$ divides the perimeter of the quadrilateral$ABCD$ in half, and from all segments with this property and ends on $BC$ and $AD$, segment $XY$ has the smallest length.

$4$ men stand at the entrance of a dark tunnel. Man $A$ needs $10$ minutes to pass through the tunnel, man $B$ needs $5$ minutes, man $C$ needs $2$ minutes and man $D$ needs $1$ minute. There is only one torch, that may be used from anyone that passes through the tunnel. Additionaly, at most $2$ men can pass through at the same time using the existing torch. Determine the smallest possible time the four men need to reach the exit of the tunnel.

The positive real numbers $a, b, c$ satisfy the equality $a + b + c = 1$. For every natural number $n$ find the minimal possible value of the expression $$E=\frac{a^{-n}+b}{1-a}+\frac{b^{-n}+c}{1-b}+\frac{c^{-n}+a}{1-c}$$

Consider all sets $A$ of one hundred different natural numbers with the property that any three elements $a,b,c \in A$ (not necessarily different) are the sides of a non-obtuse triangle. Denote by $S(A)$ the sum of the perimeters of all such triangles. Compute the smallest possible value of $S(A)$.

For an integer $n \ge 1$ we consider sequences of $2n$ numbers, each equal to $0, -1$ or $1$. The [i]sum product value[/i] of such a sequence is calculated by first multiplying each pair of numbers from the sequence, and then adding all the results together. For example, if we take $n = 2$ and the sequence $0,1, 1, -1$, then we find the products $0\cdot 1, 0\cdot 1, 0\cdot -1, 1\cdot 1, 1\cdot -1, 1\cdot -1$. Adding these six results gives the sum product value of this sequence: $0+0+0+1+(-1)+(-1) = -1$. The sum product value of this sequence is therefore smaller than the sum product value of the sequence $0, 0, 0, 0$, which equals $0$. Determine for each integer $n \ge 1$ the smallest sum product value that such a sequence of $2n$ numbers could have. [i]Attention: you are required to prove that a smaller sum product value is impossible.[/i]

Daniel chooses a positive integer $n$ and tells Ana. With this information, Ana chooses a positive integer $k$ and tells Daniel. Daniel draws $n$ circles on a piece of paper and chooses $k$ different points on the condition that each of them belongs to one of the circles he drew. Then he deletes the circles, and only the $k$ points marked are visible. From these points, Ana must reconstruct at least one of the circumferences that Daniel drew. Determine which is the lowest value of $k$ that allows Ana to achieve her goal regardless of how Daniel chose the $n$ circumferences and the $k$ points.

At a quiz show there are three doors. Behind exactly one of the doors, a prize is hidden. You may ask the quizmaster whether the prize is behind the left-hand door. You may also ask whether the prize is behind the right-hand door. You may ask each of these two questions multiple times, in any order that you like. Each time, the quizmaster will answer ‘yes’ or ‘no’. The quizmaster is allowed to lie at most $10$ times. You have to announce in advance how many questions you will be asking (but which questions you will ask may depend on the answers of the quizmaster). What is the smallest number you can announce, such that you can still determine with absolute certainty the door behind which the prize is hidden?

Let $ABC$ be a triangle. On its sides $AB$ and $BC$ are fixed points $C_1$ and $A_1$, respectively. Find a point $ P$ on the circumscribed circle of triangle $ABC$ such that the distance between the centers of the circumscribed circles of the triangles $APC_1$ and $CPA_1$ is minimal.

The plan of a picture gallery is a chequered figure where each square is a room, and every room can be reached from each other by moving to adjacent rooms. A custodian in a room can watch all the rooms that can be reached from this room by one move of a chess queen (without leaving the gallery). What minimum number of custodians is sufficient to watch all the rooms in every gallery of $n$ rooms ($n > 2$)?

What is the smallest perimeter of the convex $32$-gon, having all the vertices in the nodes of cross-lined paper with the sides of its squares equal to $1$?

Positive integers $x, y, z$ satisfy $xy + z = 160$. Compute the smallest possible value of $x + yz$.

Let $f$ be a one-to-one function from the set of natural numbers to itself such that $f(mn) = f(m)f(n)$ for all natural numbers $m$ and $n$. What is the least possible value of $f (999)$ ?

A polygonal line connects two opposite vertices of a cube with side $2$. Each segment of the line has length $3$ and each vertex lies on the faces (or edges) of the cube. What is the smallest number of segments the line can have?

Let $n$ and $k$ be positive integers such that $1 \leq n \leq N+1$, $1 \leq k \leq N+1$. Show that: \[ \min_{n \neq k} |\sin n - \sin k| < \frac{2}{N}. \]

In the diagram below $a, b, c, d, e, f, g, h, i, j$ are distinct positive integers and each (except $a, e, h$ and $j$) is the sum of the two numbers to the left and above. For example, $b = a + e, f = e + h, i = h + j$. What is the smallest possible value of $d$? j h i e f g a b c d

Prove that there exists a prime number $p$ such that the minimum positive integer $n$ such that $p|2^n -1$ is $3^{2013}$.

Let $a, b$ be two real numbers that satisfy $a^3 + b^3 = 8-6ab$. Find the maximum value and the minimum value that $a + b$ can take.