Let $p$ be an odd prime number. Around a circular table, $p$ students sit. We give $p$ pieces of candy to those students in the following manner. The first candy we give to an arbitrary student. Then, going around clockwise, we skip two students and give the next student a piece of candy, then we skip 4 students and give another piece of candy to the next student... In general in the $k-$th turn we skip $2k$ students and give the next student a piece of candy. We do this until we don't give out all $p$ pieces of candy. $a)$ How many students won't get any pieces of candy? $b)$ How many pairs of neighboring students (those students who sit next to each other on the table) both got at least a piece of candy?

Let $P(x) = x^{16}-x^{15}+·...-x+ 1$, and let p be a prime such that $p-1$ is divisible by $34$ ($p = 103$ is an example). How many integers a between $1$ and $ p-1$ inclusive satisfy the property that $P(a)$ is divisible by $p$?

Prove that there exists a number $\alpha$ such that for any triangle $ABC$ the inequality \[ \max(h_A,h_B,h_C)\le \alpha\cdot\min(m_A,m_B,m_C)\] where $h_A,h_B,h_C$ denote the lengths of the altitudes and $m_A,m_B,m_C$ denote the lengths of the medians. Find the smallest possible value of $\alpha$.

Let $ a $ and $ b $ be different real numbers. Prove that for any real numbers $ c_1, c_2, \ldots,c_n $ there exists a sequence of $ n $-elements $ (x_i) $, each term of which is equal to one of the numbers $ a $ or $ b $ such that $$ |x_1c_1 + x_2c_2 + \ldots + x_nc_n| \geq \frac{|b-a|}{2}(|c_1|+|c_2|+\ldots+|c_n|).$$

$ \odot O_1$ and $ \odot O_2$ meet at points $ P$ and $ Q$. The circle through $ P$, $ O_1$ and $ O_2$ meets $ \odot O_1$ and $ \odot O_2$ at points $ A$ and $ B$. Prove that the distance from $ Q$ to the lines $ PA$, $ PB$ and $ AB$ are equal. (Prove the following three cases: $ O_1$ and $ O_2$ are in the common space of $ \odot O_1$ and $ \odot O_2$; $ O_1$ and $ O_2$ are out of the common space of $ \odot O_1$ and $ \odot O_2$; $ O_1$ is in the common space of $ \odot O_1$ and $ \odot O_2$, $ O_2$ is out of the common space of $ \odot O_1$ and $ \odot O_2$.

Let $F=.48181\cdots$ be an infinite repeating decimal with the digits $8$ and $1$ repeating. When $F$ is written as a fraction in lowest terms, the denominator exceeds the numerator by $\textbf{(A) }13\qquad\textbf{(B) }14\qquad\textbf{(C) }29\qquad\textbf{(D) }57\qquad \textbf{(E) }126$

Let triangle $ABC$ be perpendicular at $A.$ Let $M$ be the midpoint of segment $\overline{BC}.$ Point $D$ lies on side $\overline{AC}$ and satisfies $|AD|=|AM|.$ Let $P \neq C$ be the intersection of the circumcircle of triangles $AMC$ and $BDC.$ Prove that $CP$ bisects the angle at $C$ of triangle $ABC.$

Let $X_0$ be the interior of a triangle with side lengths $3, 4,$ and $5$. For all positive integers $n$, define $X_n$ to be the set of points within $1$ unit of some point in $X_{n-1}$. The area of the region outside $X_{20}$ but inside $X_{21}$ can be written as $a\pi + b$, for integers $a$ and $b$. Compute $100a + b$.

Find all functions $ f: \mathbb{Z} \to \mathbb{Z} $ such that $$ f\left(x+f\left(y\right)\right)f\left(y+f\left(x\right)\right)=\left(2x+f\left(y-x\right)\right)\left(2y+f\left(x-y\right)\right) $$ holds for all integers $ x,y $

Find all monotonically increasing or monotonically decreasing functions $f: \mathbb{R}_+\to\mathbb{R}_+$ which satisfy the equation $f\left(xy\right)\cdot f\left(\frac{f\left(y\right)}{x}\right)=1$ for any two numbers $x$ and $y$ from $\mathbb{R}_+$. Hereby, $\mathbb{R}_+$ is the set of all positive real numbers. [i]Note.[/i] A function $f: \mathbb{R}_+\to\mathbb{R}_+$ is called [i]monotonically increasing[/i] if for any two positive numbers $x$ and $y$ such that $x\geq y$, we have $f\left(x\right)\geq f\left(y\right)$. A function $f: \mathbb{R}_+\to\mathbb{R}_+$ is called [i]monotonically decreasing[/i] if for any two positive numbers $x$ and $y$ such that $x\geq y$, we have $f\left(x\right)\leq f\left(y\right)$.

(a) Positive integers $p,q,r,a$ satisfy $pq=ra^2$, where $r$ is prime and $p,q$ are relatively prime. Prove that one of the numbers $p,q$ is a perfect square. (b) Examine if there exists a prime $p$ such that $p(2^{p+1}-1)$ is a perfect square.

Find the smallest real number $p(\leq 1)$ that satisfies the following condition. (Condition) For real numbers $x_1, x_2, \dots, x_{2024}, y_1, y_2, \dots, y_{2024}$, if [list] [*] $0 \leq x_1 \leq x_2 \leq \dots \leq x_{2024} \leq 1$, [*] $0 \leq y_1 \leq y_2 \leq \dots \leq y_{2024} \leq 1$, [*] $\displaystyle \sum_{i=1}^{2024}x_i = \displaystyle \sum_{i=1}^{2024}y_i = 2024p$, [/list] then the inequality $\displaystyle \sum_{i=1}^{2024}x_i(y_{2025-i}-y_{2024-i}) \geq 1 - p$ holds.

In the triangle $ABC$ its incircle with center $I$ touches its sides $BC, CA$ and $AB$ in the points $A_1, B_1, C_1$ respectively. Through $I$ is drawn a line $\ell$. The points $A', B'$ and $C'$ are reflections of $A_1, B_1, C_1$ with respect to the line $\ell$. Prove that the lines $AA', BB'$ and $CC'$ intersects at a common point.

A solid cube has side length $ 3$ inches. A $ 2$-inch by $ 2$-inch square hole is cut into the center of each face. The edges of each cut are parallel to the edges of the cube, and each hole goes all the way through the cube. What is the volume, in cubic inches, of the remaining solid? $ \textbf{(A)}\ 7\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ 12\qquad \textbf{(E)}\ 15$

There are $11$ points equally spaced on a circle. Some of the segments having endpoints among these vertices are drawn and colored in two colors, so that each segment meets at an internal for it point at most one other segment from the same color. What is the greatest number of segments that could be drawn?

$[BD]$ is a median of $\triangle ABC$. $m(\widehat{ABD})=90^\circ$, $|AB|=2$, and $|AC|=6$. $|BC|=?$ $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 3\sqrt2 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 4\sqrt2 \qquad\textbf{(E)}\ 2\sqrt6 $

In the simple and connected graph $G$ let $x_i$ be the number of vertices with degree $i$. Let $d>3$ be the biggest degree in the graph $G$. Prove that if : $$x_d \ge x_{d-1} + 2x_{d-2}+... +(d-1)x_1$$ Then there exists a vertex with degree $d$ such that after removing that vertex the graph $G$ is still connected. Proposed by [i]Ali Mirzaie[/i]

Let $k$ be a fixed positive integer. For each $n = 1, 2,...,$ we will call [i]configuration [/i] of order $n$ any set of $kn$ points of the plane, which does not contain $3$ collinear, colored with $k$ given colors, so that there are $n$ points of each color. Determine all positive integers $n$ with the following property: in each configuration of order $n$, it is possible to select three points of each color, such that the $k$ triangles with vertices of the same color that are determined are disjoint in pairs.

A $6$ meter ladder rests against a vertical wall. The midpoint of the ladder is twice as far from the ground as it is from the wall. At what height on the wall does the ladder reach?

Find the greatest possible distance between any two points inside or along the perimeter of an equilateral triangle with side length $2$. [i]Proposed by Alex Li[/i]

If $ n$ runs through all the positive integers, then $ f(n) \equal{} \left \lfloor n \plus{} \sqrt {3n} \plus{} \frac {1}{2} \right \rfloor$ runs through all positive integers skipping the terms of the sequence $ a_n \equal{} \left \lfloor \frac {n^2 \plus{} 2n}{3} \right \rfloor$.

Given any integer $n\geq 3$. A finite series is called $n$-series if it satisfies the following two conditions $1)$ It has at least $3$ terms and each term of it belongs to $\{ 1,2,...,n\}$ $2)$ If series has $m$ terms $a_1,a_2,...,a_m$ then $(a_{k+1}-a_k)(a_{k+2}-a_k)<0$ for all $k=1,2,...,m-2$ How many $n$-series are there $?$

Five pairs of twins are randomly arranged around a circle. Then they perform zero or more swaps, where each swap switches the positions of two adjacent people. They want to reach a state where no one is adjacent to their twin. Compute the expected value of the smallest number of swaps needed to reach such a state.

Let $n$, $d$ be positive integers such that $d>\frac{n}{2}$. Suppose $a_1, a_2,\cdots,a_{d+2}$ is a sequence of integers satisfying $a_{d+1}=a_1$, $a_{d+2}=a_2$, and for all indices $1\le i_1<i_2<\cdots <i_s\le d$, $$a_{i_1}+a_{i_2}+\cdots+a_{i_s}\not\equiv 0\pmod n$$ Prove that there exists $1\le i\le d$ such that $$a_{i+1}\equiv a_i \pmod n \quad \text{or} \quad a_{i+1}\equiv a_i+a_{i+2} \pmod n$$ [i]Proposed by Yeoh Zi Song[/i]

Alice and Bob play the following game. They alternate selecting distinct nonzero digits (from $1$ to $9$) until they have chosen seven such digits, and then consider the resulting seven-digit number by concatenating the digits in the order selected, with the seventh digit appearing last (i.e. $\overline{A_1B_2A_3B_4A_6B_6A_7}$). Alice wins if and only if the resulting number is the last seven decimal digits of some perfect seventh power. Please determine which player has the winning strategy.