Let $ABC$ be an acuteangled triangle with $AB> BC$ inscribed in a circle. The perpendicular bisector of the side $AC$ cuts arc $AC,$ containing $B,$ in $Q.$ Let $M$ be a point on the segment $AB$ such that $AM = MB + BC.$ Prove that the circumcircle of the triangle $BMC$ cuts $BQ$ in its midpoint.

A pair of fair $6$-sided dice is rolled $n$ times. What is the least value of $n$ such that the probability that the sum of the numbers face up on a roll equals $7$ at least once is greater than $\frac{1}{2}$? $\textbf{(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 5 \qquad \textbf{(E) } 6$

For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$

Let $a$, $b$ $c$ be the natural numbers, such that every digit occurs exactly the same number of times in each of the numbers $a$, $b$, $c$. Is it possible that $a + b + c = 10^{1001}$? Justify your answer.

Three right-angled triangles have been placed in a halfplane determined by a line $\ell$, each with one leg lying on $\ell$. Assume that there is a line parallel to $\ell$ cutting the triangles in three congruent segments. Show that, if each of the triangles is rotated so that its other leg lies on $\ell$, then there still exists a line parallel to $\ell$ cutting them in three congruent segments.

Point $P$ is taken on the extension of side $AB$ of an equilateral triangle $ABC$ so that $A$ is between $B$ and $P$. Denote by $a$ the side length of triangle $ABC$, by $r_1$ the inradius of triangle $PAC$, and by $r_2$ the exradius of triangle $PBC$ opposite $P$. Find the sum $r_1+r_2$ as a function in $a$.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]

To $m$ ounces of a $m\%$ solution of acid, $x$ ounces of water are added to yield a $(m-10)\%$ solution. If $m>25$, then $x$ is $\textbf{(A)}\ \frac{10m}{m-10} \qquad \textbf{(B)}\ \frac{5m}{m-10} \qquad \textbf{(C)}\ \frac{m}{m-10} \qquad \textbf{(D)}\ \frac{5m}{m-20} \\ \textbf{(E)}\ \text{not determined by the given information}$

Let $\, P(z) \,$ be a polynomial with complex coefficients which is of degree $\, 1992 \,$ and has distinct zeros. Prove that there exist complex numbers $\, a_1, a_2, \ldots, a_{1992} \,$ such that $\, P(z) \,$ divides the polynomial \[ \left( \cdots \left( (z-a_1)^2 - a_2 \right)^2 \cdots - a_{1991} \right)^2 - a_{1992}. \]

a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$. b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$. [i]Nikolai Nikolov, Emil Kolev[/i]

An alien from the planet Math came to Earth on monday and said: A. On Tuesday he said AY, on Wednesday AYYA, on Thursday AYYAYAAY. What will he say on saturday?

The sequence $a = (a_0, a_1,a_2,...)$ is defined by $a_0 = 0, a_1 =2$ and $$a_{n+2} = 2a_{n+1} + 41a_n$$Prove that $a_{2016}$ is divisible by $2017.$

Let $n$ be a positive integer. Compute the number of words $w$ that satisfy the following three properties. 1. $w$ consists of $n$ letters from the alphabet $\{a,b,c,d\}.$ 2. $w$ contains an even number of $a$'s 3. $w$ contains an even number of $b$'s. For example, for $n=2$ there are $6$ such words: $aa, bb, cc, dd, cd, dc.$

Prove that (a) if the natural number $n$ can be represented as $n =4k+1$ (where $k$ is an integer), then there exist $n$ odd positive integers whose sum is equal to their product, (b) if $n$ cannot be represented in this form then such a set does not exist. (M. Kontsevich)

Let $f(x) = 3x + 2.$ Prove that there exists $m \in \mathbb{N}$ such that $f^{100}(m)$ is divisible by $1988$.

Suppose that $(a_1,\ldots,a_{20})$ and $(b_1,\ldots,b_{20})$ are two sequences of integers such that the sequence $(a_1,\ldots,a_{20},b_1,\ldots,b_{20})$ contains each of the numbers $1,\ldots,40$ exactly once. What is the maximum possible value of the sum \[\sum_{i=1}^{20}\sum_{j=1}^{20}\min(a_i,b_j)?\]

In $\triangle ABC$, $AB = 30$, $BC = 40$, and $CA = 50$. Squares $A_1A_2BC$, $B_1B_2AC$, and $C_1C_2AB$ are erected outside $\triangle ABC$, and the pairwise intersections of lines $A_1A_2$, $B_1B_2$, and $C_1C_2$ are $P$, $Q$, and $R$. Compute the length of the shortest altitude of $\triangle PQR$. [i]Proposed by Lewis Chen[/i]

Let $ABCD$ be a rectangle with area $1$, and let $E$ lie on side $CD$. What is the area of the triangle formed by the centroids of triangles $ABE$, $BCE$, and $ADE$?

A $\text{22.0 kg}$ suitcase is dragged in a straight line at a constant speed of $\text{1.10 m/s}$ across a level airport floor by a student on the way to the 40th IPhO in Merida, Mexico. The individual pulls with a $\text{1.00} \times \text{10}^2 \text{N}$ force along a handle with makes an upward angle of $\text{30.0}$ degrees with respect to the horizontal. What is the coefficient of kinetic friction between the suitcase and the floor? (A) $\mu_\text{k} = \text{0.013}$ (B) $\mu_\text{k} = \text{0.394}$ (C) $\mu_\text{k} = \text{0.509}$ (D) $\mu_\text{k} = \text{0.866}$ (E) $\mu_\text{k} = \text{1.055}$

Three circles of radius $ 1$ are externally tangent to each other and internally tangent to a larger circle. What is the radius of the large circle? [asy]unitsize(0.8cm); defaultpen(linewidth(.8pt)+fontsize(8pt)); real r = 1 + (2/3)*(sqrt(3)); pair A = dir(47.5)*(r - 1); pair B = dir(167.5)*(r - 1); pair C = dir(-72.5)*(r - 1); draw(Circle(A,1)); draw(Circle(B,1)); draw(Circle(C,1)); draw(Circle(origin,r));[/asy] $ \textbf{(A)}\ \frac{2 \plus{} \sqrt{6}}{3}\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ \frac{2 \plus{} 3\sqrt{2}}{3}\qquad \textbf{(D)}\ \frac{3 \plus{} 2\sqrt{3}}{3}\qquad \textbf{(E)}\ \frac{3 \plus{} \sqrt{3}}{2}$

Consider the set \[\{0, 1\}^n = \{X = (x_1, x_2,\dots , x_n) : x_i \in \{0, 1\}, 1 \leq i \leq n\}.\] We say that $X > Y$ if $X \neq Y$ and the following $n$ inequalities are satisfy \[x_1 \geq y_1, x_1 + x_2 \geq y_1 + y_2,\dots , x_1 + x_2 + \cdots + x_n \geq y_1 + y_2 + \cdots + y_n.\] We define a chain of length $k$ as a subset ${Z_1,\dots , Z_k} \subseteq \{0, 1\}^n$ of distinct elements such that $Z_1 > Z_2 > \cdots > Z_k.$ Determine the lenght of longest chain in $\{0,1\}^n$.

Senators Sernie Banders and Cedric "Ced" Truz of OMOrica are running for the office of Price Dent. The election works as follows: There are $66$ states, each composed of many adults and $2017$ children, with only the latter eligible to vote. On election day, the children each cast their vote with equal probability to Banders or Truz. A majority of votes in the state towards a candidate means they "win" the state, and the candidate with the majority of won states becomes the new Price Dent. Should both candidates win an equal number of states, then whoever had the most votes cast for him wins. Let the probability that Banders and Truz have an unresolvable election, i.e., that they tie on both the state count and the popular vote, be $\frac{p}{q}$ in lowest terms, and let $m, n$ be the remainders when $p, q$, respectively, are divided by $1009$. Find $m + n$. [i]Proposed by Ashwin Sah[/i]

Let $D$ be the set of positive reals different from $1$ and let $n$ be a positive integer. If for $f: D\rightarrow \mathbb{R}$ we have $x^n f(x)=f(x^2)$, and if $f(x)=x^n$ for $0<x<\frac{1}{1989}$ and for $x>1989$, then prove that $f(x)=x^n$ for all $x \in D$.

Determine all polynomials P(x) with real coefficients such that [(x + 1)P(x − 1) − (x − 1)P(x)] is a constant polynomial.

Show that for any non-negative real numbers $a,b,c,d$ such that $a^2+b^2+c^2+d^2=1$ the following inequality hold: $$a+b+c+d-1\geq 16abcd$$ When does equality hold?