In triangle $ABC$, $BC = 23$, $CA = 27$, and $AB = 30$. Points $V$ and $W$ are on $\overline{AC}$ with $V$ on $\overline{AW}$, points $X$ and $Y$ are on $\overline{BC}$ with $X$ on $\overline{CY}$, and points $Z$ and $U$ are on $\overline{AB}$ with $Z$ on $\overline{BU}$. In addition, the points are positioned so that $\overline{UV} \parallel \overline{BC}$, $\overline{WX} \parallel \overline{AB}$, and $\overline{YZ} \parallel \overline{CA}$. Right angle folds are then made along $\overline{UV}$, $\overline{WX}$, and $\overline{YZ}$. The resulting figure is placed on a level floor to make a table with triangular legs. Let $h$ be the maximum possible height of a table constructed from triangle $ABC$ whose top is parallel to the floor. Then $h$ can be written in the form $\tfrac{k \sqrt{m}}{n}$, where $k$ and $n$ are relatively prime positive integers and $m$ is a positive integer that is not divisible by the square of any prime. Find $k + m + n$. [asy] unitsize(1 cm); pair translate; pair[] A, B, C, U, V, W, X, Y, Z; A[0] = (1.5,2.8); B[0] = (3.2,0); C[0] = (0,0); U[0] = (0.69*A[0] + 0.31*B[0]); V[0] = (0.69*A[0] + 0.31*C[0]); W[0] = (0.69*C[0] + 0.31*A[0]); X[0] = (0.69*C[0] + 0.31*B[0]); Y[0] = (0.69*B[0] + 0.31*C[0]); Z[0] = (0.69*B[0] + 0.31*A[0]); translate = (7,0); A[1] = (1.3,1.1) + translate; B[1] = (2.4,-0.7) + translate; C[1] = (0.6,-0.7) + translate; U[1] = U[0] + translate; V[1] = V[0] + translate; W[1] = W[0] + translate; X[1] = X[0] + translate; Y[1] = Y[0] + translate; Z[1] = Z[0] + translate; draw (A[0]--B[0]--C[0]--cycle); draw (U[0]--V[0],dashed); draw (W[0]--X[0],dashed); draw (Y[0]--Z[0],dashed); draw (U[1]--V[1]--W[1]--X[1]--Y[1]--Z[1]--cycle); draw (U[1]--A[1]--V[1],dashed); draw (W[1]--C[1]--X[1]); draw (Y[1]--B[1]--Z[1]); dot("$A$",A[0],N); dot("$B$",B[0],SE); dot("$C$",C[0],SW); dot("$U$",U[0],NE); dot("$V$",V[0],NW); dot("$W$",W[0],NW); dot("$X$",X[0],S); dot("$Y$",Y[0],S); dot("$Z$",Z[0],NE); dot(A[1]); dot(B[1]); dot(C[1]); dot("$U$",U[1],NE); dot("$V$",V[1],NW); dot("$W$",W[1],NW); dot("$X$",X[1],dir(-70)); dot("$Y$",Y[1],dir(250)); dot("$Z$",Z[1],NE); [/asy]

For each positive integer $n$ let the set $A_n$ consist of all numbers $\pm 1 \pm 2 \pm ...\pm n$. For example, $$A_1 = \{-1,1\}, A_2 = \{ -3 ,-1 ,1 ,3 \} , A_3 = \{ -6 ,-4 ,-2 ,0 ,2 ,4 ,6 \}.$$ Find the number of elements in $A_n$ .

When simplified and expressed with negative exponents, the expression $ (x \plus{} y)^{ \minus{} 1}(x^{ \minus{} 1} \plus{} y^{ \minus{} 1})$ is equal to: $ \textbf{(A)}\ x^{ \minus{} 2} \plus{} 2x^{ \minus{} 1}y^{ \minus{} 1} \plus{} y^{ \minus{} 2} \qquad\textbf{(B)}\ x^{ \minus{} 2} \plus{} 2^{ \minus{} 1}x^{ \minus{} 1}y^{ \minus{} 1} \plus{} y^{ \minus{} 2} \qquad\textbf{(C)}\ x^{ \minus{} 1}y^{ \minus{} 1}$ $ \textbf{(D)}\ x^{ \minus{} 2} \plus{} y^{ \minus{} 2} \qquad\textbf{(E)}\ \frac {1}{x^{ \minus{} 1}y^{ \minus{} 1}}$

Let $ABC$ be a triangle and $H$ its orthocenter. Let $D$ be a point lying on the segment $AC$ and let $E$ be the point on the line $BC$ such that $BC\perp DE$. Prove that $EH\perp BD$ if and only if $BD$ bisects $AE$.

Prove that the edges of a complete graph with $3^n$ vertices can be partitioned into disjoint cycles of length $3$.

Prove that the two last digits of $9^{9^{9}}$ and $9^{9^{9^{9}}}$ are the same in decimal representation.

How many integer triangles are there with inradius $1$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{Infinite} $

Suppose $a_1$, $a_2$, $\ldots$, $a_{10}$ are nonnegative integers such that \[\sum_{k=1}^{10}a_k=15\qquad\text{and}\qquad \sum_{k=1}^{10}ka_k = 80.\] Let $M$ and $m$ denote the maximum and minimum respectively of $\sum_{k=1}^{10}k^2a_k$. Compute $M-m$.

Find all positive integers $ n$ such that $ n^4\minus{}4n^3\plus{}22n^2\minus{}36n\plus{}18$ is a perfect square.

Let $x,y,z$ be positive reals and $x \geq y \geq z$. Prove that \[\frac{x^2y}{z}+\frac{y^2z}{x}+\frac{z^2x}{y} \geq x^2+y^2+z^2\]

In $ n$-dimensional Euclidean space, the square of the two-dimensional Lebesgue measure of a bounded, closed, (two-dimensional) planar set is equal to the sum of the squares of the measures of the orthogonal projections of the given set on the $ n$-coordinate hyperplanes. [i]L. Tamassy[/i]

There are $2011$ stones, whose weights are positive integers. If it is possible to divide these stones into $n$ groups not containing two stones with one weighs two times of the other, what is the least possible value of $n$? $\textbf{(A)}\ 102 \qquad\textbf{(B)}\ 51 \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ \text{None}$

A [i]permutation[/i] of the set of positive integers $[n] = \{1, 2, . . . , n\}$ is a sequence $(a_1 , a_2 , \ldots, a_n ) $ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$. Let $P (n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1 \leq k \leq n$. Find with proof the smallest $n$ such that $P (n)$ is a multiple of $2010$.

Let $ a,b,c,d$ be four distinct positive integers in arithmetic progression. Prove that $ abcd$ is not a perfect square.

An angle and a point $A$ inside it is given. Is it possible to draw through $A$ three straight lines so that on either side of the angle one of three points of intersection of these lines be the midpoint of two other points of intersection with that side?

[b]p16[/b] Madelyn is being paid $\$50$/hour to find useful [i]Non-Functional Trios[/i], where a Non-Functional Trio is defined as an ordered triple of distinct real numbers $(a, b, c)$, and a Non- Functional Trio is [i]useful [/i] if $(a, b)$, $(b, c)$, and $(c, a)$ are collinear in the Cartesian plane. Currently, she’s working on the case $a+b+c = 2022$. Find the number of useful Non-Functional Trios $(a, b, c)$ such that $a + b + c = 2022$. [b]p17[/b] Let $p(x) = x^2 - k$, where $k$ is an integer strictly less than $250$. Find the largest possible value of k such that there exist distinct integers $a, b$ with $p(a) = b$ and $p(b) = a$. [b]p18[/b] Let $ABC$ be a triangle with orthocenter $H$ and circumcircle $\Gamma$ such that $AB = 13$, $BC = 14$, and $CA = 15$. $BH$ and $CH$ meet $\Gamma$ again at points $D$ and $E$, respectively, and $DE$ meets $AB$ and $AC$ at $F$ and $G$, respectively. The circumcircles of triangles $ABG$ and $ACF$ meet BC again at points $P$ and $Q$. If $PQ$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd (a, b) = 1$, find $a + b$.

Define a [i]rooted tree[/i] to be a tree $T$ with a singular node designated as the [i]root[/i] of $T$. (Note that every node in the tree can have an arbitrary number of children.) Each vertex adjacent to the root node of $T$ is itself the root of some tree called a [i]maximal subtree[/i] of $T$. Say two rooted trees $T_1$ and $T_2$ are [i]similar[/i] if there exists some way to cycle the maximal subtrees of $T_1$ to get $T_2$. For example, the first pair of trees below are similar but the second pair are not. How many rooted trees with $2019$ nodes are there up to similarity? [center] [img=500x100]https://i.imgur.com/8axcDvz.png[/img] [/center]

Let there be a regular hexagon with sidelength $1$. Find the greatest integer $n\geq2$ for which there exist $n{}$ points inside or on the sides of the hexagon such that the distance between every two points is no less than $\sqrt{2}$.

Let $A$ be the subset of $\{1, 2, ..., 16\}$ that has $6$ elements. Prove that there exist $2$ subsets of $A$ that are disjoint, and the sum of their elements are the same.

Can you draw some diagonals in a convex $2014$-gon so that they do not intersect, the whole $2014$-gon is divided into triangles and each vertex belongs to an odd number of these triangles?

You are given a quadrilateral $ABCD$. It is known that $\angle BAC = 30^o$, $\angle D = 150^o$ and, in addition, $AB = BD$. Prove that $AC$ is the bisector of angle $C$.

Let $ABC$ be an acute triangle. Let $D$ and $E$ be the feet of the altitudes of the triangle $ABC$ from $A$ and $B$, respectively. Let $F$ be the reflection of the point $A$ over $BC$. Let $G$ be a point such that the quadrilateral $ABCG$ is a parallelogram. Show that the circumcircles of triangles $BCF$ , $ACG$ and $CDE$ are concurrent on a point different from $C$.

Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

Prove that it is possible to place $2n(2n + 1)$ parallelepipedic (rectangular) pieces of soap of dimensions $1 \times 2 \times (n + 1)$ in a cubic box with edge $2n + 1$ if and only if $n$ is even or $n = 1$. [i]Remark[/i]. It is assumed that the edges of the pieces of soap are parallel to the edges of the box.

Let $x,y$ be positive real numbers such that $x+y=1$. Prove that $\left(1+\frac {1}{x}\right)\left(1+\frac {1}{y}\right)\geq 9$.