The point ${D}$ inside the equilateral triangle ${\triangle ABC}$ satisfies ${\angle ADC = 150^o}$. Prove that a triangle with side lengths ${|AD|, |BD|, |CD|}$ is necessarily a right-angled triangle.

A child is sliding out of control with velocity $v_\text{c}$ across a frozen lake. He runs head-on into another child, initially at rest, with $3$ times the mass of the first child, who holds on so that the two now slide together. What is the velocity of the couple after the collision? (A) $2v_\text{c}$ (B) $v_\text{c}$ (C) $v_\text{c}/2$ (D) $v_\text{c}/3$ (E) $v_\text{c}/4$

At Typico High School, $60\%$ of the students like dancing, and the rest dislike it. Of those who like dancing, $80\%$ say that they like it, and the rest say that they dislike it. Of those who dislike dancing, $90\%$ say that they dislike it, and the rest say that they like it. What fraction of students who say they dislike dancing actually like it? $\textbf{(A) } 10\%\qquad \textbf{(B) } 12\%\qquad \textbf{(C) } 20\%\qquad \textbf{(D) } 25\%\qquad \textbf{(E) } 33\frac{1}{3}\%$

$n$ is a positive integer. An equilateral triangle of side length $3n$ is split into $9n^2$ unit equilateral triangles, each colored one of red, yellow, blue, such that each color appears $3n^2$ times. We call a trapezoid formed by three unit equilateral triangles as a "standard trapezoid". If a "standard trapezoid" contains all three colors, we call it a "colorful trapezoid". Find the maximum possible number of "colorful trapezoids".

Let R be a rectangle. How many circles in the plane of R have a diameter both of whose endpoints are vertices of R? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 4\qquad \textbf{(D)}\ 5\qquad \textbf{(E)}\ 6$

Let $P(x) = x^4-x^3+x$. a) Prove that for all positive real numbers $a$, the polynomial $P(x) - a$ has a unique positive zero. b) A sequence $(a_n)$ is defined by $a_1 = \dfrac{1}{3}$ and for all $n \geq 1$, $a_{n+1}$ is the positive zero of the polynomial $P(x) - a_n$. Prove that the sequence $(a_n)$ converges, and find the limit of the sequence.

Let $x,y,z\in \mathbb{R}^+$ be such that $xy+yz+zx=x+y+z$. Prove the following inequality: $\frac{1}{x^2+y+1}+\frac{1}{y^2+z+1}+\frac{1}{z^2+x+1}\leq 1$.

Natural numbers $a$ and $b$ are relatively prime. Prove that the greatest common divisor of $(a+b)$ and $(a^2+b^2)$ is either $1$ or $2$.

How many pairs of positive integers $(a, b)$ satisfy the equation $log_a 16 = b$?

The diagonals $AC$ and $CE$ of the regular hexagon $ABCDEF$ are divided by inner points $M$ and $N$ respectively, so that \[ {AM\over AC}={CN\over CE}=r. \] Determine $r$ if $B,M$ and $N$ are collinear.

Let $n,k$ are integers and $p$ is a prime number. Find all $(n,k,p)$ such that $|6n^2-17n-39|=p^k$

The numbers $1,2,\ldots,n$ are assigned to the vertices of a regular $n$-gon in an arbitrary order. For each edge, compute the product of the two numbers at the endpoints and sum up these products. What is the smallest possible value of this sum?

In a plane there is an ellipse $E$ with semiaxis $a,b$. Consider all the triangles inscribed in $E$ such that at least one of its sides is parallel to one of the axis of $E$. Find both the locus of the centroid of all such triangles and its area.

Prove that there exists infinitely many positive integers $n$ such that $n, n+1$, and $n+2$ can be written as the sum of two perfect squares.

Let $ AB$ be a chord of a circle $ k$ of radius $ r$, with $ AB\equal{}c$. $ (a)$ Construct the triangle $ ABC$ with $ C$ on $ k$ in which a median from $ A$ or $ B$ is of a given length $ d.$ $ (b)$ For which $ c$ and $ d$ is this triangle unique?

Triangle $ABC$ has $\overline{AB} = \overline{AC} = 20$ and $\overline{BC} = 15$. Let $D$ be the point in $\triangle ABC$ such that $\triangle ADB \sim \triangle BDC$. Let $l$ be a line through $A$ and let $BD$ and $CD$ intersect $l$ at $P$ and $Q$, respectively. Let the circumcircles of $\triangle BDQ$ and $\triangle CDP$ intersect at $X$. The area of the locus of $X$ as $l$ varies can be expressed in the form $\tfrac{p}{q}\pi$ for positive coprime integers $p$ and $q$. What is $p + q$?

Solve in $ \mathbb R$ the equation $ \sqrt{1\minus{}x}\equal{}2x^2\minus{}1\plus{}2x\sqrt{1\minus{}x^2}$.

Find all functions $f : \mathbb{N} \to \mathbb{N}$ satisfying the following conditions: [list] [*]For every $n \in \mathbb{N}$, $f^{(n)}(n) = n$. (Here $f^{(1)} = f$ and $f^{(k)} = f^{(k-1)} \circ f$.) [*]For every $m, n \in \mathbb{N}$, $\lvert f(mn) - f(m) f(n) \rvert < 2017$. [/list]

Given three squares as in the figure (where the vertex of B is touching square A --- the diagram had an error), where the largest square has area 1, and the area $ A$ is known. What is the area $ B$ of the smallest square? [img]http://i250.photobucket.com/albums/gg265/geometry101/NielsHenrikAbel1995Number4.jpg[/img] A. $ A/8$ B. $ \frac {A^2}{2}$ C. $ \frac {A^4}{4}$ D. $ A(1 \minus{} A)$ E. $ \frac {(1 \minus{} A)^2}{4}$

A student read the book with $480$ pages two times. If he in the second time for every day read $16$ pages more than in the first time and he finished it $5$ days earlier than in the first time. For how many days did he read the book in the first time?

$10$ points are drawn on each of two parallel lines. What is the largest number of acute triangles of positive area that can be formed using three of these $20$ points as vertices?

Sam Wang decides to evaluate an expression of the form $x +2 \cdot 2+ y$. However, he unfortunately reads each ’plus’ as a ’times’ and reads each ’times’ as a ’plus’. Surprisingly, he still gets the problem correct. Find $x + y$. [i]Proposed by Edwin Zhao[/i] [hide=Solution] [i]Solution.[/i] $\boxed{4}$ We have $x+2*2+y=x \cdot 2+2 \cdot y$. When simplifying, we have $x+y+4=2x+2y$, and $x+y=4$. [/hide]

In the Bank of Shower, a bored customer lays $n$ coins in a row. Then, each second, the customer performs ``The Process." In The Process, all coins with exactly one neighboring coin heads-up before The Process are placed heads-up (in its initial location), and all other coins are placed tails-up. The customer stops once all coins are tails-up. Define the function $f$ as follows: If there exists some initial arrangement of the coins so that the customer never stops, then $f(n) = 0$. Otherwise, $f(n)$ is the average number of seconds until the customer stops over all initial configurations. It is given that whenever $n = 2^k-1$ for some positive integer $k$, $f(n) > 0$. Let $N$ be the smallest positive integer so that \[ M = 2^N \cdot \left(f(2^2-1) + f(2^3-1) + f(2^4-1) + \cdots + f(2^{10}-1)\right) \]is a positive integer. If $M = \overline{b_kb_{k-1}\cdots b_0}$ in base two, compute $N + b_0 + b_1 + \cdots + b_k$. [i]Proposed by Edward Wan and Brandon Wang[/i]

Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$

In the $5\times6$ grid shown, fill in all of the grid cells with the digits $0\textendash9$ so that the following conditions are satisfied: [list=1][*] Each digit gets used exactly $3$ times. [*] No digit is greater than the digit directly above it. [*] In any four cells that form a $2\times2$ subgrid, the sum of the four digits must be a multiple of $3$.[/list] You do not need to prove that your configuration is the only one possible; you merely need to find a configuration that works. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) \[\begin{Large}\begin{array}{|c|c|c|c|c|c|}\hline&&&&\,7\,&\\ \hline&\,8\,&&&&\,6\,\\\hline&&\,2\,&\,4\,&&\\ \hline\,5\,&&&&1&\\ \hline&3&&&&\\ \hline\end{array}\end{Large}\]