To open the magic chest, one needs to say a magic code of length $n$ consisting of digits $0, 1, 2, 3, 4, 5, 6, 7, 8, 9.$ Each time Griphook tells the chest a code it thinks up, the chest's talkative guardian responds by saying the number of digits in that code that match the magic code. (For example, if the magic code is $0423$ and Griphook says $3442,$ the chest's talkative guard will say $1$). Prove that there exists a number $k$ such that for any natural number $n \geq k,$ Griphook can find the magic code by checking at most $4n-2023$ times, regardless of what the magic code of the box is.

If the $x$-coordinate $\overline{x}$ of the center of mass of the area lying between the $x$-axis and the curve $y=f(x)$ with $f(x)>0$, and between the lines $x=0$ and $x=a$ is given by $$\overline{x}=g(a),$$ show that $$f(x)=A\cdot \frac{g'(x)}{(x-g(x))^{2}} \cdot e^{\int \frac{1}{t-g(t)} dt},$$ where $A$ is a positive constant.

Prove that the number $\tan \frac{\pi}{3^n}$ is irrational for any natural $n$.

Find all ordered triples $ (x, y, z)$ of real numbers such that \[ 5 \left(x \plus{} \frac{1}{x} \right) \equal{} 12 \left(y \plus{} \frac{1}{y} \right) \equal{} 13 \left(z \plus{} \frac{1}{z} \right),\] and \[ xy \plus{} yz \plus{} zy \equal{} 1.\]

There is a $8\times 8$ table, drawn in a plane and painted in a chess board fashion. Peter mentally chooses a square and an interior point in it. Basil can draws any polygon (without self-intersections) in the plane and ask Peter whether the chosen point is inside or outside this polygon. What is the minimal number of questions suffcient to determine whether the chosen point is black or white?

If $n$ is positive integer and $p, q, r$ are primes solve the system: $pqr=n$ and $(p+1)(q+1)r=n+138$

Determine the smallest positive integer $k{}$ satisfying the following condition: For any configuration of chess queens on a $100 \times 100$ chequered board, the queens can be coloured one of $k$ colours so that no two queens of the same colour attack each other. [i]Russia, Sergei Avgustinovich and Dmitry Khramtsov[/i]

Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n$, where $m$ and $n$ are relatively prime positive integers. What are the last three digits of $m + n$?

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

Given are two fixed lines that meet at a point $O$ and form an acute angle with measure $\alpha$. Let $P$ be a fixed point, internal for the angle. The points $M, N$ vary on the two lines (one point on each line) such that $\angle MPN=180^{\circ}-\alpha$ and $P$ is internal for $\triangle MON$. Show that the foot of the perpendicular from $P$ to $MN$ lies on a fixed circle.

In the addition problem \[ \setlength{\tabcolsep}{1mm}\begin{tabular}{cccccc}& W & H & I & T & E\\ + & W & A & T & E & R \\\hline P & I & C & N & I & C\end{tabular} \] each distinct letter represents a different digit. Find the number represented by the answer PICNIC.

A circle $\omega$ and a point $T$ outside the circle is given. Let a tangent from $T$ to $\omega$ touch $\omega$ at $A$, and take points $B,C$ lying on $\omega$ such that $T,B,C$ are colinear. The bisector of $\angle ATC$ intersects $AB$ and $AC$ at $P$ and $Q$,respectively. Prove that $PA=\sqrt{PB\cdot QC}$

In $\triangle ABC$, $\angle ACB=3\angle BAC$, $BC=5$, $AB=11$. Find $AC$

Let $x,y\in\mathbb{R}$ such that $x>2, y>3$. Find the minimum value of $\frac{(x+y)^2}{\sqrt{x^2-4}+\sqrt{y^2-9}}$

The real numbers $a,b,c$ with $bc\neq0$ satisfy $\frac{1-c^2}{bc}\geq0.$ Prove that $10(a^2+b^2+c^2-bc^3)\geq2ab+5ac.$

Let $ABC$ be an equilateral triangle with centre $O$. A line through $C$ meets the circumcircle of triangle $AOB$ at points $D$ and $E$. Prove that points $A, O$ and the midpoints of segments $BD, BE$ are concyclic.

A sequence of polynomials is defined by the recursion $P_1(x) = x+1$ and$$P_{n}(x) = \frac{(P_{n-1}(x)+1)^5 - (P_{n-1}(-x)+1)^5}{2}$$for all $n \geq 2$. Find the remainder when $P_{2022}(1)$ is divided by $1000$. [i]Proposed by [b]treemath[/b][/i]

Let $a_1,a_2,\ldots,a_{2n}$ be positive real numbers such that $a_ja_{n+j}=1$ for the values $j=1,2,\ldots,n$. [list] a. Prove that either the average of the numbers $a_1,a_2,\ldots,a_n$ is at least 1 or the average of the numbers $a_{n+1},a_{n+2},\ldots,a_{2n}$ is at least 1. b. Assuming that $n\ge2$, prove that there exist two distinct numbers $j,k$ in the set $\{1,2,\ldots,2n\}$ such that \[|a_j-a_k|<\frac{1}{n-1}.\] [/list]

In the plane, there is a figure in the form of an $L$-tromino, which is composed of $3$ unit squares, which we will denote by $\Phi_0$. On every move, we choose an arbitrary straight line in the plane and using it we construct a new figure. The $\Phi_n$, obtained in the $n$-th move, is obtained as the union of the figure $\Phi_{n-1}$ and its axial reflection with respect to the chosen line. Also, for the move to be valid, it is necessary that the surface of the newly obtained piece to be twice as large as the previous one. Is it possible to cover the whole plane in that process?

Let $ABCD$ be a cyclic quadrilateral with $AB<CD$. The diagonals intersect at the point $F$ and lines $AD$ and $BC$ intersect at the point $E$. Let $K$ and $L$ be the orthogonal projections of $F$ onto lines $AD$ and $BC$ respectively, and let $M$, $S$ and $T$ be the midpoints of $EF$, $CF$ and $DF$ respectively. Prove that the second intersection point of the circumcircles of triangles $MKT$ and $MLS$ lies on the segment $CD$. [i](Greece - Silouanos Brazitikos)[/i]

Let $n$ be a positive integer. Suppose that $A,B,$ and $M$ are $n\times n$ matrices with real entries such that $AM=MB,$ and such that $A$ and $B$ have the same characteristic polynomial. Prove that $\det(A-MX)=\det(B-XM)$ for every $n\times n$ matrix $X$ with real entries.

If the solutions of the equation $x^2+px+q=0$ are the cubes of the solutions of the equation $x^2+mx+n=0$, then $\textbf{(A) }p=m^3+3mn\qquad\textbf{(B) }p=m^3-3mn\qquad$ $\textbf{(C) }p+q=m^3\qquad\textbf{(D) }\left(\frac{m}{n}\right)^2=\frac{p}{q}\qquad \textbf{(E) }\text{none of these}$

The quadrilateral ABCD is inscribed in a circle which has diameter BD. Points A’ and B’ are symmetric to A and B with respect to the line BD and AC respectively. If the lines A’C, BD intersect at P and AC, B’D intersect at Q, prove that PQ is perpendicular to AC.

A function $f : R \to R$ satisfy the functional equation $f(x + 2y) + 2f(y - 2x) = 3x -4y + 6$ for all reals $x, y$. Compute $f(2548)$.

Let $n \ne 0$ be a natural number. A sequence of numbers is briefly called a sequence “$F_n$” if $n$ different numbers $z_1$, $z_2$, $...$, $z_n$ exist so that the following conditions are fulfilled: (1) Each term of the sequence is one of the numbers $z_1$, $z_2$, $...$, $z_n$. (2) Each of the numbers $z_1$, $z_2$, $...$, $z_n$ occurs at least once in the sequence. (3) Any two immediately consecutive members of the sequence are different numbers. (4) No subsequence of the sequence has the form $\{a, b, a, b\}$ with $a \ne b$. Note: A subsequence of a given sequence $\{x_1, x_2, x_3, ...\}$ or $\{x_1, x_2, x_3, ..., x_s\}$ is called any sequence of the form $\{x_{m1}, x_{m2}, x_{m3}, ...\}$ or $\{x_{m1}, x_{m2}, x_{m3}, ..., x_{mt}\}$ with natural numbers $m_1 < m_2 < m_3 < ...$ Answer the following questions: a) Given $n$, are there sequences $F_n$ of arbitrarily long length? b) If question (a) is answered in the negative for an $n$: What is the largest possible number of terms that a sequence $F_n$ can have (given $n$)?