Given a convex polyhedron with 2022 faces. In 3 arbitary faces, there are already number $26; 4$ and $2022$ (each face contains 1 number). They want to fill in each other face a real number that is an arithmetic mean of every numbers in faces that have a common edge with that face. Prove that there is only one way to fill all the numbers in that polyhedron.

Find all positive integers $n$ such that $$\sum_{d|n, 1\leq d <n}d^2=5(n+1)$$

Let $a \ne 0$ be a natural number. Prove that $a$ is a perfect square if and only if for every $b \in N^*$ there exists $c \in N^*$ such that $a + bc$ is a perfect square.

Prove that there exist two infinite sequences $ \{a_n\}_{n\ge 1}$ and $ \{b_n\}_{n\ge 1}$ of positive integers such that the following conditions hold simultaneously: $ (i)$ $ 0 < a_1 < a_2 < a_3 < \cdots$; $ (ii)$ $ a_n < b_n < a_n^2$, for all $ n\ge 1$; $ (iii)$ $ a_n \minus{} 1$ divides $ b_n \minus{} 1$, for all $ n\ge 1$ $ (iv)$ $ a_n^2 \minus{} 1$ divides $ b_n^2 \minus{} 1$, for all $ n\ge 1$ [19 points out of 100 for the 6 problems]

For each positive integer $n$ let $\tau (n)$ be the sum of divisors of $n$. Find all positive integers $k$ for which $\tau (kn - 1) \equiv 0$ (mod $k$) for all positive integers $n$.

Let $N$ be the number of positive integers $x$ less than $210 \cdot 2023$ such that $$ lcm(gcd(x, 1734), gcd(x + 17, x + 1732))$$ divides $2023$. Compute the sum of the prime factors of $N$ with multiplicity. (For example, if $S = 75 = 3^1 \cdot 5^2$, then the answer is $1\cdot 3 + 2 \cdot 5 = 13$).

How many $\textit{odd}$ four-digit integers have the property that their digits, read left to right, are in strictly decreasing order?

Let $ ABCD$ be a convex cuadrilateral inscribed in a circumference centered at $ O$ such that $ AC$ is a diameter. Pararellograms $ DAOE$ and $ BCOF$ are constructed. Show that if $ E$ and $ F$ lie on the circumference then $ ABCD$ is a rectangle.

Determine, with proof, the rational number $\dfrac{m}{n}$ that equals \[\tfrac{1}{1\sqrt2+2\sqrt1}+\tfrac{1}{2\sqrt3+3\sqrt2}+\tfrac{1}{3\sqrt4+4\sqrt3}+\ldots+\tfrac{1}{4012008\sqrt{4012009}+4012009\sqrt{4012008}}\]

Let $a,b$ and $c$ be real numbers with $b,c >0.$ Prove that if $ a<b \ ( a>b),$ then \[\frac{a+c}{b+c} > \frac ab \qquad ( \frac{a+c}{b+c} < \frac ab) \] And then prove that $\frac{a+c}{b+c}$ is between $1$ and $\frac ab.$

Two players $A$ and $B$ play the following game: $A$ chooses a point, with integer coordinates, on the plane and colors it green, then $B$ chooses $10$ points of integer coordinates, not yet colored, and colors them yellow. The game always continues with the same rules; $A$ and $B$ choose one and ten uncolored points and color them green and yellow, respectively. a. The objective of $A$ is to achieve $111^2$ green points that are the intersections of $111$ horizontal lines and $111$ vertical lines (parallel to the coordinate axes). $B$'s goal is to stop him. Determine which of the two players has a strategy that ensures you achieve your goal. b. The objective of $A$ is to achieve $4$ green points that are the vertices of a square with sides parallel to the coordinate axes. $B$'s goal is to stop him. Determine which of the two players has a strategy that will ensure that they achieve their goal.

Let $p > 7$ be a prime which leaves residue 1 when divided by 6. Let $m=2^p-1,$ then prove $2^{m-1}-1$ can be divided by $127m$ without residue.

At a mathematical competition $n$ students work on 6 problems each one with three possible answers. After the competition, the Jury found that for every two students the number of the problems, for which these students have the same answers, is 0 or 2. Find the maximum possible value of $n$.

In a forest there are $5$ trees $A, B, C, D, E$ that are in that order on a straight line. At the midpoint of $AB$ there is a daisy, at the midpoint of $BC$ there is a rose bush, at the midpoint of $CD$ there is a jasmine, and at the midpoint of $DE$ there is a carnation. The distance between $A$ and $E$ is $28$ m; the distance between the daisy and the carnation is $20$ m. Calculate the distance between the rose bush and the jasmine.

A laser is placed at the point (3,5). The laser bean travels in a straight line. Larry wants the beam to hit and bounce off the $y$-axis, then hit and bounce off the $x$-axis, then hit the point $(7,5)$. What is the total distance the beam will travel along this path? $\textbf{(A) }2\sqrt{10} \qquad \textbf{(B) }5\sqrt2 \qquad \textbf{(C) }10\sqrt2 \qquad \textbf{(D) }15\sqrt2 \qquad \textbf{(E) }10\sqrt5$

Each side of the large square in the figure is trisected (divided into three equal parts). The corners of an inscribed square are at these trisection points, as shown. The ratio of the area of the inscribed square to the area of the large square is [asy] draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((1,0)--(1,0.2)); draw((2,0)--(2,0.2)); draw((3,1)--(2.8,1)); draw((3,2)--(2.8,2)); draw((1,3)--(1,2.8)); draw((2,3)--(2,2.8)); draw((0,1)--(0.2,1)); draw((0,2)--(0.2,2)); draw((2,0)--(3,2)--(1,3)--(0,1)--cycle); [/asy] $\textbf{(A)}\ \dfrac{\sqrt{3}}{3} \qquad \textbf{(B)}\ \dfrac{5}{9} \qquad \textbf{(C)}\ \dfrac{2}{3} \qquad \textbf{(D)}\ \dfrac{\sqrt{5}}{3} \qquad \textbf{(E)}\ \dfrac{7}{9}$

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Find all real constants c for which there exist strictly increasing sequence $a$ of positive integers such that $(a_{2n-1}+a_{2n})/{a_n}=c$ for all positive intеgers n.

A teacher wishes to separate her $12$ students into groups. Yesterday, the teacher put the students into $4$ groups of $3$. Today, the teacher decides to put the students into $4$ groups of $3$ again. However, she doesn’t want any pair of students to be in the same group on both days. Find how many ways she could formthe groups today.

Point $T$ is chosen in the plane of a rhombus $ABCD$ so that $\angle ATC + \angle BTD = 180^\circ$, and circumcircles of triangles $ATC$ and $BTD$ are tangent to each other. Show that $T$ is equidistant from diagonals of $ABCD$. [i]Proposed by Fedir Yudin[/i]

Let $ABC$ be a triangle with $\angle A = 60^\circ$. Points $E$ and $F$ are the foot of angle bisectors of vertices $B$ and $C$ respectively. Points $P$ and $Q$ are considered such that quadrilaterals $BFPE$ and $CEQF$ are parallelograms. Prove that $\angle PAQ > 150^\circ$. (Consider the angle $PAQ$ that does not contain side $AB$ of the triangle.) [i]Proposed by Alireza Dadgarnia[/i]

16. Create a cube $C_1$ with edge length $1$. Take the centers of the faces and connect them to form an octahedron $O_1$. Take the centers of the octahedron’s faces and connect them to form a new cube $C_2$. Continue this process infinitely. Find the sum of all the surface areas of the cubes and octahedrons. 17. Let $p(x) = x^2 - x + 1$. Let $\alpha$ be a root of $p(p(p(p(x)))$. Find the value of $$(p(\alpha) - 1)p(\alpha)p(p(\alpha))p(p(p(\alpha))$$ 18. An $8$ by $8$ grid of numbers obeys the following pattern: 1) The first row and first column consist of all $1$s. 2) The entry in the $i$th row and $j$th column equals the sum of the numbers in the $(i - 1)$ by $(j - 1)$ sub-grid with row less than i and column less than $j$. What is the number in the 8th row and 8th column?

Let $ABC$ be an acute scalene triangle and let $\omega$ be its Euler circle. The tangent $t_A$ of $\omega$ at the foot of the height $A$ of the triangle ABC, intersects the circle of diameter $AB$ at the point $K_A$ for the second time. The line determined by the feet of the heights $A$ and $C$ of the triangle $ABC$ intersects the lines $AK_A$ and $BK_A$ at the points $L_A$ and $M_A$, respectively, and the lines $t_A$ and $CM_A$ intersect at the point $N_A$. Points $K_B, L_B, M_B, N_B$ and $K_C, L_C, M_C, N_C$ are defined similarly for $(B, C, A)$ and $(C, A, B)$ respectively. Show that the lines $L_AN_A, L_BN_B,$ and $L_CN_C$ are concurrent.

Each side of square $ABCD$ with side length of $4$ is divided into equal parts by three points. Choose one of the three points from each side, and connect the points consecutively to obtain a quadrilateral. Which numbers can be the area of this quadrilateral? Just write the numbers without proof. [asy] import graph; size(4.662701220158751cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -4.337693339683693, xmax = 2.323308403400238, ymin = -0.39518100382374105, ymax = 4.44811779880594; /* image dimensions */ pen yfyfyf = rgb(0.5607843137254902,0.5607843137254902,0.5607843137254902); pen sqsqsq = rgb(0.12549019607843137,0.12549019607843137,0.12549019607843137); filldraw((-3.,4.)--(1.,4.)--(1.,0.)--(-3.,0.)--cycle, white, linewidth(1.6)); filldraw((0.,4.)--(-3.,2.)--(-2.,0.)--(1.,1.)--cycle, yfyfyf, linewidth(2.) + sqsqsq); /* draw figures */ draw((-3.,4.)--(1.,4.), linewidth(1.6)); draw((1.,4.)--(1.,0.), linewidth(1.6)); draw((1.,0.)--(-3.,0.), linewidth(1.6)); draw((-3.,0.)--(-3.,4.), linewidth(1.6)); draw((0.,4.)--(-3.,2.), linewidth(2.) + sqsqsq); draw((-3.,2.)--(-2.,0.), linewidth(2.) + sqsqsq); draw((-2.,0.)--(1.,1.), linewidth(2.) + sqsqsq); draw((1.,1.)--(0.,4.), linewidth(2.) + sqsqsq); label("$A$",(-3.434705427329005,4.459844914550807),SE*labelscalefactor,fontsize(14)); label("$B$",(1.056779902954702,4.424663567316209),SE*labelscalefactor,fontsize(14)); label("$C$",(1.0450527872098359,0.07390362597090126),SE*labelscalefactor,fontsize(14)); label("$D$",(-3.551976584777666,0.12081208895036549),SE*labelscalefactor,fontsize(14)); /* dots and labels */ dot((-2.,4.),linewidth(4.pt) + dotstyle); dot((-1.,4.),linewidth(4.pt) + dotstyle); dot((0.,4.),linewidth(4.pt) + dotstyle); dot((1.,3.),linewidth(4.pt) + dotstyle); dot((1.,2.),linewidth(4.pt) + dotstyle); dot((1.,1.),linewidth(4.pt) + dotstyle); dot((0.,0.),linewidth(4.pt) + dotstyle); dot((-1.,0.),linewidth(4.pt) + dotstyle); dot((-3.,1.),linewidth(4.pt) + dotstyle); dot((-3.,2.),linewidth(4.pt) + dotstyle); dot((-3.,3.),linewidth(4.pt) + dotstyle); dot((-2.,0.),linewidth(4.pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Hirad Aalipanah[/i]

$40$ cells were marked on an infinite chessboard. Is it always possible to find a rectangle that contains $20$ marked cells? M. Evdokimov