$p$ is an odd prime number. Find all $\frac{p-1}2$-tuples $\left(x_1,x_2,\dots,x_{\frac{p-1}2}\right)\in \mathbb{Z}_p^{\frac{p-1}2}$ such that $$\sum_{i = 1}^{\frac{p-1}{2}} x_{i} \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{2} \equiv \cdots \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{\frac{p - 1}{2}} \pmod p.$$ [i]Proposed by Ali Partofard[/i]

A set of $2003$ positive numbers is such that for any two numbers $a$ and $b$ included in it ($a > b$) at least one of the numbers $a + b$ or $a - b$ also included in the set. Prove that if these numbers are ordered by increasing, then the differences between adjacent numbers will be the same.

A polygon is [b]gridded[/b] if the internal angles of the polygon are either $90$ or $270$, it has integer side lengths and its sides don't intersect with each other. Prove that for all $n \ge 8$, it exist a gridded polygon with area $2n$ and perimeter $2n$.

For which real numbers $x$ and $\alpha$ inequality holds: $$\log _2 {x}+\log _x {2}+2\cos{\alpha} \leq 0$$

Find all real solutions of the system: $ x^2\plus{}2yz\equal{}x,$ $ y^2\plus{}2zx\equal{}y,$ $ z^2\plus{}2xy\equal{}z.$

Rodolfo and Gabriela have $9$ chips numbered from $1$ to $9$ and they have fun with the following game: They remove the chips one by one and alternately (until they have $3$ chips each), with the following rules: $\bullet$ Rodolfo begins the game, choosing a chip and in the following moves he must remove, each time, a chip three units greater than the last chip drawn by Gabriela. $\bullet$ Gabriela, on her turn, chooses a first chip and in the following times she must draw, each time, a chip two units smaller than the last chip that she herself drew. $\bullet$ The game is won by whoever gets the highest number by adding up their three tokens. $\bullet$ If the game cannot be completed, a tie is declared. If they play without making mistakes, how should Rodolfo play to be sure he doesn't lose?

An integer $a$ is a quadratic nonresidue modulo a prime $p$ if there does not exist $x \in Z$ such that $x^2 \equiv a$ (mod $p$). How many ordered pairs $(a, b)$ modulo $29$ exist such that $$a + b\equiv 1 \,\,\, (mod \,\,\, 29)$$ where both $a$ and $b$ are quadratic nonresidues modulo $29$?

In $\triangle ABC$, $AB = 8$, $BC = 7$, $CA = 6$ and side $BC$ is extended, as shown in the figure, to a point $P$ so that $\triangle PAB$ is similar to $\triangle PCA$. The length of $PC$ is [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, P=(1.5,5), B=(8,0), C=P+2.5*dir(P--B); draw(A--P--C--A--B--C); label("$A$", A, W); label("$B$", B, E); label("$C$", C, NE); label("$P$", P, NW); label("$6$", 3*dir(A--C), SE); label("$7$", B+3*dir(B--C), NE); label("$8$", (4,0), S);[/asy] $ \textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$

Find all real numbers $a$ such that there exist $f:\mathbb{R} \to \mathbb{R}$ with $$f(x-f(y))=f(x)+a[y]$$ for all $x,y\in \mathbb{R}$

Consider a tree with $n$ vertices, labeled with $1,\ldots,n$ in a way that no label is used twice. We change the labeling in the following way - each time we pick an edge that hasn't been picked before and swap the labels of its endpoints. After performing this action $n-1$ times, we get another tree with its labeling a permutation of the first graph's labeling. Prove that this permutation contains exactly one cycle.

$100$ students came to a party. The students who did not have friends among other students left the party first. Then those with one friend among remaining students left. Then those with $2,3, \ldots 99$ friends among remaining students left. What is the maximal number of students that can still remain at the party after that? (If $A$ is a friend of $B$, then $B$ is a friend of $A$).

Two angles are supplementary, and one angle is $9$ times as large as the other. What is the number of degrees in the measure of the larger angle?

A sequence $(a_n)^{\infty}_0$ of real numbers is called [i]convex[/i] if $2a_n\le a_{n-1}+a_{n+1}$ for all positive integers $n$. Let $(b_n)^{\infty}_0$ be a sequence of positive numbers and assume that the sequence $(\alpha^nb_n)^{\infty}_0$ is convex for any choice of $\alpha > 0$. Prove that the sequence $(\log b_n)^{\infty}_0$ is convex.

If $f(x) = x^{x^{x^x}}$ , find the last two digits of $f(17) + f(18) + f(19) + f(20)$.

Let $P$ be a polynomial of degree $n$ satisfying \[P(k) = \binom{n+1}{k}^{-1} \qquad \text{ for } k = 0, 1, . . ., n.\] Determine $P(n + 1).$

Find the number of real numbers $x$ that satisfy the equation $(3^x)^{x+2} + (4^x)^{x+2} - (6^x)^{x+2} = 1$

Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that (1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$; (2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees; (3) for any integers $ x, |f(x)|$ isn't prime numbers.

Let a; b; c be positive integers. Prove that $$ \frac{(b+c-a)^2}{(b+c)^2+a^2} + \frac{(c+a-b)^2}{(c+a)^2+b^2} + \frac{(a+b-c)^2}{(a+b)^2+c^2} \geq \frac{3}{5}$$

What is the product of all the solutions to the equation $$\log_{7x}2023 \cdot \log_{289x} 2023 = \log_{2023x} 2023?$$ $\textbf{(A) }(\log_{2023}7 \cdot \log_{2023}289)^2 \qquad\textbf{(B) }\log_{2023}7 \cdot \log_{2023}289\qquad\textbf{(C) }1\qquad\textbf{(D) }\log_{7}2023 \cdot \log_{289}2023\qquad\textbf{(E) }(\log_{7}2023 \cdot \log_{289}2023)^2$

The game [i]Clobber [/i] is played by two on a strip of $2k$ squares. At the beginning there is a piece on each square, the pieces of both players stand alternatingly. At each move the player shifts one of his pieces to the neighbouring square that holds a piece of his opponent and removes his opponent’s piece from the table. The moves are made in turn, the player whose opponent cannot move anymore is the winner. Prove that if for some $k$ the player who does not start the game has the winning strategy, then for $k + 1$ and $k + 2$ the player who makes the first move has the winning strategy.

Determine the positive integers $n$ such that the set of all positive divisors of $30^n$ can be divided into groups of three so that the product of the three numbers in each group is the same.

Point $P$ lies inside of scalene triangle $ABC$ with incenter $I$ such that $:$ $$ 2\angle ABP = \angle BCA , 2\angle ACP = \angle CBA $$ Lines $PB$ and $PC$ intersect line $AI$ respectively at $B'$ and $C'$. Line through $B'$ parallel to $AB$ intersects $BI$ at $X$ and line through $C'$ parallel to $AC$ intersects $CI$ at $Y$. Prove that triangles $PXY$ and $ABC$ are similar.

Given an equilateral $\Delta ABC$, in which ${{A} _ {1}}, {{B} _ {1}}, {{C} _ {1}}$ are the midpoint of the sides $ BC, \, \, AC, \, \, AB$ respectively. The line $l$ passes through the vertex $A$, we denote by $P, Q$ the projection of the points $B, C$ on the line $l$, respectively (the line $ l $ and the point $Q, \, \, A, \, \, P$ are located as shown in fig.). Denote by $T $ the intersection point of the lines ${{B} _ {1}} P$ and ${{C} _ {1}} Q$. Prove that the line ${{A} _ {1}} T$ is perpendicular to the line $l$. [img]https://cdn.artofproblemsolving.com/attachments/4/b/61f2f4ec9e6b290dfcd47e9351110bebd3bd43.png[/img] (Serdyuk Nazar)

If $ \displaystyle \sum_{n \equal{} 0}^{\infty} \cos^{2n} \theta \equal{} 5$, what is the value of $ \cos{2\theta}$? $ \textbf{(A)}\ \frac15 \qquad \textbf{(B)}\ \frac25 \qquad \textbf{(C)}\ \frac {\sqrt5}{5}\qquad \textbf{(D)}\ \frac35 \qquad \textbf{(E)}\ \frac45$

In a given tedrahedron $ ABCD$ let $ K$ and $ L$ be the centres of edges $ AB$ and $ CD$ respectively. Prove that every plane that contains the line $ KL$ divides the tedrahedron into two parts of equal volume.