Point $ I_1$ is the reflection of incentre $ I$ of triangle $ ABC$ across the side $ BC$. The circumcircle of $ BCI_1$ intersects the line $ II_1$ again at point $ P$. It is known that $ P$ lies outside the incircle of the triangle $ ABC$. Two tangents drawn from $ P$ to the latter circle touch it at points $ X$ and $ Y$. Prove that the line $ XY$ contains a medial line of the triangle $ ABC$. [i]Author: L. Emelyanov[/i]

Find the largest positive integer $k{}$ for which there exists a convex polyhedron $\mathcal{P}$ with 2022 edges, which satisfies the following properties: [list] [*]The degrees of the vertices of $\mathcal{P}$ don’t differ by more than one, and [*]It is possible to colour the edges of $\mathcal{P}$ with $k{}$ colours such that for every colour $c{}$, and every pair of vertices $(v_1, v_2)$ of $\mathcal{P}$, there is a monochromatic path between $v_1$ and $v_2$ in the colour $c{}$. [/list] [i]Viktor Simjanoski, Macedonia[/i]

Let $ABCD$ be a rectangle with $BC=3AB$. Show that if $P,Q$ are the points on side $BC$ with $BP = PQ = QC$, then \[\angle DBC+\angle DPC = \angle DQC.\]

Let $ABC$ be an acute triangle and $D$ be the foot of the altiutude from $A$ on $BC$, $E$ and $F$ are the midpoints of $BD$ and $DC$ respectively. $O$ and $Q$ are the circumcenters of the triangles $\vartriangle BF$ and $\vartriangle ACE$ respectively. $P$ is the intersection point of $OE$ and $QF$, show that $PB = PC$.

Let $ABC$ be an acute triangle, where $AB$ is the smallest side and let $D$ be the midpoint of $AB$. Let $P$ be a point in the interior of the triangle $ABC$ such that $\angle CAP = \angle CBP = \angle ACB$. From the point $P$, we draw perpendicular lines on $BC$ and $AC$ where the intersection point with $BC$ is $M$, and with $AC$ is $N$ . Through the point $M$ we draw a line parallel to $AC$, and through $N$ parallel to $BC$. These lines intercept at the point $K$. Prove that $D$ is the center of the circumscribed circle for the triangle $MNK$.

Daud want to paint some faces of a cube with green paint. At least one face must be painted. How many ways are there for him to paint the cube? Note: Two colorings are considered the same if one can be obtained from the other by rotation.

Consider the following one-person game: A player starts with score $0$ and writes the number $20$ on an empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers (call them $b$ and $c$) such that $b + c = a$. The player then adds $b\times c$ to her score. She repeats the step several times until she ends up with all $1$'s on the whiteboard. Then the game is over, and the final score is calculated. Let $M, m$ be the maximum and minimum final score that can be possibly obtained respectively. Find $M-m$.

Consider a sequence of positive integers $x_n$ such that: \[(\text{A})\ x_{2n+1}=4x_n+2n+2 \] \[(\text{B})\ x_{3n+\color[rgb]{0.9529,0.0980,0.0118}2}=3x_{n+1}+6x_n \] for all $n\ge 0$. Prove that \[(\text{C})\ x_{3n-1}=x_{n+2}-2x_{n+1}+10x_n \] for all $n\ge 0$.

For a nonisosceles triangle $ABC$, consider the altitude from vertex $A$ and two bisectrices from remaining vertices. Prove that the circumcircle of the triangle formed by these three lines touches the bisectrix from vertex $A$.

Let $x_0 = 5$ and $x_{n+1} = x_n + \frac{1}{x_n} \ (n = 0, 1, 2, \ldots )$. Prove that \[45 < x_{1000} < 45. 1.\]

Let $p$ be a polynomial with degree less than $4$ such that $p(x)$ attains a maximum at $x = 1$. If $p(1) = p(2) = 5$, find $p(10)$.

Let $\alpha=0.d_{1}d_{2}d_{3} \cdots$ be a decimal representation of a real number between $0$ and $1$. Let $r$ be a real number with $\vert r \vert<1$. [list=a][*] If $\alpha$ and $r$ are rational, must $\sum_{i=1}^{\infty} d_{i}r^{i}$ be rational? [*] If $\sum_{i=1}^{\infty} d_{i}r^{i}$ and $r$ are rational, $\alpha$ must be rational? [/list]

Find the triple of positive integers $(x,y,z)$ with $z$ least possible for which there are positive integers $a, b, c, d$ with the following properties: (i) $x^y = a^b = c^d$ and $x > a > c$ (ii) $z = ab = cd$ (iii) $x + y = a + b$.

Some polygon can be divided into two equal parts by three different ways. Is it certainly valid that this polygon has an axis or a center of symmetry?

The equation $ x^3\minus{}ax^2\plus{}bx\minus{}c\equal{}0$ has three (not necessarily different) positive real roots. Find the minimal possible value of $ \frac{1\plus{}a\plus{}b\plus{}c}{3\plus{}2a\plus{}b}\minus{}\frac{c}{b}$.

Let $I\subseteq \mathbb{R}$ be an open interval and $f:I\to\mathbb{R}$ a strictly monotonous function. Prove that for all $c\in I$ there exist $a,b\in I$ such that $c\in (a,b)$ and \[\int_a^bf(x) \ dx=f(c)\cdot (b-a).\]

A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$

Find all natural two digit numbers such that when you substract by seven times the sum of its digit from the number you get a prime number.

Determine all pairs $(x, y)$ of positive integers satisfying $x + y + 1 | 2xy$ and $ x + y - 1 | x^2 + y^2 - 1$.

On a table, we have ten thousand matches, two of which are inside a bowl. Anna and Bernd play the following game: They alternate taking turns and Anna begins. A turn consists of counting the matches in the bowl, choosing a proper divisor $d$ of this number and adding $d$ matches to the bowl. The game ends when more than $2024$ matches are in the bowl. The person who played the last turn wins. Prove that Anna can win independently of how Bernd plays. [i](Richard Henner)[/i]

Let $ A\equal{}(a_{ij})_{1\leq i,j\leq n}$ be a real $ n\times n$ matrix, such that $ a_{ij} \plus{} a_{ji} \equal{} 0$, for all $ i,j$. Prove that for all non-negative real numbers $ x,y$ we have \[ \det(A\plus{}xI_n)\cdot \det(A\plus{}yI_n) \geq \det (A\plus{}\sqrt{xy}I_n)^2.\]

Let $a$ and $b$ be two positive real numbers such that $a^{2007} = a + 1$ and $b^{4014} = b + 3a$. Determine whether $a > b$ or $b > a$.

Each of the following four large congruent squares is subdivided into combinations of congruent triangles or rectangles and is partially [b]bolded[/b]. What percent of the total area is partially bolded? [asy] import graph; size(7.01cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-0.42,xmax=14.59,ymin=-10.08,ymax=5.26; pair A=(0,0), B=(4,0), C=(0,4), D=(4,4), F=(2,0), G=(3,0), H=(1,4), I=(2,4), J=(3,4), K=(0,-2), L=(4,-2), M=(0,-6), O=(0,-4), P=(4,-4), Q=(2,-2), R=(2,-6), T=(6,4), U=(10,0), V=(10,4), Z=(10,2), A_1=(8,4), B_1=(8,0), C_1=(6,-2), D_1=(10,-2), E_1=(6,-6), F_1=(10,-6), G_1=(6,-4), H_1=(10,-4), I_1=(8,-2), J_1=(8,-6), K_1=(8,-4); draw(C--H--(1,0)--A--cycle,linewidth(1.6)); draw(M--O--Q--R--cycle,linewidth(1.6)); draw(A_1--V--Z--cycle,linewidth(1.6)); draw(G_1--K_1--J_1--E_1--cycle,linewidth(1.6)); draw(C--D); draw(D--B); draw(B--A); draw(A--C); draw(H--(1,0)); draw(I--F); draw(J--G); draw(C--H,linewidth(1.6)); draw(H--(1,0),linewidth(1.6)); draw((1,0)--A,linewidth(1.6)); draw(A--C,linewidth(1.6)); draw(K--L); draw((4,-6)--L); draw((4,-6)--M); draw(M--K); draw(O--P); draw(Q--R); draw(O--Q); draw(M--O,linewidth(1.6)); draw(O--Q,linewidth(1.6)); draw(Q--R,linewidth(1.6)); draw(R--M,linewidth(1.6)); draw(T--V); draw(V--U); draw(U--(6,0)); draw((6,0)--T); draw((6,2)--Z); draw(A_1--B_1); draw(A_1--Z); draw(A_1--V,linewidth(1.6)); draw(V--Z,linewidth(1.6)); draw(Z--A_1,linewidth(1.6)); draw(C_1--D_1); draw(D_1--F_1); draw(F_1--E_1); draw(E_1--C_1); draw(G_1--H_1); draw(I_1--J_1); draw(G_1--K_1,linewidth(1.6)); draw(K_1--J_1,linewidth(1.6)); draw(J_1--E_1,linewidth(1.6)); draw(E_1--G_1,linewidth(1.6)); dot(A,linewidth(1pt)+ds); dot(B,linewidth(1pt)+ds); dot(C,linewidth(1pt)+ds); dot(D,linewidth(1pt)+ds); dot((1,0),linewidth(1pt)+ds); dot(F,linewidth(1pt)+ds); dot(G,linewidth(1pt)+ds); dot(H,linewidth(1pt)+ds); dot(I,linewidth(1pt)+ds); dot(J,linewidth(1pt)+ds); dot(K,linewidth(1pt)+ds); dot(L,linewidth(1pt)+ds); dot(M,linewidth(1pt)+ds); dot((4,-6),linewidth(1pt)+ds); dot(O,linewidth(1pt)+ds); dot(P,linewidth(1pt)+ds); dot(Q,linewidth(1pt)+ds); dot(R,linewidth(1pt)+ds); dot((6,0),linewidth(1pt)+ds); dot(T,linewidth(1pt)+ds); dot(U,linewidth(1pt)+ds); dot(V,linewidth(1pt)+ds); dot((6,2),linewidth(1pt)+ds); dot(Z,linewidth(1pt)+ds); dot(A_1,linewidth(1pt)+ds); dot(B_1,linewidth(1pt)+ds); dot(C_1,linewidth(1pt)+ds); dot(D_1,linewidth(1pt)+ds); dot(E_1,linewidth(1pt)+ds); dot(F_1,linewidth(1pt)+ds); dot(G_1,linewidth(1pt)+ds); dot(H_1,linewidth(1pt)+ds); dot(I_1,linewidth(1pt)+ds); dot(J_1,linewidth(1pt)+ds); dot(K_1,linewidth(1pt)+ds); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy] $ \textbf{(A)}12\frac 12\qquad\textbf{(B)}20\qquad\textbf{(C)}25\qquad\textbf{(D)}33 \frac 13\qquad\textbf{(E)}37\frac 12 $

Six teams participate in a hockey tournament. Each team plays exactly once against each other team. A team is awarded $3$ points for each game they win, $1$ point for each draw, and $0$ points for each game they lose. After the tournament, a ranking is made. There are no ties in the list. Moreover, it turns out that each team (except the very last team) has exactly $2$ points more than the team ranking one place lower. Prove that the team that finished fourth won exactly two games.

In the rectangle in the figure, we are going to write $12$ numbers from $1$ to $9$, so that the sum of the four numbers written in each line is the same and the sum of the three is also equal numbers in each column. Six numbers have already been written. Determine the sum of the numbers of each row and every column. [img]https://cdn.artofproblemsolving.com/attachments/7/f/3db9ded1e703c5392f258e1608a1800760d78c.png[/img]