It takes a steamer $5$ days to go from Gorky to Astrakhan downstream the Volga river and $7$ days upstream from Astrakhan to Gorky. How long will it take for a raft to float downstream from Gorky to Astrakhan?

Let $ABC$ be an acute triangle and suppose points $A, A_b, B_a, B, B_c, C_b, C, C_a,$ and $A_c$ lie on its perimeter in this order. Let $A_1 \neq A$ be the second intersection point of the circumcircles of triangles $AA_bC_a$ and $AA_cB_a$. Analogously, $B_1 \neq B$ is the second intersection point of the circumcircles of triangles $BB_cA_b$ and $BB_aC_b$, and $C_1 \neq C$ is the second intersection point of the circumcircles of triangles $CC_aB_c$ and $CC_bA_c$. Suppose that the points $A_1, B_1,$ and $C_1$ are all distinct, lie inside the triangle $ABC$, and do not lie on a single line. Prove that lines $AA_1, BB_1, CC_1,$ and the circumcircle of triangle $A_1B_1C_1$ all pass through a common point. [i]Josef Tkadlec (Czech Republic), Patrik Bak (Slovakia)[/i]

A tortoise challenges a hare to a race. The hare eagerly agrees and quickly runs ahead, leaving the slow-moving tortoise behind. Confident that he will win, the hare stops to take a nap. Meanwhile, the tortoise walks at a slow steady pace for the entire race. The hare awakes and runs to the finish line, only to find the tortoise already there. Which of the following graphs matches the description of the race, showing the distance $d$ traveled by the two animals over time $t$ from start to finish?$\phantom{h}$ [asy] unitsize(0.4 cm); pair transx, transy; int i, j; int x, y; transx = (13,0); transy = (0,-9); for (i = 0; i <= 2; ++i) { for (j = 0; j <= 1; ++j) { if (i <= 1 || j <= 0) { for (x = 1; x <= 10; ++x) { draw(shift(i*transx + j*transy)*((x,0)--(x,5)),gray(0.7) + dashed); } for (y = 1; y <= 5; ++y) { draw(shift(i*transx + j*transy)*((0,y)--(10,y)),gray(0.7) + dashed); } draw(shift(i*transx + j*transy)*((0,0)--(11,0)),Arrow(6)); draw(shift(i*transx + j*transy)*((0,0)--(0,6)),Arrow(6)); label("time", (5,-0.5) + i*transx + j*transy); label(rotate(90)*"distance", (-0.5,2.5) + i*transx + j*transy); } }} draw((0,0)--(1.5,2.5)--(7.5,2.5)--(9,5),linewidth(1.5*bp)); draw((0,0)--(10,5),linewidth(1.5*bp)); draw(shift(transx)*((0,0)--(2.5,2.5)--(7.5,2.5)--(10,5)),linewidth(1.5*bp)); draw(shift(transx)*((0,0)--(9,5)),linewidth(1.5*bp)); draw(shift(2*transx)*((0,0)--(2.5,3)--(7,2)--(10,5)),linewidth(1.5*bp)); draw(shift(2*transx)*((0,0)--(9,5)),linewidth(1.5*bp)); draw(shift(transy)*((0,0)--(2.5,2.5)--(6.5,2.5)--(9,5)),linewidth(1.5*bp)); draw(shift(transy)*((0,0)--(7.5,2)--(10,5)),linewidth(1.5*bp)); draw(shift(transx + transy)*((0,0)--(2.5,2)--(7.5,3)--(10,5)),linewidth(1.5*bp)); draw(shift(transx + transy)*((0,0)--(9,5)),linewidth(1.5*bp)); label("(A)", (-1,6)); label("(B)", (-1,6) + transx); label("(C)", (-1,6) + 2*transx); label("(D)", (-1,6) + transy); label("(E)", (-1,6) + transx + transy); [/asy]

Let $G$ be the centroid of a right-angled triangle $ABC$ with $\angle BCA = 90^\circ$. Let $P$ be the point on ray $AG$ such that $\angle CPA = \angle CAB$, and let $Q$ be the point on ray $BG$ such that $\angle CQB = \angle ABC$. Prove that the circumcircles of triangles $AQG$ and $BPG$ meet at a point on side $AB$.

Let $ Ax,By$ be two perpendicular semi-straight lines, being not complanar, (non-coplanar rays) such that $ AB$ is the their common perpendicular, and let $ M$ and $ N$ be the two variable points on $ Ax$ and $ Bx,$ respectively, such that $ AM \plus{} BN \equal{} MN.$ [b](a)[/b] Prove that there exist infinitely many lines being co-planar with each of the straight lines $ MN.$ [b](b)[/b] Prove that there exist infinitely many rotations around a fixed axis $ \delta$ mapping the line $ Ax$ onto a line coplanar with each of the lines $ MN.$

Two-thirds of the people in a room are seated in three-fourths of the chairs. The rest of the people are standing. If there are $6$ empty chairs, how many people are in the room? $\textbf{(A)}\ 12\qquad \textbf{(B)}\ 18\qquad \textbf{(C)}\ 24\qquad \textbf{(D)}\ 27\qquad \textbf{(E)}\ 36$

Let $A$, $B$ and $C$ be points lying on a circle $\Gamma$ with centre $O$. Assume that $\angle ABC > 90$. Let $D$ be the point of intersection of the line $AB$ with the line perpendicular to $AC$ at $C$. Let $l$ be the line through $D$ which is perpendicular to $AO$. Let $E$ be the point of intersection of $l$ with the line $AC$, and let $F$ be the point of intersection of $\Gamma$ with $l$ that lies between $D$ and $E$. Prove that the circumcircles of triangles $BFE$ and $CFD$ are tangent at $F$.

Let $S$ be a subset of the real numbers with the following properties: $(i)$ If $x \in S$ and $y \in S$, then $x - y \in S$; $(ii)$ If $x \in S$ and $y \in S$, then $xy \in S$; $(iii)$ $S$ contains an exceptional number $x'$ such that there is no number $y$ in $S$ satisfying $x'y + x' + y = 0$; $(iv)$ If $x \in S$ and $x \neq x'$ , there is a number $y$ in $S$ such that $xy+x+y = 0$. Show that $(a)$ $S$ has more than one number in it; $(b)$ $x' \neq -1$ leads to a contradiction; $(c)$ $x \in S$ and $x \neq 0$ implies $1/x \in S$.

An integer \(n \geq 2\) is said to be [i]tuanis[/i] if, when you add the smallest prime divisor of \(n\) and the largest prime divisor of \(n\) (these divisors can be the same), you obtain an odd result. Calculate the sum of all [i]tuanis[/i] numbers that are less or equal to \(2023\).

Let $P(x)=x^n+a_1x^{n-1}+\ldots+a_n$ ($n\ge2$) be a polynomial with integer coefficients having $n$ real roots $b_1,\ldots,b_n$. Prove that for $x_0\ge\max\{b_1,\ldots,b_n\}$, $$P(x_0+1)\left(\frac1{x_0-b_1}+\ldots+\frac1{x_0-b_n}\right)\ge2n^2.$$

Suppose that $P(x)=a_1x+a_2x^2+\ldots+a_nx^n$ is a polynomial with integer coefficients, with $a_1$ odd. Suppose that $e^{P(x)}=b_0+b_1x+b_2x^2+\ldots$ for all $x.$ Prove that $b_k$ is nonzero for all $k \geq 0.$

Let $P$ be a point in the interior $\triangle ABC$, and $AD,BE,CF$ 3 concurrent cevians through $P$, with $D,E,F$ on $BC,CA,AB$. The circle with the diameter $BC$ intersects the circle with the diameter $AD$ in $D_1,D_2$. Analogously we define $E_1,E_2$ and $F_1,F_2$. Prove that $D_1,D_2,E_1,E_2,F_1,F_2$ are concylic.

A prime number has the property that however its decimal digits are permuted, the obtained number is also prime. Prove that this number has at most three different digits. Also prove a stronger statement.

A polygon $\mathcal{P}$ is drawn on the $2\text{D}$ coordinate plane. Each side of $\mathcal{P}$ is either parallel to the $x$ axis or the $y$ axis (the vertices of $\mathcal{P}$ do not have to be lattice points). Given that the interior of $\mathcal{P}$ includes the interior of the circle $x^2+y^2=2022,$ find the minimum possible perimeter of $\mathcal{P}.$

The angles of a triangle are $22.5^o, 45^o$ and $112.5^o$. Prove that inside this triangle there exists a point that is located on the median through one vertex, the angle bisector through another vertex and the altitude through the third vertex.

Let $m,\ n$ be positive integer such that $2\leq m<n$. (1) Prove the inequality as follows. \[\frac{n+1-m}{m(n+1)}<\frac{1}{m^2}+\frac{1}{(m+1)^2}+\cdots +\frac{1}{(n-1)^2}+\frac{1}{n^2}<\frac{n+1-m}{n(m-1)}\] (2) Prove the inequality as follows. \[\frac 32\leq \lim_{n\to\infty} \left(1+\frac{1}{2^2}+\cdots+\frac{1}{n^2}\right)\leq 2\] (3) Prove the inequality which is made precisely in comparison with the inequality in (2) as follows. \[\frac {29}{18}\leq \lim_{n\to\infty} \left(1+\frac{1}{2^2}+\cdots+\frac{1}{n^2}\right)\leq \frac{61}{36}\]

The sum of non-negative numbers $ x $, $ y $ and $ z $ is $3$. Prove the inequality $$ {1 \over x ^ 2 + y + z} + {1 \over x + y ^ 2 + z} + {1 \over x + y + z ^ 2} \leq 1. $$

Find all integers $b$ such that there exists a positive real number $x$ with \[ \dfrac {1}{b} = \dfrac {1}{\lfloor 2x \rfloor} + \dfrac {1}{\lfloor 5x \rfloor} \] Here, $\lfloor y \rfloor$ denotes the greatest integer that is less than or equal to $y$.

Evaluate $\int_{ 0 }^{ \infty } ( 1 + x^2 )^{-( m + 1 )} \mathrm{d}x$ where $m \in \mathbb{N} $

Let $ n$ be a positive integer. Find the number of odd coefficients of the polynomial \[ u_n(x) \equal{} (x^2 \plus{} x \plus{} 1)^n. \]

Raina the frog is playing a game in a circular pond with six lilypads around its perimeter numbered clockwise from $1$ to $6$ (so that pad $1$ is adjacent to pad $6$). She starts at pad $1$, and when she is on pad i, she may jump to one of its two adjacent pads, or any pad labeled with $j$ for which $j - i$ is even. How many jump sequences enable Raina to hop to each pad exactly once?

For $n\in\mathbb N$, define $$a_n=\frac1{\binom n1}+\frac1{\binom n2}+\ldots+\frac1{\binom nn}.$$ (a) Prove that the sequence $b_n=a_n^n$ is convergent and determine the limit. (b) Show that $\lim_{n\to\infty}b_n>\left(\frac32\right)^{\sqrt3+\sqrt2}$.

Let $x_0 = x_{101} = 0$. The numbers $x_1, x_2,...,x_{100}$ are chosen at random from the interval $[0, 1]$ uniformly and independently. Compute the probability that $2x_i \ge x_{i-1} + x_{i+1}$ for all $i = 1, 2,..., 100.$

What fraction of this square region is shaded? Stripes are equal in width, and the figure is drawn to scale. [asy] unitsize(8); fill((0,0)--(6,0)--(6,6)--(0,6)--cycle,black); fill((0,0)--(5,0)--(5,5)--(0,5)--cycle,white); fill((0,0)--(4,0)--(4,4)--(0,4)--cycle,black); fill((0,0)--(3,0)--(3,3)--(0,3)--cycle,white); fill((0,0)--(2,0)--(2,2)--(0,2)--cycle,black); fill((0,0)--(1,0)--(1,1)--(0,1)--cycle,white); draw((0,6)--(0,0)--(6,0)); [/asy] $\textbf{(A)}\ \dfrac{5}{12} \qquad \textbf{(B)}\ \dfrac{1}{2} \qquad \textbf{(C)}\ \dfrac{7}{12} \qquad \textbf{(D)}\ \dfrac{2}{3} \qquad \textbf{(E)}\ \dfrac{5}{6}$

Points $A ,B ,C ,D$ lie on a line in this order. Draw parallel lines $a$ and $b$ through $A$ and $B$, respectively, and parallel lines $c$ and $d$ through $C$ and $D$, respectively, such that their points of intersection are vertices of a square. Prove that the side length of this square does not depend on the length of segment $BC$.