Mater is confused and starts going around the track in the wrong direction. He can go around 7 times in an hour. Lightning and Chick start in the same place at Mater and at the same time, both going the correct direction. Lightning can go around 91 times per hour, while Chick can go around 84 times per hour. When Lightning passes Chick for the third time, how many times will he have passed Mater (if Lightning is passing Mater just as he passes Chick for the third time, count this as passing Mater)? [i]Proposed by Matthew Weiss

The points of space are coloured with five colours, with all colours being used. Prove that some plane contains four points of different colours.

Given a triangle $ABC$, with $I$ as its incenter and $\Gamma$ as its circumcircle, $AI$ intersects $\Gamma$ again at $D$. Let $E$ be a point on the arc $BDC$, and $F$ a point on the segment $BC$, such that $\angle BAF=\angle CAE < \dfrac12\angle BAC$. If $G$ is the midpoint of $IF$, prove that the meeting point of the lines $EI$ and $DG$ lies on $\Gamma$. [i]Proposed by Tai Wai Ming and Wang Chongli, Hong Kong[/i]

$P$ is a point inside the triangle $ABC$. The perpendicular distances from $P$ to the three sides have product $p$. Show that $p \le \frac{ 8 S^3}{27abc}$, where $S =$ area $ABC$ and $a, b, c$ are the sides. Prove a similar result for a tetrahedron.

In a two-dimensional cave with a parallel floor and ceiling, two stalactites of lengths $16$ and $36$ hang perpendicularly from the ceiling, while two stalagmites of heights $25$ and $49$ grow perpendicularly from the ground. If the tips of these four structures form the vertices of a square in some order, compute the height of the cave.

Find all pairs $(x, y)$ of positive rational numbers such that $x^{y}=y^{x}$.

Let $n > 1$ be an integer and let $a_1, a_2,... , a_n$ be $n$ different integers. Show that the polynomial $f(x) = (x -a_1)(x - a_2)\cdot ... \cdot (x -a_n) - 1$ is not divisible by any polynomial with integer coefficients and of degree greater than zero but less than $n$ and such that the highest power of $x$ has coefficient $1$.

Sequence $x_1 , x_2 , ..., $ with $x_1=20$ ; $x_2=12$ for all $n\geq 1$ such that $x_{n+2}=x_n+x_{n+1}+2\sqrt{x_{n}*x_{n+1}+121} $then prove that $x_{2013}$ is an integer number.

Let $A=\{1,2,\ldots,1997\}$ be a set. Find the samllest integer $k>1$ such that in each subset $M{}$ of $A{}$, which cointain $k{}$ elements, there is a multiple of the smallest element from $M{}$, different from itself.

In $\triangle ABC\ T$ is a point lies on the internal angle bisector of $B$. Let $\omega$ be circle with diameter $BT$. $\omega$ intersects with $BA$ and $BC$ at $P$ and $Q$,respectively. A circle passes through $A$ and tangent to $\omega$ at $P$ intersects with $AC$ again at $X$ . A circle passes through $B$ and tangent to $\omega$ at $Q$ intersects with $AC$ again at $Y$ . Prove that $TX=TY$

Let $ n,k$ be given positive integers satisfying $ k\le 2n \minus{} 1$. On a table tennis tournament $ 2n$ players take part, they play a total of $ k$ rounds match, each round is divided into $ n$ groups, each group two players match. The two players in different rounds can match on many occasions. Find the greatest positive integer $ m \equal{} f(n,k)$ such that no matter how the tournament processes, we always find $ m$ players each of pair of which didn't match each other.

In the vertexes of a regular $ 31$-gon there are written the numbers from $ 1$ to $ 31$, ordered increasingly, clockwise oriented. We are allowed to perform an operation which consists in taking any three vertexes, namely the ones who have written $ a$,$ b$, and $ c$ and change them into $ c$, $ a\minus{}\frac{1}{10}$ and $ b\plus{}\frac{1}{10}$ respectively ( $ a$ becomes $ c$, $ b$ becomes $ a\minus{}\frac{1}{10}$ and $ c$ turns into $ b\plus{}\frac{1}{10}$ Prove that after applying several operations we can reach the state in which the numbers in the vertexes are the numbers from $ 1$ to $ 31$, ordered increasingly,anti-clockwise oriented.

Several circles are drawn on the plane and all points of their meeting or touching are marked. May be that each circle contains exactly four marked points and exactly four marked points lie on each circle?

A $3 \times 7$ is covered without overlap by $3$ shapes of tiles: $2 \times 2$, $1 \times 4$, and $1 \times 1$, shown below. What is the minimum possible number of $1 \times 1$ tiles used? [center][img width=70]https://wiki-images.artofproblemsolving.com//e/ee/2024-AMC8-q7.png[/img][/center] $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

A parabola $y = ax^{2} + bx + c$ has vertex $(4,2)$. If $(2,0)$ is on the parabola, then $abc$ equals $ \textbf{(A)}\ -12\qquad\textbf{(B)}\ -6\qquad\textbf{(C)}\ 0\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 12$

Considers a quadrilateral $[ABCD]$ that has an inscribed circle and a circumscribed circle. The sides $[AD]$ and $[BC]$ are tangent to the circle inscribed at points $E$ and $F$, respectively. Prove that $AE \cdot F C = BF \cdot ED$. [img]https://1.bp.blogspot.com/-6o1fFTdZ69E/X4XMo98ndAI/AAAAAAAAMno/7FXiJnWzJgcfSn-qSRoEAFyE8VgxmeBjwCLcBGAsYHQ/s0/2005%2BPortugal%2Bp5.png[/img]

A positive integer $N$ is [i]apt[/i] if for each integer $0 < k < 1009$, there exists exactly one divisor of $N$ with a remainder of $k$ when divided by $1009$. For a prime $p$, suppose there exists an [i]apt[/i] positive integer $N$ where $\tfrac Np$ is an integer but $\tfrac N{p^2}$ is not. Find the number of possible remainders when $p$ is divided by $1009$. [i]Proposed by Evan Chang[/i]

In triangle $ABC$, $AB = 13$, $BC = 14$, and $CA = 15$. Let $M$ be the midpoint of side $AB$, $G$ be the centroid of $\triangle ABC$, and $E$ be the foot of the altitude from $A$ to $BC$. Compute the area of quadrilateral $GAME$. [i]Proposed by Evin Liang[/i] [hide=Solution][i]Solution[/i]. $\boxed{23}$ Use coordinates with $A = (0,12)$, $B = (5,0)$, and $C = (-9,0)$. Then $M = \left(\dfrac{5}{2},6\right)$ and $E = (0,0)$. By shoelace, the area of $GAME$ is $\boxed{23}$.[/hide]

On a line $\ell$ there exists $3$ points $A, B$, and $C$ where $B$ is located between $A$ and $C$. Let $\Gamma_1, \Gamma_2, \Gamma_3$ be circles with $AC, AB$, and $BC$ as diameter respectively; $BD$ is a segment, perpendicular to $\ell$ with $D$ on $\Gamma_1$. Circles $\Gamma_4, \Gamma_5, \Gamma_6$ and $\Gamma_7$ satisfies the following conditions: $\bullet$ $\Gamma_4$ touches $\Gamma_1, \Gamma_2$, and$ BD$. $\bullet$ $\Gamma_5$ touches $\Gamma_1, \Gamma_3$, and $BD$. $\bullet$ $\Gamma_6$ touches $\Gamma_1$ internally, and touches $\Gamma_2$ and $\Gamma_3$ externally. $\bullet$ $\Gamma_7$ passes through $B$ and the tangent points of $\Gamma_2$ with $\Gamma_6$, and $\Gamma_3$ with $\Gamma_6$. Show that the circles $\Gamma_4, \Gamma_5$, and $\Gamma_7$ are congruent.

$a$, $b$ and $c$ are positive integers with $\textrm{gcd}(a,b,c)=1$. Is it true that there exist a positive integer $n$ such that $a^k+b^k+c^k$ is not divisible by $2^n$ for all $k$?

Find the sum of all positive integers $n$ such that $\tau(n)^2=2n$, where $\tau(n)$ is the number of positive integers dividing $n$. [i]Proposed by Michael Kural[/i]

Let $ f(x)\equal{}\left(1\plus{}\frac{1}{x}\right)^{x}\ (x>0)$. Find $ \lim_{n\to\infty}\left\{f\left(\frac{1}{n}\right)f\left(\frac{2}{n}\right)f\left(\frac{3}{n}\right)\cdots\cdots f\left(\frac{n}{n}\right)\right\}^{\frac{1}{n}}$.

Consider a $\triangle {ABC}$, with $AC \perp BC$. Consider a point $D$ on $AB$ such that $CD=k$, and the radius of the inscribe circles on $\triangle {ADC}$ and $\triangle {CDB}$ are equals. Prove that the area of $\triangle {ABC}$ is equal to $k^2$.

A prime $p$ has decimal digits $p_{n}p_{n-1} \cdots p_0$ with $p_{n}>1$. Show that the polynomial $p_{n}x^{n} + p_{n-1}x^{n-1}+\cdots+ p_{1}x + p_0$ cannot be represented as a product of two nonconstant polynomials with integer coefficients

On a $24$ hour clock, there are two times after $01:00$ for which the time expressed in the form $hh:mm$ and in minutes are both perfect squares. One of these times is $01:21$, since $121$ and $60+21 = 81$ are both perfect squares. Find the other time, expressed in the form $hh:mm$.