Let $x,y{}$ and $z{}$ be positive real numbers satisfying $x+y+z=1$. Prove that [list=a] [*]\[1-\frac{x^2-yz}{x^2+x}=\frac{(1-y)(1-z)}{x^2+x};\] [*]\[\frac{x^2-yz}{x^2+x}+\frac{y^2-zx}{y^2+y}+\frac{z^2-xy}{z^2+z}\leqslant 0.\] [/list]

Determine the smallest positive integer n for that there are positive integers $x_1, x_2,. . . , x_n$ so that each natural number from 1001 to 2021 inclusive can be written as sum of one or more different terms $x_i$ (i = 1, 2,..., n).

Find all functions $ f: \mathbb{R}\rightarrow \mathbb{R}$ satisfying \[ f(f(x) \plus{} y) \equal{} f(x^2 \minus{} y) \plus{} 4f(x)y \] for all $ x,y \in \mathbb{R}$.

Seated in a circle are $11$ wizards. A different positive integer not exceeding $1000$ is pasted onto the forehead of each. A wizard can see the numbers of the other $10$, but not his own. Simultaneously, each wizard puts up either his left hand or his right hand. Then each declares the number on his forehead at the same time. Is there a strategy on which the wizards can agree beforehand, which allows each of them to make the correct declaration?

Jarris the triangle is playing in the $(x, y)$ plane. Let his maximum $y$ coordinate be $k$. Given that he has side lengths $6$, $8$, and $10$ and that no part of him is below the $x$-axis, find the minimum possible value of $k$.

A [i]lattice point[/i] in the plane is a point with integer coordinates. Let $T$ be a triangle in the plane whose vertice are lattice points, but with no other lattice points on its sides. Furthermore, suppose $T$ contains exactly four lattice points in its interior. Prove that these four points lie on a straight line.

Show that there are only finitely many triples $(a, b, c)$ of positive integers such that $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = \frac{1}{1000}$.

On each square of an $n\times n$-chessboard, there are two bugs. In a move, each bug moves to a (vertically of horizontally) adjacent square. Bugs from the same square always move to different squares. Determine the maximal number of free squares that can occur after one move. [i](Swiss Mathematical Olympiad 2011, Final round, problem 10)[/i]

Show that the edges of a connected simple (no loops and no multiple edges) finite graph can be oriented so that the number of edges leaving each vertex is even if and only if the total number of edges is even

Some of the people attending a meeting greet each other. Let $n$ be the number of people who greet an odd number of people. Prove that $n$ is even.

Let $BCB'C'$ be a rectangle, let $M$ be the midpoint of $B'C'$, and let $A$ be a point on the circumcircle of the rectangle. Let triangle $ABC$ have orthocenter $H$, and let $T$ be the foot of the perpendicular from $H$ to line $AM$. Suppose that $AM=2$, $[ABC]=2020$, and $BC=10$. Then $AT=\frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$. [i]Proposed by Ankit Bisain[/i]

Let $ABCD$ be a trapezoid with $AB$ parallel to $CD$, $|AB|>|CD|$, and equal edges $|AD|=|BC|$. Let $I$ be the center of the circle tangent to lines $AB$, $AC$ and $BD$, where $A$ and $I$ are on opposite sides of $BD$. Let $J$ be the center of the circle tangent to lines $CD$, $AC$ and $BD$, where $D$ and $J$ are on opposite sides of $AC$. Prove that $|IC|=|JB|$.

Given a triangle $XYZ$ with $\angle Y = 90^{\circ}, XY=1,$ and $XZ=2,$ mark a point $Q$ on $YZ$ such that $\frac{ZQ}{ZY}=\frac{1}{3}.$ A laser beam is shot from $Q$ perpendicular to $YZ,$ and it reflects off the sides of $XYZ$ indefinitely. How far has the laser traveled when it reaches its $2010$th bounce?

A triangle $ABC$ is given. Let $M$ be the midpoint of the side $AC$ of the triangle and $Z$ the image of point $B$ along the line $BM$. The circle with center $M$ and radius $MB$ intersects the lines $BA$ and $BC$ at the points $E$ and $G$ respectively. Let $H$ be the point of intersection of $EG$ with the line $AC$, and $K$ the point of intersection of $HZ$ with the line $EB$. The perpendicular from point $K$ to the line $BH$ intersects the lines $BZ$ and $BH$ at the points $L$ and $N$, respectively. If $P$ is the second point of intersection of the circumscribed circles of the triangles $KZL$ and $BLN$, prove that, the lines $BZ, KN$ and $HP$ intersect at a common point.

Let $n>3$ be an integer. If $x_1<x_2<\ldots<x_{n+2}$ are reals with $x_1=0$, $x_2=1$ and $x_3>2$, what is the maximal value of $$(\frac{x_{n+1}+x_{n+2}-1}{x_{n+1}(x_{n+2}-1)})\cdot (\sum_{i=1}^{n}\frac{(x_{i+2}-x_{i+1})(x_{i+1}-x_i)}{x_{i+2}-x_i})?$$

Find the second smallest prime factor of $18!+1.$ [i]Proposed by Kaylee Ji[/i]

$A$ gives $B$ as many cents as $B$ has and $C$ as many cents as $C$ has. Similarly, $B$ then gives $A$ and $C$ as many cents as each then has. $C$, similarly, then gives $A$ and $B$ as many cents as each then has. If each finally has $16$ cents, with how many cents does $A$ start? $\textbf{(A)}\ 24 \qquad \textbf{(B)}\ 26\qquad \textbf{(C)}\ 28 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 32$

Let $\alpha$ and $\beta$ be reals. Find the least possible value of $$(2 \cos \alpha + 5 \sin \beta - 8)^2 + (2 \sin \alpha + 5 \cos \beta - 15)^2.$$

Let $n$ be an even positive integer. Let $p$ be a monic, real polynomial of degree $2 n$; that is to say, $p(x)=$ $x^{2 n}+a_{2 n-1} x^{2 n-1}+\cdots+a_1 x+a_0$ for some real coefficients $a_0, \ldots, a_{2 n-1}$. Suppose that $p(1 / k)=k^2$ for all integers $k$ such that $1 \leq|k| \leq n$. Find all other real numbers $x$ for which $p(1 / x)=x^2$.

Let $x_0 = 5$ and define the sequence recursively as $x_{n+1} = x_n + \frac{1}{x_n}$. Prove that: \[ 45 < x_{1000} < 45.1. \]

Fill in each space of the grid with either a $0$ or a $1$ so that all $16$ strings of four consecutive numbers across and down are distinct. You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable). [asy] draw((8,0)--(8,4)--(1,4)--(1,9)--(0,9) -- (0,5) -- (5,5)--(5,0)--(9,0)--(9,1)--(4,1)--(4,8)--(0,8)); draw((0,6)--(4,6)); draw((0,7)--(4,7)); draw((4,3)--(8,3)); draw((4,2)--(8,2)); draw((2,4)--(2,8)); draw((3,4)--(3,8)); draw((6,0)--(6,4)); draw((7,0)--(7,4)); label("0",(0.5, 8.5)); label("",(0.5, 7.5)); label("0",(0.5, 6.5)); label("1",(0.5, 5.5)); label("1",(1.5, 7.5)); label("",(1.5, 6.5)); label("",(1.5, 5.5)); label("0",(1.5, 4.5)); label("0",(2.5, 7.5)); label("1",(2.5, 6.5)); label("",(2.5, 5.5)); label("",(2.5, 4.5)); label("",(3.5, 7.5)); label("",(3.5, 6.5)); label("0",(3.5, 5.5)); label("1",(3.5, 4.5)); label("",(4.5, 4.5)); label("",(4.5, 3.5)); label("",(4.5, 2.5)); label("0",(4.5, 1.5)); label("0",(5.5, 3.5)); label("",(5.5, 2.5)); label("",(5.5, 1.5)); label("",(5.5, 0.5)); label("",(6.5, 3.5)); label("",(6.5, 2.5)); label("",(6.5, 1.5)); label("",(6.5, 0.5)); label("",(7.5, 3.5)); label("0",(7.5, 2.5)); label("",(7.5, 1.5)); label("1",(7.5, 0.5)); label("",(8.5, 0.5)); [/asy]

Let $\phi (x, u)$ be the smallest positive integer $n$ so that $2^u$ divides $x^n + 95$ if it exists, or $0$ if no such positive integer exists. Determine$ \sum_{i=0}^{255} \phi(i, 8)$.

The number of points with positive rational coordinates selected from the set of points in the xy-plane such that $x+y\leq 5$, is: $\text{(A)} \ 9 \qquad \text{(B)} \ 10 \qquad \text{(C)} \ 14 \qquad \text{(D)} \ 15 \qquad \text{(E)} \ \text{infinite}$

A chocolate bar in the shape of an equilateral triangle with side of the length $n$, consists of triangular chips with sides of the length $1$, parallel to sides of the bar. Two players take turns eating up the chocolate. Each player breaks off a triangular piece (along one of the lines), eats it up and passes leftovers to the other player (as long as bar contains more than one chip, the player is not allowed to eat it completely). A player who has no move or leaves exactly one chip to the opponent, loses. For each $n$, find who has a winning strategy.

Triangle $ ABC$, with sides of length $ 5$, $ 6$, and $ 7$, has one vertex on the positive $ x$-axis, one on the positive $ y$-axis, and one on the positive $ z$-axis. Let $ O$ be the origin. What is the volume of tetrahedron $ OABC$? $ \textbf{(A)}\ \sqrt{85} \qquad \textbf{(B)}\ \sqrt{90} \qquad \textbf{(C)}\ \sqrt{95} \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ \sqrt{105}$