Maureen is keeping track of the mean of her quiz scores this semester. If Maureen scores an $11$ on the next quiz, her mean will increase by $1$. If she scores an $11$ on each of the next three quizzes, her mean will increase by $2$. What is the mean of her quiz scores currently? $\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }7\qquad\textbf{(E) }8$

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

Suppose that $P$ is a polynomial with integer coefficients such that $P(1) = 2$, $P(2) = 3$ and $P(3) = 2016$. If $N$ is the smallest possible positive value of $P(2016)$, find the remainder when $N$ is divided by $2016$.

For each integer $n \ge 2$, find all integer solutions of the following system of equations: \[x_1 = (x_2 + x_3 + x_4 + ... + x_n)^{2018}\] \[x_2 = (x_1 + x_3 + x_4 + ... + x_n)^{2018}\] \[\vdots\] \[x_n = (x_1 + x_2 + x_3 + ... + x_{n - 1})^{2018}\]

Let $P_1, \ldots , P_s$ be arithmetic progressions of integers, the following conditions being satisfied: [b](i)[/b] each integer belongs to at least one of them; [b](ii)[/b] each progression contains a number which does not belong to other progressions. Denote by $n$ the least common multiple of the ratios of these progressions; let $n=p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ its prime factorization. Prove that \[s \geq 1 + \sum^k_{i=1} \alpha_i (p_i - 1).\] [i]Proposed by Dierk Schleicher, Germany[/i]

Given is a convex pentagon $ABCDE$ in which $\angle A = 60^o$, $\angle B = 100^o$, $\angle C = 140^o$. Show that this pentagon can be placed in a circle with a radius of $\frac23 AD$.

In the plane, Point $ O$ is the center of the equilateral triangle $ABC$ , Points $P,Q$ such that $\overrightarrow{OQ}=2\overrightarrow{PO}$. Prove that\[|PA|+|PB|+|PC|\le |QA|+|QB|+|QC|.\]

Let $ABC$ be a scalene triangle. The incircle is tangent to lines $BC$, $AC$, and $AB$ at points $D$, $E$, and $F$, respectively, and the $A$-excircle is tangent to lines $BC$, $AC$, and $AB$ at points $D_1$, $E_1$, and $F_1$, respectively. Suppose that lines $AD$, $BE$, and $CF$ are concurrent at point $G$, and suppose that lines $AD_1$, $BE_1$, and $CF_1$ are concurrent at point $G_1$. Let line $GG_1$ intersect the internal bisector of angle $BAC$ at point $X$. Suppose that $AX=1$, $\cos{\angle BAC}=\sqrt{3}-1$, and $BC=8\sqrt[4]{3}$. Then $AB \cdot AC = \frac{j+k\sqrt{m}}{n}$ for positive integers $j$, $k$, $m$, and $n$ such that $\gcd(j,k,n)=1$ and $m$ is not divisible by the square of any integer greater than $1$. Compute $1000j+100k+10m+n$. [i]Proposed by Luke Robitaille and Brandon Wang[/i]

Given is a polynomial $f$ of degree $m$ with integer coefficients and positive leading coefficient. A positive integer $n$ is $\textit {good for f(x)}$ if there exists a positive integer $k_n$, such that $n!+1=f(n)^{k_n}$. Prove that there exist only finitely many integers good for $f$.

Eight red boxes and eight blue boxes are randomly placed in four stacks of four boxes each. The probability that exactly one of the stacks consists of two red boxes and two blue boxes is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find $m + n$.

Triangle $ABC$ of area $1$ is given. Point $A'$ lies on the extension of side $BC$ beyond point $C$ with $BC = CA'$. Point $B'$ lies on extension of side $CA$ beyond $A$ and $CA = AB'$. $C'$ lies on extension of $AB$ beyond $B$ with $AB = BC'$. Find the area of triangle $A'B'C'$.

Let $a_1,a_2,a_3,...$ be a strictly increasing sequence of positive integers. A number $a_n$ in the sequence is said to be [i]lucky [/i] if it is the sum of several (not necessarily distinct) smaller terms of the sequence, and [i]unlucky [/i]otherwise. (For example, in the sequence $4,6,14,15,25,...$ numbers $4,6,15$ are [i]unlucky[/i], while $14 = 4+4+6$ and $25 = 4+6+15$ are [i]lucky[/i].) Prove that there are only finitely many [i]unlucky [/i]numbers in the sequence.

Let "AB" and $CD$ be two perpendicular chords of a circle with centre $O$ and radius $r$ and let $X,Y,Z,W$ denote the cyclical order of the four parts into which the disc is thus divided. Find the maximum and minimum of the quantity \[ \frac{A(X) + A(Z)}{A(Y) + A(W)}, \] where $A(U)$ denotes the area of $U.$

Which one satisfies the equation $\sqrt[3]{6+\sqrt{x}} + \sqrt[3]{6-\sqrt{x}} = \sqrt[3]{3}$ ? $ \textbf{(A)}\ 27 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 63$

Prove that for every positive integers $a$ and $b$ there exist positive integers $x$ and $y$ such that $\dfrac{x}{y+a}+\dfrac{y}{x+b}=\dfrac{3}{2}.$

$x,y,z,a,b,c$ are positive integers that satisfy $xy \equiv a \pmod z$, $yz \equiv b \pmod x$, $zx \equiv c \pmod y$. Prove that $\min{\{x,y,z\}} \le ab+bc+ca$.

There are lamps in every field of $n\times n$ table. At start all the lamps are off. A move consists of chosing $m$ consecutive fields in a row or a column and changing the status of that $m$ lamps. Prove that you can reach a state in which all the lamps are on only if $m$ divides $n.$

Let $p, k$ and $x$ be positive integers such that $p \geq k$ and $x < \left[ \frac{p(p-k+1)}{2(k-1)} \right]$, where $[q]$ is the largest integer no larger than $q$. Prove that when $x$ balls are put into $p$ boxes arbitrarily, there exist $k$ boxes with the same number of balls.

In $\triangle ABC$, $\angle C = 90^\circ, AC = 6$ and $BC = 8$. Points $D$ and $E$ are on $\overline{AB}$ and $\overline{BC}$, respectively, and $\angle BED = 90^\circ$. If $DE = 4$, then $BD =$ [asy] size(100); pathpen = linewidth(0.7); pointpen = black+linewidth(3); pair A = (0,0), C = (6,0), B = (6,8), D = (2*A+B)/3, E = (2*C+B)/3; D(D("A",A,SW)--D("B",B,NW)--D("C",C,SE)--cycle); D(D("D",D,NW)--D("E",E,plain.E)); D(rightanglemark(D,E,B,16)); D(rightanglemark(A,C,B,16));[/asy] $\mathbf{(A)}\;5\qquad \mathbf{(B)}\;\frac{16}{3}\qquad \mathbf{(C)}\; \frac{20}{3}\qquad \mathbf{(D)}\; \frac{15}{2}\qquad \mathbf{(E)}\; 8$

Define $p(n)$ to be th product of all non-zero digits of $n$. For instance $p(5)=5$, $p(27)=14$, $p(101)=1$ and so on. Find the greatest prime divisor of the following expression: \[p(1)+p(2)+p(3)+...+p(999).\]

Let $x, y, z$ be positive reals. Prove that $$\frac{xz}{x^2 + xy + y^2 + 6z^2} + \frac{zx}{z^2 + zy + y^2 + 6x^2} + \frac{xy}{x^2 + xz + z^2 + 6y^2} \le \frac13$$

Let $ABC$ be an acute-angled triangle, $M$ the midpoint of the side $AC$ and $F$ the foot on $AB$ of the altitude through the vertex $C$. Prove that $AM = AF$ holds if and only if $\angle BAC = 60^o$. (Karl Czakler)

Do there exist infinitely many positive integers $a, b$ such that $$(a^2+1)(b^2+1)((a+b)^2+1)$$ is a perfect square? [i]Proposed Ivan Chan Guan Yu[/i]

How many rational solutions are there to $5x^2+2y^2=1$?

Evaluate $ \int_{\frac {\pi}{4}}^{\frac {3}{4}\pi } \cos \frac {1}{\sin \left(\frac {1}{\sin x}\right)}\cdot \cos \left(\frac {1}{\sin x}\right)\cdot \frac {\cos x}{\sin ^ 2 x\cdot \sin ^ 2 \left(\frac {1}{\sin x }\right)}\ dx$ Last Edited, Sorry kunny