$k$ is an integer, there exists a triangulation for a regular polygon with $2024$ sides and $2024$ colored dots with $k$ different colors meeting $(1)$ each color will be used at least once $(2)$ every small triangle will have at least $2$ dots that will be in the same color. Try to find the maximum value of$k$

Let $x_i,$ $1 \leq i \leq n$ be real numbers with $n \geq 3.$ Let $p$ and $q$ be their symmetric sum of degree $1$ and $2$ respectively. Prove that: i) $p^2 \cdot \frac{n-1}{n}-2q \geq 0$ ii) $\left|x_i - \frac{p}{n}\right| \leq \sqrt{p^2 - \frac{2nq}{n-1}} \cdot \frac{n-1}{n}$ for every meaningful $i$.

Let $S^{2}\subset \mathbb{R}^{3}$ be the unit sphere. Show that for any $n$ points on $ S^{2}$, the sum of the squares of the $\frac{n(n-1)}{2}$ distances between them is at most $n^{2}$.

Find the maximal number of points, such that there exist a configuration of $2023$ lines on the plane, with each lines pass at least $2$ points.

Given a prime number $p$. A positive integer $x$ is divided by $p$ with a remainder, and the number $p^2$ is divided by $x$ with a remainder. The remainders turned out to be equal. Find them [i]Proposed by Sergey Berlov[/i]

For an $n \times n$ table filled with natural numbers, we say it is a [i]divisor table[/i] if: - the numbers in the $i$-th row are exactly all the divisors of some natural number $r_i$, - the numbers in the $j$-th column are exactly all the divisors of some natural number $c_j$, - $r_i \ne r_j$ for every $i \ne j$. A prime number $p$ is given. Determine the smallest natural number $n$, divisible by $p$, such that there exists an $n \times n$ divisor table, or prove that such $n$ does not exist. [i]Proposed by Pavle Martinović[/i]

Let $ n$ be a natural number, such that $ (n,2(2^{1386}\minus{}1))\equal{}1$. Let $ \{a_{1},a_{2},\dots,a_{\varphi(n)}\}$ be a reduced residue system for $ n$. Prove that:\[ n|a_{1}^{1386}\plus{}a_{2}^{1386}\plus{}\dots\plus{}a_{\varphi(n)}^{1386}\]

A triangle has an angle of measure $\theta$. It is dissected into several triangles. Is it possible that all angles of the resulting triangles are less than $\theta$, if (a) $\theta = 70^o$ ? (b) $\theta = 80^o$ ?

Let $ABC$ be a triangle with circumradius $R=17$ and inradius $r=7$. Find the maximum possible value of $\sin \frac{A}{2}$.

Find all functions $f: \mathbb{R} \mapsto \mathbb{R}$ such that $$f(x)f\left(yf(x)-1\right)=x^2f(y)-f(x),$$for all $x,y \in \mathbb{R}$.

Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$. [i]Victor Wang.[/i]

In an acute angled triangle $ABC$ , let $BB' $ and $CC'$ be the altitudes. Ray $C'B'$ intersects the circumcircle at $B''$ andl let $\alpha_A$ be the angle $\widehat{ABB''}$. Similarly are defined the angles $\alpha_B$ and $\alpha_C$. Prove that $$\displaystyle\sin \alpha _A \sin \alpha _B \sin \alpha _C\leq \frac{3\sqrt{6}}{32}$$ (Romania)

Compute the value of the infinite series \[\sum_{n=2}^\infty \dfrac{n^4+3n^2+10n+10}{2^n\cdot(n^4+4)}\]

Convex polygon $A_1A_2\ldots A_n$ is called $balanced$ if there is a point $M{}$ inside it such that the half lines $(A_iM, (i=1,2,\ldots,n)$ intersect disctinct sides of the polygon. a) Show that if $n>3$ is even, then every polygon with $n{}$ sides is not balanced. b) Do polygons with an odd number of sides that are not balanced exist?

Call an $n$-tuple $(a_1, . . . , a_n)$ [i]occasionally periodic [/i] if there exist a nonnegative integer $i$ and a positive integer $p$ satisfying $i + 2p \le n$ and $a_{i+j} = a_{i+p+j}$ for every $j = 1, 2, . . . , p$. Let $k$ be a positive integer. Find the least positive integer $n$ for which there exists an $n$-tuple $(a_1, . . . , a_n)$ with elements from set $\{1, 2, . . . , k\}$, which is not occasionally periodic but whose arbitrary extension $(a_1, . . . , a_n, a_{n+1})$ is occasionally periodic for any $a_{n+1} \in \{1, 2, . . . , k\}$.

We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions: (1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal. (2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal. Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.

There are $100$ students who praticipate at exam.Also there are $25$ members of jury.Each student is checked by one jury.Known that every student likes $10$ jury $a)$ Prove that we can select $7$ jury such that any student likes at least one jury. $b)$ Prove that we can make this every student will be checked by the jury that he likes and every jury will check at most $10$ students.

Let $a, b, c$ and $d$ be real numbers such that $$a^3+b^3+c^3+d^3=a+b+c+d=0$$ Prove that the sum of a pair of these numbers is equal to $0$. (LD Kurliandchik)

Squares $ABCD$ and $EFGH$ are congruent, $AB=10$, and $G$ is the center of square $ABCD$. The area of the region in the plane covered by these squares is [asy] draw((0,0)--(10,0)--(10,10)--(0,10)--cycle); draw((5,5)--(12,-2)--(5,-9)--(-2,-2)--cycle); label("A", (0,0), W); label("B", (10,0), E); label("C", (10,10), NE); label("D", (0,10), NW); label("G", (5,5), N); label("F", (12,-2), E); label("E", (5,-9), S); label("H", (-2,-2), W); dot((-2,-2)); dot((5,-9)); dot((12,-2)); dot((0,0)); dot((10,0)); dot((10,10)); dot((0,10)); dot((5,5)); [/asy] $ \textbf{(A)}\ 75 \qquad\textbf{(B)}\ 100 \qquad\textbf{(C)}\ 125 \qquad\textbf{(D)}\ 150 \qquad\textbf{(E)}\ 175 $

Determine the set of points $P$ in the plane of a square $ABCD$ for which \[\max (PA, PC)=\frac1{\sqrt2}(PB+PD).\] [i]Titu Andreescu and I.V. Maftei[/i]

Is it true that from an arbitrary triangle you can cut three equal figures, the area of each of which is more than a quarter of the area triangle?

How many non-empty subsets of $\{1,2,\dots,11\}$ are there with the property that the product of its elements is the cube of an integer?

Whether $m$ and $n$ natural numbers, $m,n\ge 2$. Consider matrices, ${{A}_{1}},{{A}_{2}},...,{{A}_{m}}\in {{M}_{n}}(R)$ not all nilpotent. Demonstrate that there is an integer number $k>0$ such that ${{A}^{k}}_{1}+{{A}^{k}}_{2}+.....+{{A}^{k}}_{m}\ne {{O}_{n}}$

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

Let $ f$ be an integrable real-valued function on the closed interval $ [0, 1]$ such that $$\int_{0}^{1} x^{m}f(x) dx=\begin{cases} 0 \;\; \text{for}\; m=0,1,\ldots,n-1;\\ 1\;\; \text{for}\; m=n. \end{cases} $$ Show that $|f(x)|\geq2^{n}(n+1)$ on a set of positive measure.