There are $18$ children in the class. Parents decided to give children from this class a cake. To do this, they first learned from each child the area of ​​the piece he wants to get. After that, they showed a square-shaped cake, the area of ​​which is exactly equal to the sum of $18$ named numbers. However, when they saw the cake, the children wanted their pieces to be squares too. The parents cut the cake with lines parallel to the sides of the cake (cuts do not have to start or end on the side of the cake). For what maximum k the parents are guaranteed to cut out $k$ square pieces from the cake, which you can give to $k$ children so that each of them gets what they want?

Two polynomials with real coefficients have the leading coefficients equal to 1 . Each polynomial has an odd degree that is equal to the number of its distinct real roots. The product of the values of the first polynomial at the roots of the second polynomial is equal to 2024. Find the product of the values of the second polynomial at the roots of the first one. Sergey Yanzhinov

Let $a, b \ge 2$ be positive integers with $gcd (a, b) = 1$. Let $r$ be the smallest positive value that $\frac{a}{b}- \frac{c}{d}$ can take, where $c$ and $d$ are positive integers satisfying $c \le a$ and $d \le b$. Prove that $\frac{1}{r}$ is an integer.

Find a matrix $A_{(2 \times 2)}$ for which \[ \begin{bmatrix}2 &1 \\ 3 & 2\end{bmatrix} A \begin{bmatrix}3 & 2 \\ 4 & 3\end{bmatrix} = \begin{bmatrix}1 & 2 \\ 2 & 1\end{bmatrix}.\]

Let be a natural number $ n\ge 3. $ Solve the equation $ \lfloor x/n \rfloor =\lfloor x-n \rfloor $ in $ \mathbb{R} . $ [i]Constantin Nicolau[/i]

In $\triangle ABC$, if $9a^2+9b^2-19c^2=0$, then $\frac{\cot C}{\cot A+\cot B}=$________.

Find all functions $f: \mathbb{N}_{0}\to \mathbb{N}_{0}$ such that for all $m,n\in \mathbb{N}_{0}$: \[mf(n)+nf(m)=(m+n)f(m^{2}+n^{2}).\]

Is there such a natural number that the product of all its natural divisors (including $1$ and the number itself) ends exactly in $2001$ zeros?

Construct triangle $ABC$, given the altitude and the angle bisector both from $A$, if it is known for the sides of the triangle $ABC$ that $2BC = AB + AC$. (Alexey Karlyuchenko)

Let $x$, $y$, and $z$ be real numbers such that $x+y+z=20$ and $x+2y+3z=16$. What is the value of $x+3y+5z$? [i]Proposed by James Lin[/i]

Alan has three pins that form a right triangle with legs $1$ and $4$ at first. Every move, he can pick any one of the pins, pick any new point $\mathcal{P}$ on the opposite side, and move the pin to its $\textit{reflection}$ across $\mathcal{P}$. After a series of moves, can the pins eventually form a right triangle with legs $2$ and $3$? [center][img width=75]https://cdn.artofproblemsolving.com/attachments/e/0/f50c28102c8cefd1fd1f4c327fd3f24f12748d.png[/img][/center] [i]Jason Lee[/i]

Let $ABC$ be an arbitrary triangle. A regular $n$-gon is constructed outward on the three sides of $\triangle ABC$. Find all $n$ such that the triangle formed by the three centres of the $n$-gons is equilateral.

If $a_1,a_2,\cdots,a_{2013}\in[-2,2]$ and $a_1+a_2+\cdots+a_{2013}=0$ , find the maximum of $a^3_1+a^3_2+\cdots+a^3_{2013}$.

Can one place positive integers at all vertices of a cube in such a way that for every pair of numbers connected by an edge, one will be divisible by the other , and there are no other pairs of numbers with this property? (A Shapovalov)

A grocer makes a display of cans in which the top row has one can and each lower row has two more cans than the row above it. If the display contains $ 100$ cans, how many rows does it contain? $ \textbf{(A)}\ 5\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 9\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ 11$

Let $N$ be the set of those positive integers $n$ for which $n\mid k^k-1$ implies $n\mid k-1$ for every positive integer $k$. Prove that if $n_1,n_2\in N$, then their greatest common divisor is also in $N$.

Find all positive integers $n$ for which there exists a polynomial $P(x) \in \mathbb{Z}[x]$ such that for every positive integer $m\geq 1$, the numbers $P^m(1), \ldots, P^m(n)$ leave exactly $\lceil n/2^m\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.) [i]Proposed by Carl Schildkraut, USA[/i]

An organization has $30$ employees, $20$ of whom have a brand A computer while the other $10$ have a brand B computer. For security, the computers can only be connected to each other and only by cables. The cables can only connect a brand A computer to a brand B computer. Employees can communicate with each other if their computers are directly connected by a cable or by relaying messages through a series of connected computers. Initially, no computer is connected to any other. A technician arbitrarily selects one computer of each brand and installs a cable between them, provided there is not already a cable between that pair. The technician stops once every employee can communicate with each other. What is the maximum possible number of cables used? $\textbf{(A)}\ 190 \qquad\textbf{(B)}\ 191 \qquad\textbf{(C)}\ 192 \qquad\textbf{(D)}\ 195 \qquad\textbf{(E)}\ 196$

Compute \[\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\cdots}}}}}}\]

let $a_1,a_2,...a_n$ a sequence of real numbers such that $a_1+....+a_n=0$. define $b_i=a_1+a_2+....a_i$ for all $1 \leq i \leq n$ .suppose $b_i(a_{j+1}-a_{i+1}) \geq 0$ for all $1 \leq i \leq j \leq n-1$. Show that $$\max_{1 \leq l \leq n} |a_l| \geq \max_{1 \leq m \leq n} |b_m|$$

Let $n$ and $k$ be positive integers. A function $f : \{1, 2, 3, 4, \dots , kn - 1, kn\} \to \{1, \cdots , 5\}$ is [i]good[/i] if $f(j + k) - f(j)$ is multiple of $k$ for every $j = 1, 2. \cdots , kn - k$. [b](a)[/b] Prove that, if $k = 2$, then the number of good functions is a perfect square for every positive integer $n$. [b](b)[/b] Prove that, if $k = 3$, then the number of good functions is a perfect cube for every positive integer $n$.

In quadrilateral $ABCD$ sides $BC$ and $AD$ are parallel. In each of the four vertices we draw an angular bisector. The angular bisectors of angles $A$ and $B$ intersect in point $P$, those of angles $B$ and $C$ intersect in point $Q$, those of angles $C$ and $D$ intersect in point $R$, and those of angles $D$ and $A$ intersect in point S. Suppose that $PS$ is parallel to $QR$. Prove that $|AB| =|CD|$. [asy] unitsize(1.2 cm); pair A, B, C, D, P, Q, R, S; A = (0,0); D = (3,0); B = (0.8,1.5); C = (3.2,1.5); S = extension(A, incenter(A,B,D), D, incenter(A,C,D)); Q = extension(B, incenter(A,B,C), C, C + incenter(A,B,D) - A); P = extension(A, S, B, Q); R = extension(D, S, C, Q); draw(A--D--C--B--cycle); draw(B--Q--C); draw(A--S--D); dot("$A$", A, SW); dot("$B$", B, NW); dot("$C$", C, NE); dot("$D$", D, SE); dot("$P$", P, dir(90)); dot("$Q$", Q, dir(270)); dot("$R$", R, dir(90)); dot("$S$", S, dir(90)); [/asy] Attention: the figure is not drawn to scale.

In a trapezoid, the sum of the lengths of the side and the diagonal is equal to the sum of the lengths of the other side and the other diagonal. Prove that the trapezoid is isosceles.

Let $ABCD$ be a quadrilateral inscribed in the circle $(O)$. Let $(K)$ be an arbitrary circle passing through $B,C$. Circle $(O_1)$ tangent to $AB,AC$ and is internally tangent to $(K)$. Circle $(O_2)$ touches $DB,DC$ and is internally tangent to $(K)$. Prove that one of the two external common tangents of $(O_1)$ and $(O_2)$ is parallel to $AD$. Trần Quang Hùng

A year is a leap year if and only if the year number is divisible by $400$ (such as $2000$) or is divisible by $4$ but not by $100$ (such as $2012$). The $200\text{th}$ anniversary of the birth of novelist Charles Dickens was celebrated on February $7$, $2012$, a Tuesday. On what day of the week was Dickens born? $ \textbf{(A)}\ \text{Friday} \qquad\textbf{(B)}\ \text{Saturday} \qquad\textbf{(C)}\ \text{Sunday} \qquad\textbf{(D)}\ \text{Monday} \qquad\textbf{(E)}\ \text{Tuesday} $