Fix positive integers $m$ and $n$. Suppose that $a_1, a_2, \dots, a_m$ are reals, and that pairwise distinct vectors $v_1, \dots, v_m\in \mathbb{R}^n$ satisfy $$\sum_{j\neq i} a_j \frac{v_j-v_i}{||v_j-v_i||^3}=0$$ for $i=1,2,\dots,m$. Prove that $$\sum_{1\le i<j\le m} \frac{a_ia_j}{||v_j-v_i||}=0.$$

Let $S$ be the maximum possible value of \[\frac{a}{b^3+4}+\frac{b}{c^3+4}+\frac{c}{d^3+4}+\frac{d}{a^3+4} \] given that $a$, $b$, $c$, $d$ are nonnegative real numbers such that $a+b+c+d=4$. Given that $S$ can be written in the form $m/n$ where $m,n$ are coprime positive integers, find $100m+n$. [i]Proposed by Kaan Dokmeci[/i]

In an acute triangle $ABC$ the angle $\angle C$ is greater than $\angle A$. Let $E$ be such that $AE$ is a diameter of the circumscribed circle $\Gamma$ of \vartriangle ABC. Let $K$ be the intersection of $AC$ and the tangent line at $B$ to $\Gamma$. Let $L$ be the orthogonal projection of $K$ on $AE$ and let $D$ be the intersection of $KL$ and $AB$. Prove that $CE$ is the bisector of $\angle BCD$.

Let $ ABC$ be a triangle with sides $ BC\equal{}a, CA\equal{}b,AB\equal{}c$ and let $ D$ and $ E$ be the midpoints of $ AC$ and $ AB$, respectively. Prove that the medians $ BD$ and $ CE$ are perpendicular to each other if and only if $ b^2\plus{}c^2\equal{}5a^2$.

The following is a code and is meant to be broken. 2 707 156 377 38 2 328 17 185 2 713 73 566 1130 328 73 38 259 471 38 17 566 2 134 707 38 274 377 328 38 1130 40 377 566 73 820 566 566 134 11 2 328 38 185 2 713 566 134 328 2 918 134 11 713 134 274 707 713 73 38 1130 17 134 707 11 820 707 707 38 17 713 73 38 134 566 40 2 918 377 566 134 713 38 328 820 274 4 38 566 707 156 377 38 707 40 2 918 377 566 134 713 38 328 820 274 4 38 566 134 707 713 73 38 2 328 707 991 38 566 713 377 713 73 38 707 38 918 38 328 713 73 707 73 377 566 713 2 328 707 991 38 566 532 820 38 707 713 134 377 328 377 328 713 73 134 707 713 38 707 713 185 2 713 73 566 1130 328 707 40 2 918 377 566 134 713 38 328 820 274 4 38 566 134 707 713 73 38 2 328 707 991 38 566 713 377 713 73 38 707 38 11 377 328 17 259 377 328 79 2 328 707 991 38 566 532 820 38 707 713 134 377 328 377 328 713 73 134 707 713 38 707 713 991 73 2 713 134 707 713 73 38 707 820 274 377 40 713 73 38 134 566 40 2 918 377 566 134 713 38 328 820 274 4 38 566 707

$ABCD$ is a convex quadrilateral. Angles $A$ and $C$ are equal. Points $M$ and $N$ are on the sides $AB$ and $BC$ such that $MN||AD$ and $MN=2AD$. Let $K$ be the midpoint of $MN$ and $H$ be the orthocenter of $\triangle ABC$. Prove that $HK$ is perpendicular to $CD$.

Find the smallest positive integer whose cube ends in 888.

Among all orthogonal projections of a regular tetrahedron to all possible planes, find the projection of the greatest area.

The familiar $3$-dimensional cube has $6$ $2$-dimensional faces, $12$ $1$-dimensional edges, and $8$ $0$-dimensional vertices. Find the number of $9$-dimensional sub-subfaces in a $12$-dimensional cube.

Point $D$ lies on the side $AB$ of triangle $ABC$. The circle inscribed in angle $ADC$ touches internally the circumcircle of triangle $ACD$. Another circle inscribed in angle $BDC$ touches internally the circumcircle of triangle $BCD$. These two circles touch segment $CD$ in the same point $X$. Prove that the perpendicular from $X$ to $AB$ passes through the incenter of triangle $ABC$

A soccer team has 22 available players. A fixed set of 11 players starts the game, while the other 11 are available as substitutes. During the game, the coach may make as many as 3 substitutions, where any one of the 11 players in the game is replaced by one of the substitutes. No player removed from the game may reenter the game, although a substitute entering the game may be replaced later. No two substitutions can happen at the same time. The players involved and the order of the substitutions matter. Let $n$ be the number of ways the coach can make substitutions during the game (including the possibility of making no substitutions). Find the remainder when $n$ is divided by 1000.

Holden has a collection of polygons. He writes down a list containing the measure of each interior angle of each of his polygons. He writes down the list $30^\circ, 50^\circ, 60^\circ, 70^\circ, 90^\circ, 100^\circ, 120^\circ, 160^\circ,$ and $x^\circ,$ in some order. Compute $x.$

A given tetrahedron $ ABCD$ is isoceles, that is, $ AB\equal{}CD$, $ AC\equal{}BD$, $ AD\equal{}BC$. Show that the faces of the tetrahedron are acute-angled triangles.

Let $T$ be a real number satisfying the property: For any nonnegative real numbers $a, b, c,d, e$ with their sum equal to $1$, it is possible to arrange them around a circle such that the products of any two neighboring numbers are no greater than $T$. Determine the minimum value of $T$.

Given a parallelepiped $P$, let $V_P$ be its volume, $S_P$ the area of its surface and $L_P$ the sum of the lengths of its edges. For a real number $t \ge 0$, let $P_t$ be the solid consisting of all points $X$ whose distance from some point of $P$ is at most $t$. Prove that the volume of the solid $P_t$ is given by the formula $V(P_t) =V_P + S_Pt + \frac{\pi}{4} L_P t^2 + \frac{4\pi}{3} t^3$.

We are swapping two different digits of a number in each step. If we start with the number $12345$, which of the following cannot be got after an even number of steps? $ \textbf{(A)}\ 13425 \qquad\textbf{(B)}\ 21435 \qquad\textbf{(C)}\ 35142 \qquad\textbf{(D)}\ 43125 \qquad\textbf{(E)}\ 53124 $

Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. A circle $\Gamma$ is internally tangent to $\omega$ at $A$ and also tangent to $BC$ at $D$. Let $AB$ and $AC$ intersect $\Gamma$ at $P$ and $Q$ respectively. Let $M$ and $N$ be points on line $BC$ such that $B$ is the midpoint of $DM$ and $C$ is the midpoint of $DN$. Lines $MP$ and $NQ$ meet at $K$ and intersect $\Gamma$ again at $I$ and $J$ respectively. The ray $KA$ meets the circumcircle of triangle $IJK$ again at $X\neq K$. Prove that $\angle BXP = \angle CXQ$. [i]Kian Moshiri, United Kingdom[/i]

Source: 2017 Canadian Open Math Challenge, Problem B1 ----- Andrew and Beatrice practice their free throws in basketball. One day, they attempted a total of $105$ free throws between them, with each person taking at least one free throw. If Andrew made exactly $1/3$ of his free throw attempts and Beatrice made exactly $3/5$ of her free throw attempts, what is the highest number of successful free throws they could have made between them?

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

For which positive integers $n$ is the following statement true: if $a_1, a_2, ... , a_n$ are positive integers, $a_k \le n$ for all $k$ and $\sum\limits_{k=1}^{{n}}{a_k}=2n$ then it is always possible to choose $a_{i1} , a_{i2} , ..., a_{ij}$ in such a way that the indices $i_1, i_2,... , i_j$ are different numbers, and $\sum\limits_{k=1}^{{{j}}}{a_{ik}}=n$?

For any 2 convex polygons $S$ and $T$, if all the vertices of $S$ are vertices of $T$, call $S$ a sub-polygon of $T$. [b]I. [/b]Prove that for an odd number $n \geq 5$, there exists $m$ sub-polygons of a convex $n$-gon such that they do not share any edges, and every edge and diagonal of the $n$-gon are edges of the $m$ sub-polygons. [b]II.[/b] Find the smallest possible value of $m$.

Fill each white square in with a number so that each of the $27$ three-digit numbers whose digits are all $1$, $2$, or $3$ is used exactly once. For each pair of white squares sharing a side, the two numbers must have equal digits in exactly two of the three positions (ones, tens, hundreds). Some numbers have been given to you. You do not need to prove that your answer is the only one possible; you merely need to nd an answer that satises the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justication acceptable.) [asy] unitsize(16); int[][] a = { {999, 999, 999, 000, 000, 212, 000, 000}, {000, 888, 000, 213, 888, 000, 888, 123}, {000, 888, 000, 000, 000, 000, 131, 000}, {000, 888, 121, 888, 000, 113, 888, 000}, {000, 000, 000, 000, 312, 999, 999, 999}}; for (int i = 0; i < 8; ++i) { for (int j = 0; j < 5; ++j) { if (a[j][i] != 999) draw((i, -j)--(i+1, -j)--(i+1, -j-1)--(i, -j-1)--cycle); if (a[j][i] == 888) fill((i, -j)--(i+1, -j)--(i+1, -j-1)--(i, -j-1)--cycle); if (a[j][i] > 0 && a[j][i] < 999) label(string(a[j][i]), (i+0.5, -j-0.5), fontsize(8pt)); } } [/asy] [img]https://cdn.artofproblemsolving.com/attachments/f/b/bd9d0902922cd34e6e1b089373e515df698a9f.png[/img]

Consider a polynomial $P(x) = x^4+x^3-3x^2+x+2$. Prove that at least one of the coefficients of $(P(x))^k$, ($k$ is any positive integer) is negative. (5)

Let $ABC$ be an acute triangle such that $CA \neq CB$ with circumcircle $\omega$ and circumcentre $O$. Let $t_A$ and $t_B$ be the tangents to $\omega$ at $A$ and $B$ respectively, which meet at $X$. Let $Y$ be the foot of the perpendicular from $O$ onto the line segment $CX$. The line through $C$ parallel to line $AB$ meets $t_A$ at $Z$. Prove that the line $YZ$ passes through the midpoint of the line segment $AC$. [i]Proposed by Dominic Yeo, United Kingdom[/i]

Garfield and Odie are situated at $(0,0)$ and $(25,0)$, respectively. Suddenly, Garfield and Odie dash in the direction of the point $(9, 12)$ at speeds of $7$ and $10$ units per minute, respectively. During this chase, the minimum distance between Garfield and Odie can be written as $\frac{m}{\sqrt{n}}$ for relatively prime positive integers $m$ and $n$. Find $m+n$. [i]Proposed by [b] Th3Numb3rThr33 [/b][/i]