a) Prove that $x^2 + y^2 + z^2 = 2xyz$ for integer $x, y, z$ only if $x = y = z = 0$. b) Find integers $x, y, z, u$ such that $x^2 + y^2 + z^2 + u^2 = 2xyzu$.

Let $C$ be a three-dimensional cube with edge length 1. There are 8 equilateral triangles whose vertices are vertices of $C$. The 8 planes that contain these 8 equilateral triangles divide $C$ into several nonoverlapping regions. Find the volume of the region that contains the center of $C$.

Find all functions $f:(0,+\infty) \to (0,+\infty)$ that satisfy $(i)$ $f(xf(y))=yf(x), \forall x,y > 0,$ $(ii)$ $\displaystyle\lim_{x\to+\infty} f(x) = 0.$

Let $ABC$ be an equilateral triangle. Extend side $\overline{AB}$ beyond $B$ to a point $B'$ so that $BB' = 3AB$. Similarly, extend side $\overline{BC}$ beyond $C$ to a point $C'$ so that $CC' = 3BC$, and extend side $\overline{CA}$ beyond $A$ to a point $A'$ so that $AA' = 3CA$. What is the ratio of the area of $\triangle A'B'C'$ to the area of $\triangle ABC$? $\textbf{(A) }9:1\qquad\textbf{(B) }16:1\qquad\textbf{(C) }25:1\qquad\textbf{(D) }36:1\qquad\textbf{(E) }37:1$

The square $BCDE$ is inscribed in circle $\omega$ with center $O$. Point $A$ is the reflection of $O$ over $B$. A "hook" is drawn consisting of segment $AB$ and the major arc $\widehat{BE}$ of $\omega$ (passing through $C$ and $D$). Assume $BCDE$ has area $200$. To the nearest integer, what is the length of the hook? [i]Proposed by Evan Chen[/i]

Let $b,n > 1$ be integers. Suppose that for each $k > 1$ there exists an integer $a_k$ such that $b - a^n_k$ is divisible by $k$. Prove that $b = A^n$ for some integer $A$. [i]Author: Dan Brown, Canada[/i]

Let $\{A_{1},\dots,A_{k}\}$ be matrices which make a group under matrix multiplication. Suppose $M=A_{1}+\dots+A_{k}$. Prove that each eigenvalue of $M$ is equal to $0$ or $k$.

(a) Prove that, for any positive integers $m\le \ell$ given, there is a positive integer $n$ and positive integers $x_1,\cdots,x_n,y_1,\cdots,y_n$ such that the equality \[ \sum_{i=1}^nx_i^k=\sum_{i=1}^ny_i^k\] holds for every $k=1,2,\cdots,m-1,m+1,\cdots,\ell$, but does not hold for $k=m$. (b) Prove that there is a solution of the problem, where all numbers $x_1,\cdots,x_n,y_1,\cdots,y_n$ are distinct. [i]Proposed by Ilya Bogdanov and Géza Kós.[/i]

If at least one of the integers $ a,b $ is not divisible by $ 3, $ then the polynom $ X^2-abX+a^2+b^2 $ is irreducible over the integers. [i]Ion Cucurezeanu[/i]

Let $ABC$ be an equilateral triangle and $n{}, n>1$ an integer. Let $S{}$ be the set of the $n-1$ lines parallel with $BC$ that cut $ABC$ in $n{}$ figures with equal areas and $S^{'}$ be the set of the $n-1$ lines parallel with $BC$ that cut $ABC$ in $n{}$ figures with equal perimeters. Show that $S{}$ and $S^{'}$ are disjunctive.

Let $n$ points with integer coordinates be given in the $xy$-plane. What is the minimum value of $n$ which will ensure that three of the points are the vertices of a triangel with integer (possibly, 0) area?

Let $f$ be continuous and nowhere monotone on $[0,1]$. Show that the set of points on which $f$ obtains a local minimum is dense.

A point $E$ on side $CD$ of a rectangle $ABCD$ is such that $\triangle DBE$ is isosceles and $\triangle ABE$ is right-angled. Find the ratio between the side lengths of the rectangle.

Find the volume $V$ of the solid formed by a rotation of the region enclosed by the curve $y=2^{x}-1$ and two lines $x=0,\ y=1$ around the $y$ axis.

Amanda Reckonwith draws five circles with radii 1, 2, 3, 4 and 5. Then for each circle she plots the point (C; A), where C is its circumference and A is its area. Which of the following could be her graph? $\textbf{(A)}$ [asy] size(75); pair A= (1.5,1) , B= (3,3) , C= (4.5,6) , D= (6,10) , E= (7.5,15) ; draw((0,-1)--(0,16)); draw((-1,0)--(16,0)); dot(A^^B^^C^^D^^E); label("$A$", (0,8), W); label("$C$", (8,0), S);[/asy] $\textbf{(B)}$ [asy] size(75); pair A= (1.5,9) , B= (3,6) , C= (4.5,6) , D= (6,9) , E= (7.5,15) ; draw((0,-1)--(0,16)); draw((-1,0)--(16,0)); dot(A^^B^^C^^D^^E); label("$A$", (0,8), W); label("$C$", (8,0), S);[/asy] $\textbf{(C)}$ [asy] size(75); pair A= (1.5,2) , B= (3,6) , C= (4.5,8) , D= (6,6) , E= (7.5,2) ; draw((0,-1)--(0,16)); draw((-1,0)--(16,0)); dot(A^^B^^C^^D^^E); label("$A$", (0,8), W); label("$C$", (8,0), S);[/asy] $\textbf{(D)}$ [asy] size(75); pair A= (1.5,2) , B= (3,5) , C= (4.5,8) , D= (6,11) , E= (7.5,14) ; draw((0,-1)--(0,16)); draw((-1,0)--(16,0)); dot(A^^B^^C^^D^^E); label("$A$", (0,8), W); label("$C$", (8,0), S);[/asy] $\textbf{(E)}$ [asy] size(75); pair A= (1.5,15) , B= (3,10) , C= (4.5,6) , D= (6,3) , E= (7.5,1) ; draw((0,-1)--(0,16)); draw((-1,0)--(16,0)); dot(A^^B^^C^^D^^E); label("$A$", (0,8), W); label("$C$", (8,0), S);[/asy]

Write the numbers from $1$ to $16$ in the cells of a of a $4 \times 4$ square so that: 1. Each cell contains exactly one number; 2. Each number is written exactly once; 3. For any two cells that are symmetrical with respect to any of the perpendicular bisectors of sides of the original $4 \times 4$ square, the sum of numbers in them is a prime number The figure below shows examples of such pairs of cells, sums of numbers in which have to be prime. [img]https://i.ibb.co/fqX05dY/Kyiv-MO-2024-Round-1-8-2.png[/img] [i]Proposed by Mykhailo Shtandenko[/i]

Let $f(x)=\frac{9^x}{9^x+3}$. Compute $\sum_{k} f \biggl( \frac{k}{2002} \biggr)$, where $k$ goes over all integers $k$ between $0$ and $2002$ which are coprime to $2002$.

Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \] [i]Carl Schildkraut[/i]

Let $\omega_P$ and $\omega_Q$ be two circles of radius $1$, intersecting in points $A$ and $B$. Let $P$ and $Q$ be two regular $n$-gons (for some positive integer $n\ge4$) inscribed in $\omega_P$ and $\omega_Q$, respectively, such that $A$ and $B$ are vertices of both $P$ and $Q$. Suppose a third circle $\omega$ of radius $1$ intersects $P$ at two of its vertices $C$, $D$ and intersects $Q$ at two of its vertices $E$, $F$. Further assume that $A$, $B$, $C$, $D$, $E$, $F$ are all distinct points, that $A$ lies outside of $\omega$, and that $B$ lies inside $\omega$. Show that there exists a regular $2n$-gon that contains $C$, $D$, $E$, $F$ as four of its vertices.

Let $a, b, c$ be nonnegative real numbers satisfying $a + b + c =3$. a) If $c > \frac32$, prove that $3(ab + bc + ca) - 2abc < 7$. b) Find the greatest possible value of $M =3(ab + bc + ca) - 2abc $.

Six decks of $n$ cards, numbered from $1$ to $n$, are given. Melanie arranges each of the decks in some order, such that for any distinct numbers $x$, $y$, and $z$ in $\{1, 2, . . . , n\}$, there is exactly one deck where card $x$ is above card $y$ and card $y$ is above card $z$. Show that there is some $n$ for which Melanie cannot arrange these six decks of cards with this property.

Let $ \triangle ABC$ be a triangle and let $ K$ be some point on the side $ AB$, so that the tangent line from $ K$ to the incircle of $ \triangle ABC$ intersects the ray $ AC$ at $ L$. Assume that $ \omega$ is tangent to sides $ AB$ and $ AC$, and to the circumcircle of $ \triangle AKL$. Prove that $ \omega$ is tangent to the circumcircle of $ \triangle ABC$ as well.

Evaluate the limit: \[ \lim_{n \to \infty}{n \cdot \sin{1} \cdot \sin{2} \cdot \dots \cdot \sin{n}}.\] Proposed to "Unirea" Intercounty contest, grade 11, Romania

Prove there exist infinitely many pairs $(x,y)$ of integers $1<x<y$, such that $x^3+y \mid x+y^3$. ([i]Dan Schwarz[/i])

Given a connected graph with $n$ edges, where there are no parallel edges. For any two cycles $C,C'$ in the graph, define its [i]outer cycle[/i] to be \[C*C'=\{x|x\in (C-C')\cup (C'-C)\}.\] (1) Let $r$ be the largest postive integer so that we can choose $r$ cycles $C_1,C_2,\ldots,C_r$ and for all $1\leq k\leq r$ and $1\leq i$, $j_1,j_2,\ldots,j_k\leq r$, we have \[C_i\neq C_{j_1}*C_{j_2}*\cdots*C_{j_k}.\] (Remark: There should have been an extra condition that either $j_1\neq i$ or $k\neq 1$) (2) Let $s$ be the largest positive integer so that we can choose $s$ edges that do not form a cycle. (Remark: A more precise way of saying this is that any nonempty subset of these $s$ edges does not form a cycle) Show that $r+s=n$. Note: A cycle is a set of edges of the form $\{A_iA_{i+1},1\leq i\leq n\}$ where $n\geq 3$, $A_1,A_2,\ldots,A_n$ are distinct vertices, and $A_{n+1}=A_1$.