Let $T = \{ 1, 2, 3, \dots, 14, 15 \}$. Say that a subset $S$ of $T$ is [i]handy[/i] if the sum of all the elements of $S$ is a multiple of $5$. For example, the empty set is handy (because its sum is 0) and $T$ itself is handy (because its sum is 120). Compute the number of handy subsets of $T$.

Show that there are only finitely many integral solutions to \[ 3^m - 1 = 2^n \] and find them.

Quadratic trinomials $F$ and $G$ satisfy $F(F(x)) > F(G(x)) > G(G(x))$ for all real $x$. Prove that $F(x) > G(x)$ for all real $x$.

A quadrilateral $ABCD$ is inscribed, as shown, in a square of area one unit. Prove that $$2\le |AB|^2+|BC|^2+|CD|^2+|DA|^2\le 4$$ [asy] size(6cm); draw((0,0)--(10,0)); draw((10,0)--(10,10)); draw((0,10)--(10,10)); draw((0,0)--(0,10)); dot((0,8.5)); dot((3.5,10)); dot((10,3.5)); dot((3.5,0)); label("$D$",(0,8.5),W); label("$A$",(3.5,10),NE); label("$B$",(10,3.5),E); label("$C$",(3.5,0),S); draw((0,8.5)--(3.5,10)); draw((3.5,10)--(10,3.5)); draw((10,3.5)--(3.5,0)); draw((3.5,0)--(0,8.5)); [/asy]

Say that two sets of positive integers $S, T$ are $\emph{k-equivalent}$ if the sum of the $i$th powers of elements of $S$ equals the sum of the $i$th powers of elements of $T$, for each $i= 1, 2, \ldots, k$. Given $k$, prove that there are infinitely many numbers $N$ such that $\{1,2,\ldots,N^{k+1}\}$ can be divided into $N$ subsets, all of which are $k$-equivalent to each other.

Points $A', B', C'$ are the reflections of vertices $A, B, C$ about the opposite sidelines of triangle $ABC$. Prove that the circles $AB'C', A'BC',$ and $A'B'C$ have a common point.

Two circles (centres $d$ apart) have radii $15,95$. The external tangents to the circles cut at $60$ degrees, find $d$. $$(A) 40$$ $$(B) 80$$ $$(C) 120$$ $$(D) 160$$

Goodnik writes 10 numbers on the board, then Nogoodnik writes 10 more numbers, all 20 of the numbers being positive and distinct. Can Goodnik choose his 10 numbers so that no matter what Nogoodnik writes, he can form 10 quadratic trinomials of the form $x^2 +px+q$, whose coeficients $p$ and $q$ run through all of the numbers written, such that the real roots of these trinomials comprise exactly 11 values? [i]I. Rubanov[/i]

Let $n$ be a positive integer, and let $b_{1}$, $b_{2}$, ..., $b_{n}$ be $n$ positive reals. Set $a_{1}=\frac{b_{1}}{b_{1}+b_{2}+...+b_{n}}$ and $a_{k}=\frac{b_{1}+b_{2}+...+b_{k}}{b_{1}+b_{2}+...+b_{k-1}}$ for every $k>1$. Prove the inequality $a_{1}+a_{2}+...+a_{n}\leq\frac{1}{a_{1}}+\frac{1}{a_{2}}+...+\frac{1}{a_{n}}$.

Let $x; y$ and $z$ be positive real numbers such that $\sqrt{x}+\sqrt{y}+\sqrt{z}= 1$. Prove that $\frac{x^{2}+yz}{\sqrt{2x^{2}(y+z)}}+\frac{y^{2}+zx}{\sqrt{2y^{2}(z+x)}}+\frac{z^{2}+xy}{\sqrt{2z^{2}(x+y)}}\geq 1.$

In a convex quadrilateral $ABCD$, the diagonals are perpendicular to each other and they intersect at $E$. Let $P$ be a point on the side $AD$ which is different from $A$ such that $PE=EC.$ The circumcircle of triangle $BCD$ intersects the side $AD$ at $Q$ where $Q$ is also different from $A$. The circle, passing through $A$ and tangent to line $EP$ at $P$, intersects the line segment $AC$ at $R$. If the points $B, R, Q$ are concurrent then show that $\angle BCD=90^{\circ}$.

Integers $x>2,\,y>1,\,z>0$ satisfy an equation $x^y+1=z^2$. Let $p$ be a number of different prime divisors of $x$, $q$ be a number of different prime divisors of $y$. Prove that $p\geq q+2$.

Prove that a tetrahedron with just one edge length greater than $1$ has volume at most $ \frac{1}{8}.$

Let $\triangle ABC$ have $AB=9$ and $AC=10$. A semicircle is inscribed in $\triangle ABC$ with its center on segment $BC$ such that it is tangent $AB$ at point $D$ and $AC$ at point $E$. If $AD=2DB$ and $r$ is the radius of the semicircle, $r^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Andy Xu[/i]

Both roots of the quadratic equation $ x^2 \minus{} 63x \plus{} k \equal{} 0$ are prime numbers. The number of possible values of $ k$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ \textbf{more than four}$

Consider the parametric function $ f_k:\mathbb{R}\longrightarrow\mathbb{R}, f(x)=x+k\lfloor x \rfloor . $ [b]a)[/b] For which integer values of $ k $ the above function is injective? [b]b)[/b] For which integer values of $ k $ the above function is surjective? [b]c)[/b] Given two natural numbers $ n,m, $ create two bijective functions: $$ \phi : f_m (\mathbb{R} )\cap [0,\infty )\longrightarrow f_n(\mathbb{R})\cap [0,\infty ) $$ $$ \psi : \left(\mathbb{R}\setminus f_m (\mathbb{R})\right)\cap [0,\infty )\longrightarrow\left(\mathbb{R}\setminus f_n (\mathbb{R})\right)\cap [0,\infty ) $$ [i]Cristinel Mortici[/i]

A college student drove his compact car $ 120$ miles home for the weekend and averaged $ 30$ miles per gallon. On the return trip the student drove his parents' SUV and averaged only $ 20$ miles per gallon. What was the average gas mileage, in miles per gallon, for the round trip? $ \textbf{(A)}\ 22 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 28$

The sum $$\sum_{k=84}^{8000}{k \choose 84}{{8084 - k} \choose 84}$$ can be written as a binomial coefficient $a \choose b$ for integers $a, b$. Find a possible pair $(a, b)$

Seven chips are numbered $1, 2, 3, 4, 5, 6, 7$. Prove that none of the seven-digit numbers formed by these chips is divisible by any other of these seven-digit numbers.

Find all one-to-one mappings $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $n$ the following relation holds: \[ f(f(n)) \leq \frac {n+f(n)} 2 . \]

A grasshopper rests on the point $(1,1)$ on the plane. Denote by $O,$ the origin of coordinates. From that point, it jumps to a certain lattice point under the condition that, if it jumps from a point $A$ to $B,$ then the area of $\triangle AOB$ is equal to $\frac 12.$ $(a)$ Find all the positive integral poijnts $(m,n)$ which can be covered by the grasshopper after a finite number of steps, starting from $(1,1).$ $(b)$ If a point $(m,n)$ satisfies the above condition, then show that there exists a certain path for the grasshopper to reach $(m,n)$ from $(1,1)$ such that the number of jumps does not exceed $|m-n|.$

Let $ABCD$ be an isosceles trapezoid with $\overline{BC}\parallel \overline{AD}$ and $AB=CD$. Points $X$ and $Y$ lie on diagonal $\overline{AC}$ with $X$ between $A$ and $Y$, as shown in the figure. Suppose $\angle AXD = \angle BYC = 90^\circ$, $AX = 3$, $XY = 1$, and $YC = 2$. What is the area of $ABCD?$ [asy] size(6cm); usepackage("mathptmx"); import geometry; void perp(picture pic=currentpicture, pair O, pair M, pair B, real size=5, pen p=currentpen, filltype filltype = NoFill){ perpendicularmark(pic, M,unit(unit(O-M)+unit(B-M)),size,p,filltype); } pen p=black+linewidth(1),q=black+linewidth(5); pair C=(0,0),Y=(2,0),X=(3,0),A=(6,0),B=(2,sqrt(5.6)),D=(3,-sqrt(12.6)); draw(A--B--C--D--cycle,p); draw(A--C,p); draw(B--Y,p); draw(D--X,p); dot(A,q); dot(B,q); dot(C,q); dot(D,q); dot(X,q); dot(Y,q); label("2",C--Y,S); label("1",Y--X,S); label("3",X--A,S); label("$A$",A,E); label("$B$",B,N); label("$C$",C,W); label("$D$",D,S); label("$Y$",Y,sqrt(2)*NE); label("$X$",X,N); perp(B,Y,C,8,p); perp(A,X,D,8,p); [/asy] $\textbf{(A)}\: 15\qquad\textbf{(B)} \: 5\sqrt{11}\qquad\textbf{(C)} \: 3\sqrt{35}\qquad\textbf{(D)} \: 18\qquad\textbf{(E)} \: 7\sqrt{7}$

Let be a natural number $ n\ge 2, $ a real number $ \lambda , $ and let be the set $$ H_{\lambda }=\left\{ \left( h_k^l \right)_{1\le k\le n}^{1\le l\le n}\in\mathcal{M}_n\left(\mathbb{R}\right) \bigg| \lambda =\sum_{k,l=1}^n h_k^l \right\} . $$ Prove the following statements. [b]a)[/b] The sets of symmetric and antisymmetric matrices from $ \mathcal{M}_n\left(\mathbb{R}\right) $ are subgroups of the additive subgroup $ \mathcal{M}_n\left(\mathbb{R}\right) , $ and any matrix from $ \mathcal{M}_n\left(\mathbb{R}\right) $ is a sum of a symmetric and antisymmetric matrix from $ \mathcal{M}_n\left(\mathbb{R}\right) . $ [b]b)[/b] $ \left( H_{\lambda },+\right)\le\left( \mathcal{M}_n\left(\mathbb{R}\right) ,+ \right)\iff \lambda =0 $ [b]c)[/b] There is a commutative group formed with the elements of $ H_{\lambda } $ if $ \lambda\neq 0. $ [i]Dan Negulescu[/i]

Let $P(x)$ be a polynomial with the coefficients being $0$ or $1$ and degree $2023$. If $P(0)=1$, then prove that every real root of this polynomial is less than $\frac{1-\sqrt{5}}{2}$.

Three fair six-sided dice are rolled. What is the probability that the values shown on two of the dice sum to the value shown on the remaining die? $ \textbf{(A)}\ \dfrac16\qquad\textbf{(B)}\ \dfrac{13}{72}\qquad\textbf{(C)}\ \dfrac7{36}\qquad\textbf{(D)}\ \dfrac5{24}\qquad\textbf{(E)}\ \dfrac29 $