There are $10$ horses, named Horse 1, Horse 2, $\ldots$, Horse 10. They get their names from how many minutes it takes them to run one lap around a circular race track: Horse $k$ runs one lap in exactly $k$ minutes. At time 0 all the horses are together at the starting point on the track. The horses start running in the same direction, and they keep running around the circular track at their constant speeds. The least time $S > 0$, in minutes, at which all $10$ horses will again simultaneously be at the starting point is $S = 2520$. Let $T>0$ be the least time, in minutes, such that at least $5$ of the horses are again at the starting point. What is the sum of the digits of $T$? $\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$

Let be a tetahedron $ OABC $ with $ OA\perp OB\perp OC\perp OA. $ Show that $$ OH\le r\left( 1+\sqrt 3 \right) , $$ where $ H $ is the orthocenter of $ ABC $ and $ r $ is radius of the inscribed spere of $ OABC. $ [i]Valentin Vornicu[/i]

Triangle $ABC$ with $\measuredangle A = 90^\circ$ has incenter $I$. A circle passing through $A$ with center $I$ is drawn, intersecting $\overline{BC}$ at $E$ and $F$ such that $BE < BF$. If $\tfrac{BE}{EF} = \tfrac{2}{3}$, then $\tfrac{CF}{FE} = \tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Lewis Chen [/i]

Let ABC be a triangle with angle ACB=60. Let AA' and BB' be altitudes and let T be centroid of the triangle ABC. If A'T and B'T intersect triangle's circumcircle in points M and N respectively prove that MN=AB.

An ordered pair $(n,p)$ is [i]juicy[/i] if $n^{2} \equiv 1 \pmod{p^{2}}$ and $n \equiv -1 \pmod{p}$ for positive integer $n$ and odd prime $p$. How many juicy pairs exist such that $n,p \leq 200$? Proposed by Harry Chen (Extile)

Let $ABC$ be a triangle and let $D$ be a point on $AC$. The angle bisector of $\angle BAC$ intersects $BD$ at $E$ and $BC$ at $F$. Suppose that $\tfrac{CF}{DE}=\tfrac{5}{4}$ and that $\tfrac{BE}{BF}=\tfrac{3}{2}$. What is $\tfrac{CD}{AD}$?

Show that the numerator of \[ \frac{2^{p-1}}{p+1} - \left(\sum_{k = 0}^{p-1}\frac{\binom{p-1}{k}}{(1-kp)^2}\right) \] is a multiple of $p^3$ for any odd prime $p$. [i]Proposed by Yang Liu[/i]

Alice has six boxes labelled 1 through 6. She secretly chooses exactly two of the boxes and places a coin inside each. Bob is trying to guess which two boxes contain the coins. Each time Bob guesses, he does so by tapping exactly two of the boxes. Alice then responds by telling him the total number of coins inside the two boxes that he tapped. Bob successfully finds the two coins when Alice responds with the number 2. What is the smallest positive integer $n$ such that Bob can always find the two coins in at most $n$ guesses?

Consider a cube $ABCDA'B'C'D'$ (where $ABCD$ is a square and $AA' \parallel BB' \parallel CC' \parallel DD'$) and a point $P$ on the line $AA'$. Construct center $S$ of a sphere which has plane $ABB'$ as a plane of symmetry, $P$ lies on the sphere and $p = AB$, $q = A'D'$ are its tangent lines. Discuss conditions of solvability with respect to different position of the point $P$ (on line $AA'$).

Let \( n \) be an odd integer, \( m = \frac{n+1}{2} \). Consider \( 2m \) integers \( a_1, a_2, \ldots, a_m, b_1, b_2, \ldots, b_m \) such that for any \( 1 \leq i < j \leq m \), \( a_i \not\equiv a_j \pmod{n} \) and \( b_i \not\equiv b_j \pmod{n} \). Prove that the number of \( k \in \{0, 1, \ldots, n-1\} \) for which satisfy \( a_i + b_j \equiv k \pmod{n} \) for some \( i \neq j \), $i, j \in \left \{ 1,2,\cdots,m \right \} $ is greater than \( n - \sqrt{n} - \frac{1}{2} \).

In a square $ABCD$ of diagonals $AC$ and $BD$, we call $O$ at the center of the square. A square $PQRS$ is constructed with sides parallel to those of $ABCD$ with $P$ in segment $AO, Q$ in segment $BO, R$ in segment $CO, S$ in segment $DO$. If area of $ABCD$ equals two times the area of $PQRS$, and $M$ is the midpoint of the $AB$ side, calculate the measure of the angle $\angle AMP$.

Nine points are given on a plane, no three of which lie on a line. Any two of these points are joined by a segment. Is it possible to color these segments by several colors in such a way that, for each color, there are exactly three segments of that color and these three segments form a triangle?

Let $n$ be a positive integer and $a=2^n\cdot 7^{n+1}+11$ and $b=2^{n+1}\cdot 7^n+3$. $a)$ Prove that fraction $\frac{a}{b}$ is irreducible $b)$ Prove that number $a+b-7$ is not a perfect square for any positive integer $n$

Four grasshoppers sit at the vertices of a square. Every second, one of them jumps over one of the others to the symmetrical point on the other side (if $X$ jumps over $Y$ to the point $X'$, then $X$, $Y$ and $X'$ lie on a straight line and $XY = YX'$). Prove that after several jumps no three grasshoppers can be: (a) on a line parallel to a side of the square, (b) on a straight line. (AK Kovaldzhy)

Given a function $f$ such that $f(x)\le x\forall x\in\mathbb{R}$ and $f(x+y)\le f(x)+f(y)\forall \{x,y\}\in\mathbb{R}$, prove that $f(x)=x\forall x\in\mathbb{R}$.

Emmy goes to buy radishes at the market. Radishes are sold in bundles of $3$ for $\$5$and bundles of $5$ for $\$7$. What is the least number of dollars Emmy needs to buy exactly $100$ radishes?

Simplify $\sqrt[4]{17 + 12\sqrt2} - \sqrt[4]{17 - 12\sqrt2}$.

The numbers $2,3,7$ have the property that the product of any two of them increased by $1$ is divisible by the third number. Prove that this triple of integer numbers greater than $1$ is the only triple with the given property.

Pentagon $ANDD'Y$ has $AN \parallel DY$ and $AY \parallel D'N$ with $AN = D'Y$ and $AY = DN$. If the area of $ANDY$ is 20, the area of $AND'Y$ is 24, and the area of $ADD'$ is 26, the area of $ANDD'Y$ can be expressed in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m+n$. [i]Proposed by Andy Xu[/i]

Let $n\ge 3$ be a positive integer. Danielle draws a math flower on the plane Cartesian as follows: first draw a unit circle centered on the origin, then draw a polygon of $n$ vertices with both rational coordinates on the circumference so that it has two diametrically opposite vertices, on each side draw a circumference that has the diameter of that side, and finally paints the area inside the $n$ small circles but outside the unit circle. If it is known that the painted area is rational, find all possible polygons drawn by Danielle.

Prove that for every two positive integers $a,b$ greater than $1$. there exists infinitly many $n$ such that the equation $\phi(a^n-1)=b^m-b^t$ can't hold for any positive integers $m,t$.

A perfect number, greater than $28$ is divisible by $7$. Prove that it is also divisible by $49$.

Find the maximum and minimum of the expression \[ \max(a_1, a_2) + \max(a_2, a_3), + \dots + \max(a_{n-1}, a_n) + \max(a_n, a_1), \] where $(a_1, a_2, \dots, a_n)$ runs over the set of permutations of $(1, 2, \dots, n)$.

In triangle $ABC$, $AB = 100$, $BC = 120$, and $CA = 140$. Points $D$ and $F$ lie on $\overline{BC}$ and $\overline{AB}$, respectively, such that $BD = 90$ and $AF = 60$. Point $E$ is an arbitrary point on $\overline{AC}$. Denote the intersection of $\overline{BE}$ and $\overline{CF}$ as $K$, the intersection of $\overline{AD}$ and $\overline{CF}$ as $L$, and the intersection of $\overline{AD}$ and $\overline{BE}$ as $M$. If $[KLM] = [AME] + [BKF] + [CLD]$, where $[X]$ denotes the area of region $X$, compute $CE$. [i]Proposed by Lewis Chen [/i]

Show that if $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{1}{a + b + c},$ then also \[\frac{1}{a^n} +\frac{1}{b^n} +\frac{1}{c^n} =\frac{1}{a^n + b^n + c^n},\] provided $n$ is an odd positive integer.