Let \(A\) be a square matrix with entries in the field \(\mathbb Z / p \mathbb Z\) such that \(A^n - I\) is invertible for every positive integer \(n\). Prove that there exists a positive integer \(m\) such that \(A^m = 0\). [i](A matrix having entries in the field \(\mathbb Z / p \mathbb Z\) means that two matrices are considered the same if each pair of corresponding entries differ by a multiple of \(p\).)[/i] [i]Proposed by Tony Wang[/i]

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.

Find the largest positive constant $C$ such that the following is satisfied: Given $n$ arcs (containing their endpoints) $A_1,A_2,\ldots ,A_n$ on the circumference of a circle, where among all sets of three arcs $(A_i,A_j,A_k)$ $(1\le i< j< k\le n)$, at least half of them has $A_i\cap A_j\cap A_k$ nonempty, then there exists $l>Cn$, such that we can choose $l$ arcs among $A_1,A_2,\ldots ,A_n$, whose intersection is nonempty.

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

In a circle of radius $10$, three congruent chords bound an equilateral triangle with side length $8$. The endpoints of these chords form a convex hexagon. Compute the area of this hexagon.

Let $a,b,c$ be positive reals satisfying $a+b+c = \sqrt[7]{a} + \sqrt[7]{b} + \sqrt[7]{c}$. Prove that $a^a b^b c^c \ge 1$. [i]Proposed by Evan Chen[/i]

For a prime $ p\ge 5, $ determine the number of polynomials $ X^p+pX^k+pX^l+1 $ with $ 1<k<l<p, $ that are ireducible over the integers.

In the star shaped figure below, if all side lengths are equal to $3$ and the three largest angles of the figure are $210$ degrees, its area can be expressed as $\frac{a \sqrt{b}}{c}$ , where $a, b$, and $c$ are positive integers such that $a$ and $c$ are relatively prime and that $b$ is square-free. Compute $a + b + c$. [img]https://cdn.artofproblemsolving.com/attachments/a/f/d16a78317b0298d6894c6bd62fbcd1a5894306.png[/img]

Determine whether exist a prime number $p$ and natural number $n$ such that $n^2 + n + p = 1996$.

p1. If $x + y + z = 2$, show that $\frac{1}{xy+z-1}+\frac{1}{yz+x-1}+\frac{1}{xz+y-1}=\frac{-1}{(x-1)(y-1)(z-1)}$. p2. Determine the simplest form of $\frac{3}{1!+2!+3!}+\frac{4}{2!+3!+4!}+\frac{5}{3!+4!+5!}+...+\frac{100}{98!+99!+100!}$ p3. It is known that $ABCD$ and $DEFG$ are two parallelograms. Point $E$ lies on $AB$ and point $C$ lie on $FG$. The area of $​​ABCD$ is $20$ units. $H$ is the point on $DG$ so that $EH$ is perpendicular to $DG$. If the length of $DG$ is $5$ units, determine the length of $EH$. [img]https://cdn.artofproblemsolving.com/attachments/b/e/42453bf6768129ed84fbdc81ab7235e780b0e1.png[/img] p4. Each room in the following picture will be painted so that every two rooms which is directly connected to the door is given a different color. If $10$ different colors are provided and $4$ of them can not be used close together for two rooms that are directly connected with a door, determine how many different ways to color the $4$ rooms. [img]https://cdn.artofproblemsolving.com/attachments/4/a/e80a464a282b3fe3cdadde832b2fd38b51a41a.png[/img] 5. The floor of a hall is rectangular $ABCD$ with $AB = 30$ meters and $BC = 15$ meters. A cat is in position $A$. Seeing the cat, the mouse in the midpoint of $AB$ ran and tried to escape from cat. The mouse runs from its place to point $C$ at a speed of $3$ meters/second. The trajectory is a straight line. Watching the mice run away, at the same time from point $A$ the cat is chasing with a speed of $5$ meters/second. If the cat's path is also a straight line and the mouse caught before in $C$, determine an equation that can be used for determine the position and time the mouse was caught by the cat.

\[\int_0^{2\pi} \frac{1}{3+2 \sqrt{3} \cos x + \cos^2 x}\mathrm dx\] [i]Proposed by Robert Trosten[/i]

Compute the remainder when $98!$ is divided by $101$.

Let $n$ be a natural composite number. Prove that there are integers $a_1, a_2,. . . , a_k$ all greater than $ 1$, such that $$a_1 + a_2 +... + a_k = n \left(\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}\right)$$

Call a positive integer [i]monotonous[/i] if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, 3, 23578, and 987620 are monotonous, but 88, 7434, and 23557 are not. How many monotonous positive integers are there? $\textbf{(A)} \text{ 1024} \qquad \textbf{(B)} \text{ 1524} \qquad \textbf{(C)} \text{ 1533} \qquad \textbf{(D)} \text{ 1536} \qquad \textbf{(E)} \text{ 2048}$

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

Prove that in any described $8$-gon there is a side that does not exceed the diameter of the inscribed circle in length. [i]P.A.Kozhevnikov[/i]

For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.

The set of points in $3$-dimensional coordinate space that lie in the plane $x+y+z=75$ whose coordinates satisfy the inequalities $$x-yz<y-zx<z-xy$$forms three disjoint convex regions. Exactly one of those regions has finite area. The area of this finite region can be expressed in the form $a\sqrt{b},$ where $a$ and $b$ are positive integers and $b$ is not divisible by the square of any prime. Find $a+b.$

Define \[ S = \tan^{-1}(2020) + \sum_{j = 0}^{2020} \tan^{-1}(j^2 - j + 1). \] Then $S$ can be written as $\frac{m \pi}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Construct a set of $k$ integer weights that allows you to get any total integer weight from $1$ up to $55$ grams even if some of the weights of the set are lost. Consider two versions: (a) $k = 10$, and any one of the weights may be lost; (b) $k = 12$, and any two of the weights may be lost. (D Zvonkin) (In both cases prove that the set found has the property required.)

The plane $\alpha$ intersects the edges $AB$, $BC$, $CD$ and $DA$ of the tetrahedron $ABCD$ at points $X, Y, Z$ and $T$, respectively. It turned out, that points $Y$ and $T$ lie on a circle $\omega$ constructed with segment $XZ$ as the diameter. Point $P$ is marked in the plane $\alpha$ so that the lines $P Y$ and $P T$ are tangent to the circle $\omega$.Prove that the midpoints of the edges are $AB$, $BC$, $CD,$ $DA$ and the point $P$ lie in the same plane.

Find the flux of the vector field $\overrightarrow{r}/r^3$ through the surface \[(x-1)^2+y^2+z^2=2\]

Let $ABCD$ be a quadrilateral, let $O$ be the intersection point of diagonals $AC$ and $BD$, and let $P$ be the intersection point of sides $AB$ and $CD$. Consider the parallelograms $AODE$ and $BOCF$. Prove that $E, F$ and $P$ are collinear.

Solve the system of equation for $(x,y) \in \mathbb{R}$ $$\left\{\begin{matrix} \sqrt{x^2+y^2}+\sqrt{(x-4)^2+(y-3)^2}=5\\ 3x^2+4xy=24 \end{matrix}\right.$$ \\ Explain your answer

In a drawer, there are at most $ 2009$ balls, some of them are white, the rest are blue, which are randomly distributed. If two balls were taken at the same time, then the probability that the balls are both blue or both white is $ \frac12$. Determine the maximum amount of white balls in the drawer, such that the probability statement is true?