Let $a,b,c\in\mathbb{Z^{+}}$ such that $$(a^2-1, b^2-1, c^2-1)=1$$ Prove that $$(ab+c, bc+a, ca+b)=(a,b,c)$$ (As usual, $(x,y,z)$ means the greatest common divisor of numbers $x,y,z$) [I]Proposed by A. Golovanov[/i]

Five students take a test on which any integer score from $0$ to $100$ inclusive is possible. What is the largest possible difference between the median and the mean of the scores?

Let $n \ge 2$ be an integer and $M= \{1,2,\ldots,n\}.$ For each $k \in \{1,2,\ldots,n-1\}$ we define $$x_k= \frac{1}{n+1} \sum_{\substack{A \subset M \\ |A|=k}} (\min A + \max A).$$ Prove that the numbers $x_k$ are integers and not all of them are divisible by $4.$ [hide=Notations]$|A|$ is the cardinal of $A$ $\min A$ is the smallest element in $A$ $\max A$ is the largest element in $A$[/hide]

A straight concrete sidewalk is to be $3$ feet wide, $60$ feet long, and $3$ inches thick. How many cubic yards of concrete must a contractor order for the sidewalk if concrete must be ordered in a whole number of cubic yards? $ \text{(A)}\ 2\qquad\text{(B)}\ 5\qquad\text{(C)}\ 12\qquad\text{(D)}\ 20\qquad\text{(E)}\ \text{more than 20} $

Triangle $ABC$ satisfies $\angle C=90^{\circ}$. A circle passing $A,B$ meets segment $AC$ at $G(\neq A,C)$ and it meets segment $BC$ at point $D(\neq B)$. Segment $AD$ cuts segment $BG$ at $H$, and let $l$, the perpendicular bisector of segment $AD$, cuts the perpendicular bisector of segment $AB$ at point $E$. A line passing $D$ is perpendicular to $DE$ and cuts $l$ at point $F$. If the circumcircle of triangle $CFH$ cuts $AC$, $BC$ at $P(\neq C),Q(\neq C)$ respectively, then prove that $PQ$ is perpendicular to $FH$.

Consider $9$ points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $\,n\,$ such that whenever exactly $\,n\,$ edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

Let $n$ be a positive integer such that the number \[\frac{1^k + 2^k + \dots + n^k}{n}\] is an integer for any $k \in \{1, 2, \dots, 99\}$. Prove that $n$ has no divisors between 2 and 100, inclusive.

$a, a_1,a_2,\dots ,a_n$ are natural numbers. We know that for any natural number $k$ which $ak+1$ is square, at least one of $a_1k+1,\dots ,a_n k+1$ is also square. Prove $a$ is one of $a_1,\dots ,a_n$ [i]Proposed by Mohsen Jamali[/i]

Daniel, Ethan, and Zack are playing a multi-round game of Tetris. Whoever wins $11$ rounds first is crowned the champion. However Zack is trying to pull off a "reverse-sweep", where (at-least) one of the other two players first hits $10$ wins while Zack is still at $0$, but Zack still ends up being the first to reach $11$. How many possible sequences of round wins can lead to Zack pulling off a reverse sweep? [i]Proposed by Dilhan Salgado[/i]

The graph, $G$ of $y = \log_{10}x$ is rotated $90^{\circ}$ counter-clockwise about the origin to obtain a new graph $G'$. Which of the following is an equation for $G'$? $ \textbf{(A)}\ y = \log_{10}\left(\frac{x + 90}{9}\right)\qquad\textbf{(B)}\ y = \log_{x}10\qquad\textbf{(C)}\ y = \frac{1}{x + 1}\qquad\textbf{(D)}\ y = 10^{-x}\qquad\textbf{(E)}\ y = 10^{x} $

Let \[ T \equal{} \frac1{3\minus{}\sqrt8} \minus{} \frac1{\sqrt8 \minus{} \sqrt7} \plus{} \frac1{\sqrt7\minus{}\sqrt6} \minus{} \frac1{\sqrt6\minus{}\sqrt5} \plus{} \frac1{\sqrt5\minus{}2}\] then $ \textbf{(A)}\ T<1 \qquad \textbf{(B)}\ T\equal{}1 \qquad \textbf{(C)}\ 1<T<2 \qquad \textbf{(D)}\ T>2 \qquad$ $ \textbf{(E)}\ T \equal{} \frac1{(3\minus{}\sqrt8)(\sqrt8\minus{}\sqrt7)(\sqrt7\minus{}\sqrt6)(\sqrt6\minus{}\sqrt5)(\sqrt5\minus{}2)}$

Of all parallelograms of a given area find the one with the shortest possible longer diagonal.

Let $m$, $n$ be positive integers. On an $m\times{n}$ checkerboard, divided into $1\times1$ squares, we consider all paths that go from upper right vertex to the lower left vertex, travelling exclusively on the grid lines by going down or to the left. We define the area of a path as the number of squares on the checkerboard that are below this path. Let $p$ be a prime such that $r_{p}(m)+r_{p}(n)\geq{p}$, where $r_{p}(m)$ denotes the remainder when $m$ is divided by $p$ and $r_{p}(n)$ denotes the remainder when $n$ is divided by $p$. How many paths have an area that is a multiple of $p$?

Let $x,y,z$ be positive real numbers. Prove that \[ \sum_{cyclic} \frac{xy}{xy+x^2+y^2} ~\le~ \sum_{cyclic} \frac{x}{2x+z} \] [i](Proposed by Šefket Arslanagić, Bosnia and Herzegovina)[/i]

Each row of a $24 \times 8$ table contains some permutation of the numbers $1, 2, \cdots , 8.$ In each column the numbers are multiplied. What is the minimum possible sum of all the products? [i](C. Wu)[/i]

Let $a$, $b$, $c \in (0,+\infty)$ . Then the following inequality is true:$$\sqrt{(a+b)(b+c)}+\sqrt{(b+c)(c+a)}+\sqrt{(c+a)(a+b)}+a+b+c\leq \left(ab+bc+ca\right)\left(\frac{1}{\sqrt{ab}}+\frac{1}{\sqrt{bc}}+\frac{1}{\sqrt{ca}}\right)$$

Let's consider the inequality $ a^3\plus{}b^3\plus{}c^3<k(a\plus{}b\plus{}c)(ab\plus{}bc\plus{}ca)$ where $ a,b,c$ are the sides of a triangle and $ k$ a real number. [b]a)[/b] Prove the inequality for $ k\equal{}1$. [b]b) [/b]Find the smallest value of $ k$ such that the inequality holds for all triangles.

In a $\triangle XYZ$, points $A,B$ lie on segment $ZX, C,D$ lie on segment $XY , E, F$ lie on segment $YZ$. $A, B, C, D$ lie on a circle, and $\frac{AZ \cdot EY \cdot ZB \cdot Y F}{EZ \cdot CY \cdot ZF \cdot Y D}= 1$ . Let $L = ZX \cap DE$, $M = XY \cap AF$, $N = Y Z \cap BC$. Prove that $L,M,N$ are collinear.

Let $ABC$ be a triangle, with $AB<AC$, and let $\Gamma$ be its circumcircle. Let $D$, $E$ and $F$ be the tangency points of the incircle with $BC$, $CA$ and $AB$ respectively. Let $R$ be the point in $EF$ such that $DR$ is an altitude in the triangle $DEF$, and let $S$ be the intersection of the external bisector of $\angle BAC$ with $\Gamma$. Prove that $AR$ and $SD$ intersect on $\Gamma$.

Find how many integer values $3\le n \le 99$ satisfy that the polynomial $x^2 + x + 1$ divides $x^{2^n} + x + 1$.

Let $\phi (n)$ be the number of positive integers less than or equal to $n$ that are relatively prime to $n$. Evaluate $$\sum \limits _{n=1} ^{64} (-1)^{n} \left \lfloor \frac{64}{n} \right \rfloor \phi (n).$$

Compute the smallest positive integer $k$ such that $49$ divides $\tbinom{2k}{k}.$

Let $a_1,a_2,a_3,\ldots$ be the sequence of real numbers defined by $a_1=1$ and $$a_m=\frac1{a_1^2+a_2^2+\ldots+a_{m-1}^2}\qquad\text{for }m\ge2.$$ Determine whether there exists a positive integer $N$ such that $$a_1+a_2+\ldots+a_N>2017^{2017}.$$

The magnitudes of the sides of triangle $ABC$ are $a$, $b$, and $c$, as shown, with $c\le b\le a$. Through interior point $P$ and the vertices $A$, $B$, $C$, lines are drawn meeting the opposite sides in $A'$, $B'$, $C'$, respectively. Let $s=AA'+BB'+CC'$. Then, for all positions of point $P$, $s$ is less than: $\textbf{(A) }2a+b\qquad\textbf{(B) }2a+c\qquad\textbf{(C) }2b+c\qquad\textbf{(D) }a+2b\qquad \textbf{(E) }$ $a+b+c$ [asy] import math; defaultpen(fontsize(11pt)); pair A = (0,0), B = (1,3), C = (5,0), P = (1.5,1); pair X = extension(B,C,A,P), Y = extension(A,C,B,P), Z = extension(A,B,C,P); draw(A--B--C--cycle); draw(A--X); draw(B--Y); draw(C--Z); dot(P); dot(A); dot(B); dot(C); label("$A$",A,dir(210)); label("$B$",B,dir(90)); label("$C$",C,dir(-30)); label("$A'$",X,dir(-100)); label("$B'$",Y,dir(65)); label("$C'$",Z,dir(20)); label("$P$",P,dir(70)); label("$a$",X,dir(80)); label("$b$",Y,dir(-90)); label("$c$",Z,dir(110)); //Credit to bobthesmartypants for the diagram [/asy]

Let $ABC$ be an acute triangle with orthocenter $H$. Segments $AH$ and $CH$ intersect segments $BC$ and $AB$ in points $A_1$ and $C_1$ respectively. The segments $BH$ and $A_1C_1$ meet at point $D$. Let $P$ be the midpoint of the segment $BH$. Let $D'$ be the reflection of the point $D$ in $AC$. Prove that quadrilateral $APCD'$ is cyclic. [i]Proposed by Matko Ljulj.[/i]