What is the minimum value of \[(x^2+2x+8-4\sqrt{3})\cdot(x^2-6x+16-4\sqrt{3})\] where $x$ is a real number? $ \textbf{(A)}\ 112-64\sqrt{3} \qquad\textbf{(B)}\ 3-\sqrt{3} \qquad\textbf{(C)}\ 8-4\sqrt{3} \\ \textbf{(D)}\ 3\sqrt{3}-4 \qquad\textbf{(E)}\ \text{None of the preceding} $

Find all triplets $(x, y, z)$ of real numbers for which $$\begin{cases}x^2- yz = |y-z| +1 \\ y^2 - zx = |z-x| +1 \\ z^2 -xy = |x-y| + 1 \end{cases}$$

Compute the remainder when the product of all positive integers less than and relatively prime to $2019$ is divided by $2019$.

In triangle $ABC$, $AL$ bisects angle $A$ and $CM$ bisects angle $C$. Points $L$ and $M$ are on $BC$ and $AB$, respectively. The sides of triangle $ABC$ are $a,b,$ and $c$. Then $\frac{\overline{AM}}{\overline{MB}}=k\frac{\overline{CL}}{\overline{LB}}$ where $k$ is: $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac{bc}{a^2}\qquad\textbf{(C)}\ \frac{a^2}{bc}\qquad\textbf{(D)}\ \frac{c}{b}\qquad\textbf{(E)}\ \frac{c}{a} $

Find all real solutions to the system of equations $$\begin{cases} x^2 +y^2 = 6z \\ y^2 +z^2 = 6x \\ z^2 +x^2 = 6y \end{cases}$$

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

The triangle $ABC$ is isosceles and has a right angle at the vertex $A$. Construct all points that simultaneously satisfy the following two conditions: (i) are equidistant from points $A$ and $B$ (ii) heve distance exactly three times from point $C$ as far as from point $B$.

A circle is tangential to sides $AB$ and $AD$ of convex quadrilateral $ABCD$ at $G$ and $H$ respectively, and cuts diagonal $AC$ at $E$ and $F$. What are the necessary and sufficient conditions such that there exists another circle which passes through $E$ and $F$, and is tangential to $DA$ and $DC$ extended?

The USAMTS tug-of-war team needs to pick a representative to send to the national tug-of-war convention. They don't care who they send, as long as they don't send the weakest person on the team. Their team consists of $20$ people, who each pull with a different constant strength. They want to design a tournament, with each round planned ahead of time, which at the end will allow them to pick a valid representative. Each round of the tournament is a $10$-on-$10$ tug-of-war match. A round may end in one side winning, or in a tie if the strengths of each side are matched. Show that they can choose a representative using a tournament with $10$ rounds.

A sequence $P=\left \{ a_{n} \right \}$ is called a $ \text{Permutation}$ of natural numbers (positive integers) if for any natural number $m,$ there exists a unique natural number $n$ such that $a_n=m.$ We also define $S_k(P)$ as: $S_k(P)=a_{1}+a_{2}+\cdots +a_{k}$ (the sum of the first $k$ elements of the sequence). Prove that there exists infinitely many distinct $ \text{Permutations}$ of natural numbers like $P_1,P_2, \cdots$ such that$:$ $$\forall k, \forall i<j: S_k(P_i)|S_k(P_j)$$

The following light grid is given: \begin{tabular}{cccc} o & o & o & o \\ o & o & o & o \\ o & o & o & o \\ o & o & o & o \end{tabular} where `o` represents a switched-off light and `•` represents a switched-on light. Each time a light is pressed, it toggles its state (on/off) as well as the state of its four adjacent neighbors (left, right, above, below). The bottom edge lights are considered to be immediately above the top edge lights, and the same applies to the lateral edges.The right figure illustrates the effect of pressing a light in a corner. Pressing a certain combination of lights results in all lights turning on. Prove that all lights must have been pressed at least once.

Faces of a cube $9\times 9\times 9$ are partitioned onto unit squares. The surface of a cube is pasted over by $243$ strips $2\times 1$ without overlapping. Prove that the number of bent strips is odd. [i]A. Poliansky[/i]

Prove that if $ a_i(i=1,2,3,4)$ are positive constants, $ a_2-a_4 > 2$, and $ a_1a_3-a_2 > 2$, then the solution $ (x(t),y(t))$ of the system of differential equations \[ \.{x}=a_1-a_2x+a_3xy,\] \[ \.{y}=a_4x-y-a_3xy \;\;\;(x,y \in \mathbb{R}) \] with the initial conditions $ x(0)=0, y(0) \geq a_1$ is such that the function $ x(t)$ has exactly one strict local maximum on the interval $ [0, \infty)$. [i]L. Pinter, L. Hatvani[/i]

Let $(a_i,b_i)$ be pairwise distinct pairs of positive integers for $1\le i\le n$. Prove that \[(a_1+a_2+\ldots+a_n)(b_1+b_2+\ldots+b_n)>\frac29 n^3,\] and show that the statement is sharp, i.e. for an arbitrary $c>\frac29$ it is possible that \[(a_1+a_2+\ldots+a_n)(b_1+b_2+\ldots+b_n)<cn^3.\] [i]Submitted by Péter Pál Pach, Budapest, based on an OKTV problem[/i]

On the sides $AB$, $BC$ and $CA$ of the isosceles triangle $ABC$ with the vertex at the point $B$ marked the points $M$, $D$ and $K$ respectively so that $AM = 2DC$ and $\angle AMD = \angle KDC$. Prove that $MD = KD$.

Let $f(x)=\lim_{n\to\infty} (\cos ^ n x+\sin ^ n x)^{\frac{1}{n}}$ for $0\leq x\leq \frac{\pi}{2}.$ (1) Find $f(x).$ (2) Find the volume of the solid generated by a rotation of the figure bounded by the curve $y=f(x)$ and the line $y=1$ around the $y$-axis.

What is the shortest distance between the plane $Ax + By + Cz + 1 = 0$ and the ellipsoid $\frac{x^2}{a^2} + \frac{y^2}{b^2} + \frac{z^2}{c^2} = 1.$ You may find it convenient to use the notation $h = (A^2 + B^2 + C^2)^{\frac{-1}{2}}, m = (a^2A^2 + b^2B^2 + c^2C^2)^{\frac{1}{2}}.$ What is the algebraic condition for the plane not to intersect the ellipsoid?

Let $\triangle ABC$ be an equilateral triangle with side length $s$ and $P$ a point in the interior of this triangle. Suppose that $PA$, $PB$, and $PC$ are the roots of the polynomial $t^3-18t^2+91t-89$. Then $s^2$ can be written in the form $m+\sqrt n$ where $m$ and $n$ are positive integers. Find $100m+n$. [i]Proposed by David Altizio[/i]

What is the radius of the largest circle centered at $(2, 2)$ that is completely bounded within the parabola $y = x^2 - 4x + 5$?

Given the point $O$ in the space and $1979$ straight lines $l_1, l_2, ... , l_{1979}$ containing it. Not a pair of lines is orthogonal. Given a point $A_1$ on $l_1$ that doesn't coincide with $O$. Prove that it is possible to choose the points $A_i$ on $l_i$ ($i = 2, 3, ... , 1979$) in so that $1979$ pairs will be orthogonal: $A_1A_3$ and $l_2$, $A_2A_4$ and $l_3$,$ ...$ , $A_{i-1}A_{i+1}$ and $l_i$,$ ...$ , $A_{1977}A_{1979}$ and $l_{1978}$, $A_{1978}A_1$ and $l_{1979}$, $A_{1979}A_2$ and $l_1$

Let $ABC$ be an acute-angled triangle and let $D$, $E$, and $F$ be the midpoints of $BC$, $CA$, and $AB$ respectively. Construct a circle, centered at the orthocenter of triangle $ABC$, such that triangle $ABC$ lies in the interior of the circle. Extend $EF$ to intersect the circle at $P$, $FD$ to intersect the circle at $Q$ and $DE$ to intersect the circle at $R$. Show that $AP=BQ=CR$.

Three numbered tiles are arranged in a tray as shown: [img]https://cdn.artofproblemsolving.com/attachments/d/0/d449364f92b7fae971fd348a82bafd25aa8ea1.jpg[/img] Show that we cannot interchange the $1$ and the $3$ by a sequence of moves where we slide a tile to the adjacent vacant space.

The sum of the digits in base ten of $ (10^{4n^2\plus{}8}\plus{}1)^2$, where $ n$ is a positive integer, is $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 4n \qquad \textbf{(C)}\ 2\plus{}2n \qquad \textbf{(D)}\ 4n^2 \qquad \textbf{(E)}\ n^2\plus{}n\plus{}2$

Let $n \geq 2$ be a natural number, and let $\left( a_{1};\;a_{2};\;...;\;a_{n}\right)$ be a permutation of $\left(1;\;2;\;...;\;n\right)$. For any integer $k$ with $1 \leq k \leq n$, we place $a_k$ raisins on the position $k$ of the real number axis. [The real number axis is the $x$-axis of a Cartesian coordinate system.] Now, we place three children A, B, C on the positions $x_A$, $x_B$, $x_C$, each of the numbers $x_A$, $x_B$, $x_C$ being an element of $\left\{1;\;2;\;...;\;n\right\}$. [It is not forbidden to place different children on the same place!] For any $k$, the $a_k$ raisins placed on the position $k$ are equally handed out to those children whose positions are next to $k$. [So, if there is only one child lying next to $k$, then he gets the raisin. If there are two children lying next to $k$ (either both on the same position or symmetric with respect to $k$), then each of them gets one half of the raisin. Etc..] After all raisins are distributed, a child is unhappy if he could have received more raisins than he actually has received if he had moved to another place (while the other children would rest on their places). For which $n$ does there exist a configuration $\left( a_{1};\;a_{2};\;...;\;a_{n}\right)$ and numbers $x_A$, $x_B$, $x_C$, such that all three children are happy?

A point $P$ lies in the same plane as a given square of side $1$. Let the vertices of the square, taken counterclockwise, be $A$, $B$, $C$ and $D$. Also, let the distances from $P$ to $A$, $B$ and $C$, respectively, be $u$, $v$ and $w$. What is the greatest distance that $P$ can be from $D$ if $u^2 + v^2 = w^2$? $ \textbf{(A)}\ 1 + \sqrt{2}\qquad\textbf{(B)}\ 2\sqrt{2}\qquad\textbf{(C)}\ 2 + \sqrt{2}\qquad\textbf{(D)}\ 3\sqrt{2}\qquad\textbf{(E)}\ 3 + \sqrt{2}$