Let $\triangle ABC$ be an acute triangle, $H$ is its orthocenter. $\overrightarrow{AH},\overrightarrow{BH},\overrightarrow{CH}$ intersect $\triangle ABC$'s circumcircle at $A',B',C'$ respectively. Find the range (minimum value and the maximum upper bound) of $$\dfrac{AH}{AA'}+\dfrac{BH}{BB'}+\dfrac{CH}{CC'}$$

On a table with $25$ columns and $300$ rows, Kostya painted all its cells in three colors. Then, Lesha, looking at the table, for each row names one of the three colors and marks in that row all cells of that color (if there are no cells of that color in that row, he does nothing). After that, all columns that have at least a marked square will be deleted. Kostya wants to be left as few as possible columns in the table, and Lesha wants there to be as many as possible columns in the table. What is the largest number of columns Lesha can guarantee to leave?

Rank the [i]magnitudes[/i] of the average acceleration during the ten second interval. (A) $\text{I} > \text{II} > \text{III}$ (B) $\text{II} > \text{I} > \text{III}$ (C) $\text{III} > \text{II} > \text{I}$ (D) $\text{I} > \text{II = III}$ (E) $\text{I = II = III}$

In scalene $\triangle ABC$, $I$ is the incenter, $I_a$ is the $A$-excenter, $D$ is the midpoint of arc $BC$ of the circumcircle of $ABC$ not containing $A$, and $M$ is the midpoint of side $BC$. Extend ray $IM$ past $M$ to point $P$ such that $IM = MP$. Let $Q$ be the intersection of $DP$ and $MI_a$, and $R$ be the point on the line $MI_a$ such that $AR\parallel DP$. Given that $\frac{AI_a}{AI}=9$, the ratio $\frac{QM} {RI_a}$ can be expressed in the form $\frac{m}{n}$ for two relatively prime positive integers $m,n$. Compute $m+n$. [i]Ray Li.[/i] [hide="Clarifications"][list=1][*]"Arc $BC$ of the circumcircle" means "the arc with endpoints $B$ and $C$ not containing $A$".[/list][/hide]

In the triangle $ABC$ let $B'$ and $C'$ be the midpoints of the sides $AC$ and $AB$ respectively and $H$ the foot of the altitude passing through the vertex $A$. Prove that the circumcircles of the triangles $AB'C'$,$BC'H$, and $B'CH$ have a common point $I$ and that the line $HI$ passes through the midpoint of the segment $B'C'.$

In acute triangle $ABC$, let $D$, $E$, and $F$ be the feet of the altitudes from $A$, $B$, and $C$ respectively, and let $L$, $M$, and $N$ be the midpoints of $BC$, $CA$ and $AB$, respectively. Lines $DE$ and $NL$ intersect at $X$, lines $DF$ and $LM$ intersect at $Y$, and lines $XY$ and $BC$ intersect at $Z$. Find $\frac{ZB}{ZC}$ in terms of $AB$, $AC$, and $BC$.

The number $2024$ is written as the sum of not necessarily distinct two-digit numbers. What is the least number of two-digit numbers needed to write this sum? $\textbf{(A) }20\qquad\textbf{(B) }21\qquad\textbf{(C) }22\qquad\textbf{(D) }23\qquad\textbf{(E) }24$

Two wheels with fixed hubs, each having a mass of $1 \text{ kg}$, start from rest, and forces are applied as shown. Assume the hubs and spokes are massless, so that the rotational inertia is $I = mR^2$. In order to impart identical angular accelerations about their respective hubs, how large must $F_2$ be? [asy] pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw(circle((0,0),0.5)); draw((1, 0.5)--(0,0.5)--(0,-0.5),BeginArrow); draw((-0.5,0)--(0.5,0)); draw((-0.5*sqrt(2)/2, 0.5*sqrt(2)/2)--(0.5*sqrt(2)/2,-0.5*sqrt(2)/2)); draw((0.5*sqrt(2)/2, 0.5*sqrt(2)/2)--(-0.5*sqrt(2)/2,-0.5*sqrt(2)/2)); label("$R$ = 0.5 m", (0, -0.5),S); label("$F_1$ = 1 N",(1,0.5),N); draw(circle((3,0.5),1)); draw((4.5,1.5)--(3,1.5)--(3,-0.5),BeginArrow); draw((2,0.5)--(4,0.5)); draw((3-sqrt(2)/2, 0.5+sqrt(2)/2)--(3+sqrt(2)/2, 0.5-sqrt(2)/2)); draw((3+sqrt(2)/2, 0.5+sqrt(2)/2)--(3-sqrt(2)/2,0.5-sqrt(2)/2)); label("$F_2$", (4.5, 1.5), N); label("$R$ = 1 m",(3, -0.5),S); [/asy] $ \textbf{(A)}\ 0.25\text{ N}\qquad\textbf{(B)}\ 0.5\text{ N}\qquad\textbf{(C)}\ 1\text{ N}\qquad\textbf{(D)}\ 2\text{ N}\qquad\textbf{(E)}\ 4\text{ N} $

Let $ABC$ be an equilateral triangle. Let $P$ and $S$ be points on $AB$ and $AC$, respectively, and let $Q$ and $R$ be points on $BC$ such that $PQRS$ is a rectangle. If $PQ = \sqrt3 PS$ and the area of $PQRS$ is $28\sqrt3$, what is the length of $PC$?

Let $n$ be a positive integer and $a_1,a_2,...,a_{2n}$ be $2n$ distinct integers. Given that the equation $|x-a_1| |x-a_2| ... |x-a_{2n}| =(n!)^2$ has an integer solution $x = m$, find $m$ in terms of $a_1,a_2,...,a_{2n}$

The points $S$ lie on side $AB$, $T$ on side $BC$, and $U$ on side $CA$ of a triangle so that the following applies: $\overline{AS} : \overline{SB} = 1 : 2$, $\overline{BT} : \overline{TC} = 2 : 3$ and $\overline{CU} : \overline{UA} = 3 : 1$. Construct the triangle $ABC$ if only the points $S, T$ and $U$ are given.

The sequence $a_n (n\geq 1)$ of natural numbers is defined as $a_{n+1}=a_n+b_n,$ where $b_n$ is the number that has the same digits as $a_n$ but in the opposite order ($b_n$ can start with $0$). For example, if $a_1=180,$ then $a_2=261, a_3=423.$ a) Decide if $a_1$ can be chosen so that $a_7$ is prime. b) Decide if $a_1$ can be chosen so that $a_5$ is prime.

Solve the following system of equations in $\mathbb{R}$ where all square roots are non-negative: $ \begin{matrix} a - \sqrt{1-b^2} + \sqrt{1-c^2} = d \\ b - \sqrt{1-c^2} + \sqrt{1-d^2} = a \\ c - \sqrt{1-d^2} + \sqrt{1-a^2} = b \\ d - \sqrt{1-a^2} + \sqrt{1-b^2} = c \\ \end{matrix} $

Let $ k$ be an integer, $ k \geq 2$, and let $ p_{1},\ p_{2},\ \ldots,\ p_{k}$ be positive reals with $ p_{1} \plus{} p_{2} \plus{} \ldots \plus{} p_{k} \equal{} 1$. Suppose we have a collection $ \left(A_{1,1},\ A_{1,2},\ \ldots,\ A_{1,k}\right)$, $ \left(A_{2,1},\ A_{2,2},\ \ldots,\ A_{2,k}\right)$, $ \ldots$, $ \left(A_{m,1},\ A_{1,2},\ \ldots,\ A_{m,k}\right)$ of $ k$-tuples of finite sets satisfying the following two properties: (i) for every $ i$ and every $ j \neq j^{\prime}$, $ A_{i,j}\cap A_{i,j^{\prime}} \equal{} \emptyset$, and (ii) for every $ i\neq i^{\prime}$ there exist $ j\neq j^{\prime}$ for which $ A_{i,j} \cap A_{i^{\prime},j^{\prime}}\neq\emptyset$. Prove that \[ \sum_{b \equal{} 1}^{m}{\prod_{a \equal{} 1}^{k}{p_{a}^{|A_{b,a}|}}} \leq 1. \]

Let $R$ be the region consisting of the points $(x,y)$ of the cartesian plane satisfying both $|x|-|y| \leq 1$ and $|y| \leq 1$. Sketch the region $R$ and find its area.

How many of the following are equal to $x^x+x^x$ for all $x>0$? $\textbf{I:}\ 2x^x \qquad\textbf{II:}\ x^{2x} \qquad\textbf{III:}\ (2x)^x \qquad\textbf{IV:}\ (2x)^{2x}$ $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 $

Consider the sequence $ a_1\equal{}\frac{3}{2}, a_{n\plus{}1}\equal{}\frac{3a_n^2\plus{}4a_n\minus{}3}{4a_n^2}.$ $ (a)$ Prove that $ 1<a_n$ and $ a_{n\plus{}1}<a_n$ for all $ n$. $ (b)$ From $ (a)$ it follows that $ \displaystyle\lim_{n\to\infty}a_n$ exists. Find this limit. $ (c)$ Determine $ \displaystyle\lim_{n\to\infty}a_1a_2a_3...a_n$.

Let $\triangle ABC$ satisfy $AB = 17, AC = \frac{70}{3}$ and $BC = 19$. Let $I$ be the incenter of $\triangle ABC$ and $E$ be the excenter of $\triangle ABC$ opposite $A$. (Note: this means that the circle tangent to ray $AB$ beyond $B$, ray $AC$ beyond $C$, and side $BC$ is centered at $E$.) Suppose the circle with diameter $IE$ intersects $AB$ beyond $B$ at $D$. If $BD = \frac{a}{b}$ where $a, b$ are coprime positive integers, find $a + b$.

The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $ Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers. (Here, $ [x] $ is the largest integer not exceeding $ x $.)

Let $A$ be a $3 \times 9$ matrix. All elements of $A$ are positive integers. We call an $m\times n$ submatrix of $A$ "ox" if the sum of its elements is divisible by $10$, and we call an element of $A$ "carboxylic" if it is not an element of any "ox" submatrix. Find the largest possible number of "carboxylic" elements in $A$.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

Show that there is a multiple of $2^{1998}$ whose decimal representation consists only of the digits $1$ and $2$.

Let $m$ and $n$ be positive integers. Player $A$ has a field of $m \times n$, and player $B$ has a $1 \times n$ field (the first is the number of rows). On the first move, each player places on each square of his field white or black chip as he pleases. At each next on the move, each player can change the color of randomly chosen pieces on your field to the opposite, provided that in no row for this move will not change more than one chip (it is allowed not to change not a single chip). The moves are made in turn, player $A$ starts. Player $A$ wins if there is such a position that in the only row player $B$'s squares, from left to right, are the same as in some row of player's field $A$. Prove that player $A$ has the ability to win for any game of player $B$ if and only if $n <2m$.

A $2 \times 2$ square was cut out of a sheet of grid paper. Using only a ruler without divisions and without going beyond the square, divide the diagonal of the square into $6$ equal parts.

Find all positive integers $m$ such that there exist positive integers $a_1,a_2,\ldots,a_{1378}$ such that: \[ m=\sum_{k=1}^{1378}{\frac{k}{a_k}}. \]