Solve the system of equations: $$\begin{cases} \log_{2} x + \log_{4} y + \log_{4} z =2 \\ \log_{3} y + \log_{9} z + \log_{9} x =2 \\ \log_{4} z + \log_{16} x + \log_{16} y =2\end{cases}$$

How many triangles formed by three vertices of a regular $17$-gon are obtuse? $\text{(A) }156\qquad\text{(B) }204\qquad\text{(C) }357\qquad\text{(D) }476\qquad\text{(E) }524$

Let $P(x)\in \mathbb{Z}[x]$ be a monic polynomial with even degree. Prove that, if for infinitely many integers $x$, the number $P(x)$ is a square of a positive integer, then there exists a polynomial $Q(x)\in\mathbb{Z}[x]$ such that $P(x)=Q(x)^2$.

Let $u,v$ be positive integers. Define sequence $\{a_n\}$ as follows: $a_1=u+v$, and for integers $m\ge 1$, \[\begin{array}{lll} \begin{cases} a_{2m}=a_m+u, \\ a_{2m+1}=a_m+v, \end{cases} \end{array}\] Let $S_m=a_1+a_2+\ldots +a_m(m=1,2,\ldots )$. Prove that there are infinitely many perfect squares in the sequence $\{S_n\}$.

Let $r$, $s$ be real numbers, find maximum $t$ so that if $a_1, a_2, \ldots$ is a sequence of positive real numbers satisfying \[ a_1^r + a_2^r + \cdots + a_n^r \le 2023 \cdot n^t \] for all $n \ge 2023$ then the sum \[ b_n = \frac 1{a_1^s} + \cdots + \frac 1{a_n^s} \] is unbounded, i.e for all positive reals $M$ there is an $n$ such that $b_n > M$.

Aladdin has several gold ingots, and sometimes he asks the Genie to give him more. The Genie first adds a thousand ingots, but then takes half of the total number. Could it be possible that after asking the Genie for gold ten times, the number of Aladdin’s gold ingots increased, assuming that each time the Genie took half, he took an integer number of ingots? (5 points) Alexandr Perepechko

In the $xOy$ system, consider the collinear points $A_i(x_i,y_i),\ 1\le i\le 4$, such that there are invertible matrices $M\in \mathcal{M}_4(\mathbb{C})$ such that $(x_1,x_2,x_3,x_4)$ and $(y_1,y_2,y_3,y_4)$ are their first two lines. Prove that the sum of the entries of $M^{-1}$ doesn't depend of $M$. [i]Marian Andronache[/i]

Show that: $$ 1+\frac{1}{4}+\frac{1}{9}+\dots+\frac{1}{2023^2}+\frac{1}{2024^2} < 2. $$

Find all integers $n$ for which both $4n + 1$ and $9n + 1$ are perfect squares.

Determine the greatest common divisor of the elements of the set \[\{n^{13}-n \; \vert \; n \in \mathbb{Z}\}.\]

There are $24$ different pencils, $4$ different colors, and $6$ pencils of each color. They were given to $6$ children in such a way that each got $4$ pencils. What is the least number of children that you can randomly choose so that you can guarantee that you have pencils of all colors. P.S. for 10 grade gives same problem with $40$ pencils, $10$ of each color and $10$ children.

How many distinct ordered triples $(x,y,z)$ satisfy the equations \begin{align*}x+2y+4z&=12 \\ xy+4yz+2xz&=22 \\ xyz&=6~~?\end{align*} $\textbf{(A) }\text{none}\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }4\qquad \textbf{(E) }6$

Let $x$, $y$, and $z$ all exceed 1 and let $w$ be a positive number such that \[\log_x w = 24,\quad \log_y w = 40 \quad\text{and}\quad \log_{xyz} w = 12.\] Find $\log_z w$.

Let $ABC$ be an acute scalene triangle. Let $X$ and $Y$ be two distinct interior points of the segment $BC$ such that $\angle{CAX} = \angle{YAB}$. Suppose that: $1)$ $K$ and $S$ are the feet of the perpendiculars from from $B$ to the lines $AX$ and $AY$ respectively. $2)$ $T$ and $L$ are the feet of the perpendiculars from $C$ to the lines $AX$ and $AY$ respectively. Prove that $KL$ and $ST$ intersect on the line $BC$.

$a$ is irrational , but $a$ and $a^3-6a$ are roots of square polynomial with integer coefficients.Find $a$

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Let $A_1H_1,A_2H_2,A_3H_3$ be altitudes and $A_1L_1,A_2L_2,A_3L_3$ be bisectors of acute-angles triangle $A_1A_2A_3$. Prove the inequality $S(L_1L_2L_3)\ge S(H_1H_2H_3)$ where $S$ stands for the area of a triangle. [i](B. Bazylev)[/i]

A trawler is about to fish in territorial waters of a neighboring country, for what he has no licence. Whenever he throws the net, the coast-guard may stop him with the probability $1/k$, where $k$ is a fixed positive integer. Each throw brings him a fish landing of a fixed weight. However, if the coast-guard stops him, they will confiscate his entire fish landing and demand him to leave the country. The trawler plans to throw the net $n$ times before he returns to territorial waters in his country. Find $n$ for which his expected profit is maximal.

$f,g$ are two permutations of set $X=\{1,\dots,n\}$. We say $f,g$ have common points iff there is a $k\in X$ that $f(k)=g(k)$. a) If $m>\frac{n}{2}$, prove that there are $m$ permutations $f_{1},f_{2},\dots,f_{m}$ from $X$ that for each permutation $f\in X$, there is an index $i$ that $f,f_{i}$ have common points. b) Prove that if $m\leq\frac{n}{2}$, we can not find permutations $f_{1},f_{2},\dots,f_{m}$ satisfying the above condition.

Two straight lines are drawn on a plane, intersecting at an angle of $40^o$. A circle with center at point $O$ touches these lines. Let's consider a line, different from the given ones, tangent to the same circle and intersecting the given lines at points $B$ and $C$. What can the angle $\angle BOC$ be equal to?

Let $a_1,a_2,a_3,a_4$ be the sides of an arbitrary quadrilateral of perimeter $2s$. Prove that \[ \sum\limits^4_{i=1} \dfrac 1{a_i+s} \leq \dfrac 29\sum\limits_{1\leq i<j\leq 4} \dfrac 1{ \sqrt { (s-a_i)(s-a_j)}}. \] When does the equality hold?

Find all polynomials $P\in \mathbb C[X]$ such that \[P(X^{2})=P(X)^{2}+2P(X)\]

A model used to estimate the time it will take to hike to the top of the mountain on a trail is of the form $T = aL + bG,$ where $a$ and $b$ are constants, $T$ is the time in minutes, $L$ is the length of the trail in miles, and $G$ is the altitude gain in feet. The model estimates that it will take $69$ minutes to hike to the top if a trail is $1.5$ miles long and ascends $800$ feet, as well as if a trail is $1.2$ miles long and ascends $1100$ feet. How many minutes does the model estimate it will take to hike to the top if the trail is $4.2$ miles long and ascends $4000$ feet? $\textbf{(A) } 240 \qquad \textbf{(B) } 246 \qquad \textbf{(C) } 252 \qquad \textbf{(D) } 258 \qquad \textbf{(E) } 264$

Let scalene triangle $ABC$ have circumcenter $O$ and incenter $I$. Its incircle $\omega$ is tangent to sides $BC,CA,$ and $AB$ at $D,E,$ and $F$, respectively. Let $P$ be the foot of the altitude from $D$ to $EF$, and let line $DP$ intersect $\omega$ again at $Q \ne D$. The line $OI$ intersects the altitude from $A$ to$ BC$ at $T$. Given that $OI \|BC,$ show that $PQ=PT$.

On top of a rectangular card with sides of length $1$ and $2+\sqrt{3}$, an identical card is placed so that two of their diagonals line up, as shown ($\overline{AC}$, in this case). [asy] defaultpen(fontsize(12)+0.85); size(150); real h=2.25; pair C=origin,B=(0,h),A=(1,h),D=(1,0),Dp=reflect(A,C)*D,Bp=reflect(A,C)*B; pair L=extension(A,Dp,B,C),R=extension(Bp,C,A,D); draw(L--B--A--Dp--C--Bp--A); draw(C--D--R); draw(L--C^^R--A,dashed+0.6); draw(A--C,black+0.6); dot("$C$",C,2*dir(C-R)); dot("$A$",A,1.5*dir(A-L)); dot("$B$",B,dir(B-R)); [/asy] Continue the process, adding a third card to the second, and so on, lining up successive diagonals after rotating clockwise. In total, how many cards must be used until a vertex of a new card lands exactly on the vertex labeled $B$ in the figure? $\textbf{(A) }6\qquad\textbf{(B) }8\qquad\textbf{(C) }10\qquad\textbf{(D) }12\qquad\textbf{(E) }\text{No new vertex will land on }B.$