The hypotenuse of a right triangle has length 1. Consider the line passing through the points of tangency of the incircle with the legs of the triangle. The circumcircle of the triangle cuts out a segment of this line. What is the possible length of this segment? [i]Maxim Volchkevich[/i]

If $n\in\mathbb{Z_+}$, positive real numbers $a+b=2$, then the minumum value of $\frac{1}{1+a^n}+\frac{1}{1+b^n}$ is________.

The lines $ x \equal{} \frac 14y \plus{} a$ and $ y \equal{} \frac 14x \plus{} b$ intersect at the point $ (1,2)$. What is $ a \plus{} b$? $ \textbf{(A) } 0 \qquad \textbf{(B) } \frac 34 \qquad \textbf{(C) } 1 \qquad \textbf{(D) } 2 \qquad \textbf{(E) } \frac 94$

A rectangular pool table has a hole at each of three of its corners. The lengths of sides of the table are the real numbers $a$ and $b$. A billiard ball is shot from the fourth corner along its angle bisector. The ball falls in one of the holes. What should the relation between $a$ and $b$ be for this to happen?

Find the minimal value of integer $ n$ that guarantees: Among $ n$ sets, there exits at least three sets such that any of them does not include any other; or there exits at least three sets such that any two of them includes the other. $\textbf{(A)}\ 4 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 8$

Find all $f: R \longrightarrow R$ such that \[f(xy+f(x))=xf(y)+f(x)\] for every pair of real numbers $x,y$.

Polynomials $u_i(x) = a_ix+b_i$ ($a_i,b_i \in R$, $ i = 1,2,3$) satisfy $$u_1(x)^n +u_2(x)^n = u_3(x)^n$$ for some integer $n \ge 2.$ Prove that there exist real numbers $A$,$B$,$c_1$,$c_2$,$c_3$ such that $u_i(x) = c_i(Ax+B)$ for $i = 1,2,3$.

Let $P(x)$ be a polynomial of degree $n > 1$ with integer coefficients and let $k$ be a positive integer. Consider the polynomial $Q(x) = P(P(\ldots P(P(x)) \ldots ))$, where $P$ occurs $k$ times. Prove that there are at most $n$ integers $t$ such that $Q(t) = t$.

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$.