Consider a convex polyhedron $P$ with vertices $V_1,\ldots ,V_p$. The distinct vertices $V_i$ and $V_j$ are called [i]neighbours[/i] if they belong to the same face of the polyhedron. To each vertex $V_k$ we assign a number $v_k(0)$, and construct inductively the sequence $v_k(n)\ (n\ge 0)$ as follows: $v_k(n+1)$ is the average of the $v_j(n)$ for all neighbours $V_j$ of $V_k$ . If all numbers $v_k(n)$ are integers, prove that there exists the positive integer $N$ such that all $v_k(n)$ are equal for $n\ge N$ .

Find all triples $(a,b,c)$ of positive integers such that (i) $a \leq b \leq c$; (ii) $\text{gcd}(a,b,c)=1$; and (iii) $a^3+b^3+c^3$ is divisible by each of the numbers $a^2b, b^2c, c^2a$.

The Cincinnati Reals are playing the Houston Alphas in the last game of the Swirled Series. The Alphas are leading by $1$ run in the bottom of the $9\text{th}$ (last) inning, and the Reals are at bat. Each batter has a $\dfrac{1}{3}$ chance of hitting a single and a $\dfrac{2}{3}$ chance of making an out. If the Reals hit $5$ or more singles before they make $3$ outs, they will win. If the Reals hit exactly $4$ singles before they make $3$ outs, they will tie the game and send it into extra innings, and they will have a $\dfrac{3}{5}$ chance of eventually winning the game (since they have the added momentum of coming from behind). If the Reals hit fewer than $4$ singles, they will LOSE! What is the probability that the Alphas hold off the Reals and win, sending the packed Alphadome into a frenzy? Express the answer as a fraction.

A point is picked uniformly at random inside of a square. Four segments are then drawn in connecting the point to each of the vertices of the square, cutting the square into four triangles. What is the probability that at least two of the resulting triangles are obtuse?

Let $MATH$ be a trapezoid with $MA=AT=TH=5$ and $MH=11$. Point $S$ is the orthocenter of $\triangle ATH$. Compute the area of quadrilateral $MASH$.

Assume the $n$ sets $A_1, A_2..., A_n$ are a partition of the set $A=\{1,2,...,29\}$, and the sum of any elements in $A_i$ , $(i=1,2,...,n)$ is not equal to $30$. Find the smallest possible value of $n$.

Let $ABC$ be an acute-angled triangle, and let $D, E$ and $K$ be the midpoints of its sides $AB, AC$ and $BC$ respectively. Let $O$ be the circumcentre of triangle $ABC$, and let $M$ be the foot of the perpendicular from $A$ on the line $BC$. From the midpoint $P$ of $OM$ we draw a line parallel to $AM$, which meets the lines $DE$ and $OA$ at the points $T$ and $Z$ respectively. Prove that: (a) the triangle $DZE$ is isosceles (b) the area of the triangle $DZE$ is given by the formula \[E_{DZE}=\frac{BC\cdot OK}{8}\]

Given is a $K_{2024}$ in which every edge has weight $1$ or $2$. If every cycle has even total weight, find the minimal value of the sum of all weights in the graph.

Let $ABC$ be a triangle with $AB = 16$, $AC = 10$, $BC = 18$. Let $D$ be a point on $AB$ such that $4AD = AB$ and let E be the foot of the angle bisector from $B$ onto $AC$. Let $P$ be the intersection of $CD$ and $BE$. Find the area of the quadrilateral $ADPE$.

Let $S \subset Z^+$ be a set of positive integers with the following property: for any $a, b \in S$, if $a \ne b$ then $a + b$ is a perfect square. Given that $2009 \in S$ and $2087 \in S$, what is the maximum number of elements in $S$?

Let $\omega$ be the circumcircle of triangle $ABC$. Tangent lines to $\omega$ at points $A$ and $C$ intersect at $K$. Line $BK$ intersects $\omega$ for the second time at $M$. On the line $BC$ point $N$ is chosen such that $\angle BAN = 90$. Line $MN$ intersects $\omega$ for the second time at $D$. Prove that $BD=BC$ [i]P. Chernikova[/i]

Let $a,b,c\ge0$. Show that $(a^2+2bc)^{2012}+(b^2+2ca)^{2012}+(c^2+2ab)^{2012}\le (a^2+b^2+c^2)^{2012}+2(ab+bc+ca)^{2012}$. [i]Calvin Deng.[/i]

Point $P$ is taken on the extension of side $AB$ of an equilateral triangle $ABC$ so that $A$ is between $B$ and $P$. Denote by $a$ the side length of triangle $ABC$, by $r_1$ the inradius of triangle $PAC$, and by $r_2$ the exradius of triangle $PBC$ opposite $P$. Find the sum $r_1+r_2$ as a function in $a$.

How many diagonals does $11$-sided convex polygon have?

Let $I\subseteq \mathbb{R}$ be an interval and $f:I\rightarrow\mathbb{R}$ a function such that: \[|f(x)-f(y)|\le |x-y|,\quad\text{for all}\ x,y\in I. \] Show that $f$ is monotonic on $I$ if and only if, for any $x,y\in I$, either $f(x)\le f\left(\frac{x+y}{2}\right)\le f(y)$ or $f(y)\le f\left(\frac{x+y}{2}\right)\le f(x)$.

Positive integers $a,b,c$ satisfy that $a+b=b(a-c)$ and c+1 is a square of a prime. Prove that $a+b$ or $ab$ is a square.

Let $n$ a positive integer. We call a pair $(\pi ,C)$ composed by a permutation $\pi$$:$ {$1,2,...n$}$\rightarrow${$1,2,...,n$} and a binary function $C:$ {$1,2,...,n$}$\rightarrow${$0,1$} "revengeful" if it satisfies the two following conditions: $1)$For every $i$ $\in$ {$1,2,...,n$}, there exist $j$ $\in$ $S_{i}=${$i, \pi(i),\pi(\pi(i)),...$} such that $C(j)=1$. $2)$ If $C(k)=1$, then $k$ is one of the $v_{2}(|S_{k}|)+1$ highest elements of $S_{k}$, where $v_{2}(t)$ is the highest nonnegative integer such that $2^{v_{2}(t)}$ divides $t$, for every positive integer $t$. Let $V$ the number of revengeful pairs and $P$ the number of partitions of $n$ with all parts powers of $2$. Determine $\frac{V}{P}$.

Three members of the Euclid Middle School girls' softball team had the following conversation. Ashley: I just realized that our uniform numbers are all $2$-digit primes. Bethany: And the sum of your two uniform numbers is the date of my birthday earlier this month. Caitlin: That's funny. The sum of your two uniform numbers is the date of my birthday later this month. Ashley: And the sum of you two uniform numbers is today's date. What number does Caitlin wear? $\textbf{(A) }11\qquad\textbf{(B) }13\qquad\textbf{(C) }17\qquad\textbf{(D) }19\qquad \textbf{(E) }23$

There are $12$ monsters in a plane. Each monster is capable of spraying fire in a $30$-degree cone. Prove that monsters can destroy the plane.

Find all $x$ and $y$ which are rational multiples of $\pi$ with $0<x<y<\frac{\pi}{2}$ and $\tan x+\tan y =2$.

$p$ passengers get on a train with $n$ wagons. Find the probability of being at least one passenger at each wagon.

A triangle $OAB$ with $\angle A=90^{\circ}$ lies inside another triangle with vertex $O$. The altitude of $OAB$ from $A$ until it meets the side of angle $O$ at $M$. The distances from $M$ and $B$ to the second side of angle $O$ are $2$ and $1$ respectively. Find the length of $OA$.

Let $\displaystyle{A}$ and $\displaystyle{B}$ be real symmetric matrixes with all eigenvalues strictly greater than $\displaystyle{1}$. Let $\displaystyle{\lambda }$ be a real eigenvalue of matrix $\displaystyle{{\rm A}{\rm B}}$. Prove that $\displaystyle{\left| \lambda \right| > 1}$. [i]Proposed by Pavel Kozhevnikov, MIPT, Moscow.[/i]

We call a permutation of the numbers $1$, $2$, $3$, $\dots$ , $n$ 'kawaii' if there is exactly one number that is greater than its position. For example: $1$, $4$, $3$, $2$ is a kawaii permutation (when $n=4$) because only the number $4$ is greater than its position $2$. How many kawaii permutations are there if $n=14$?

There are 1000 towns $A_{1},A_{2},\ldots ,A_{1000}$ with airports in a country and some of them are connected via flights. It's known that the $i$-th town is connected with $d_{i}$ other towns where $d_{1}\leq d_{2}\leq \ldots \leq d_{1000}$ and $d_{j}\geq j+1$ for every $j=1,2,\ldots 999-d_{999}$. Prove that if the airport of any town $A_{k}$ is closed, then we'd still be able to get from any town $A_{i}$ to any $A_{j}$ for $i,j\neq k$ (possibly by more than one flight).