For a positive integer $n$, let $g(n) = \left[ \displaystyle \frac{2024}{n} \right]$. Find the value of $$\sum_{n = 1}^{2024}\left(1 - (-1)^{g(n)}\right)\phi(n).$$

Let $BM$ be a median of nonisosceles right-angled triangle $ABC$ ($\angle B = 90^o$), and $Ha, Hc$ be the orthocenters of triangles $ABM, CBM$ respectively. Prove that lines $AH_c$ and $CH_a$ meet on the medial line of triangle $ABC$. (D. Svhetsov)

Nine cards can be numbered using positive half-integers $(1/2, 1, 3/2, 2, 5/2, \dots )$ so that the sum of the numbers on a randomly chosen pair of cards gives an integer from $2$ to $12$ with the same frequency of occurrence as rolling that sum on two standard dice. What are the numbers on the nine cards and how often does each number appear on the cards?

Solve the equation $ \sin^3x \cos 3x \plus{} \cos^3x \sin 3x \equal{} \frac{3}{8}$.

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

There are $ n \geq4 $ points on the plane, the distance between any two of which is an integer. Prove that there are at least $ \frac {1} {6} $ distances, each of which is divisible by $3$.

Let be a real number $ r $ and two functions $ f:[r,\infty )\longrightarrow\mathbb{R} , F_1:(r,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties. $ \text{(i)} f $ has Darboux's intermediate value property. $ \text{(ii)} F_1$ is differentiable and $ F'_1=f\bigg|_{(r,\infty )} $ [b]1)[/b] Provide an example of what $ f,F_1 $ could be if $ f $ hasn't a lateral limit at $ r, $ and $ F_1 $ has lateral limit at $ r. $ Moreover, if $ f $ has lateral limit at $ r, $ show that [b]2)[/b] $ F_1 $ has a finite lateral limit at $ r. $ [b]3)[/b] the function $ F:[r,\infty )\longrightarrow\mathbb{R} $ defined as $$ F(x)=\left\{ \begin{matrix} F_1(x) ,& \quad x\in (r,\infty ) \\ \lim_{\stackrel{x\to r}{x>r}} F_1(x), & \quad x=r \end{matrix} \right. $$ is a primitive of $ f. $

Let n be a fixed prime number >3. A triangle is said to be admissible if the measure of each of its angles is of the form $\frac{m\cdot 180^{\circ}}{n}$ for some positive integer m. We are given one admissible triangle. Every minute we cut one of the triangles we already have into two admissible triangles so that no two of the triangles we have after cutting are similar. After some time, it turns out that no more cuttings are possible. Prove that at this moment, the triangles we have contain all possible admissible triangles (we do not distinguish between triangles which have same sets of angles, i.e. similar triangles).

A rock travelled through an n x n board, stepping at each turn to the cell neighbouring the previous one by a side, so that each cell was visited once. Bob has put the integer numbers from 1 to n^2 into the cells, corresponding to the order in which the rook has passed them. Let M be the greatest difference of the numbers in neighbouring by side cells. What is the minimal possible value of M?

Given a strictly increasing infinite sequence of natural numbers $ a_1, $ $ a_2, $ $ a_3, $ $ \ldots $. It is known that $ a_n \leq n + 2020 $ and the number $ n ^ 3 a_n - 1 $ is divisible by $ a_ {n + 1} $ for all natural numbers $ n $. Prove that $ a_n = n $ for all natural numbers $ n $.

We'll call a positive integer "almost prime", if it is not divisible by any prime from the interval $[3,19]$. We'll call a number "very non-prime", if it has at least 2 primes from interval $[3,19]$ dividing it. What is the greatest amount of almost prime numbers can be selected, such that the sum of any two of them is a very non-prime number? [I]Proposed by S. Berlov, S. Ivanov[/i]

In a chess tournament , every two participants play each other exactly once. A win is worth one point , a draw is worth half a point and a loss is worth zero points. Looking back at the end of the tournament, a game is called an upset if the total number of points obtained by the winner of that game is less than the total number of points obtained by the loser of that game. (a) Prove that the number of upsets is always strictly less than three-quarters of the total number of games in the tournament. (b) Prove that three-quarters cannot be replaced by a smaller number. (S Tokarev) PS. part (a) for Juniors, both parts for Seniors

Given a cyclic quadrilateral $ABCD$, define $E$ as $AD \cap BC$ and $F$ as $AB \cap CD$. Let $\Omega_A$ be the circle passing through $A, D$ and tangent to $AB$, and let its center be $O_A$. Let $\Gamma_B$ be the circle passing through $B, C$ and tangent to $AB$, and let its center be $O_B$. Let $\Gamma_C$ be the circle passing through $B, C$ and tangent to $CD$, and let its center be $O_C$. Let $\Omega_D$ be the circle passing through $A, D$ and tangent to $CD$, and let its center be $O_D$. Prove that $O_AO_BO_CO_D$ is cyclic, and prove that it's center lies on $EF$.

Let $ABC$ be an acute-angled triangle with altitude $AT = h$. The line passing through its circumcenter $O$ and incenter $I$ meets the sides $AB$ and $AC$ at points $F$ and $N$, respectively. It is known that $BFNC$ is a cyclic quadrilateral. Find the sum of the distances from the orthocenter of $ABC$ to its vertices.

A chessboard with some unit squares marked is called a $\textit{good board}$ if for any pair of rows \((s, t)\), a rook placed on a marked square in row \(s\) can reach a marked square in row \(t\) in several moves by only moving to marked squares above, below, or to the right of its current position. Consider a chessboard with 220 rows and 12 columns, where exactly 9 unit squares in each row are marked. Regardless of how the marked squares are chosen, if it is possible to delete \(k\) columns and rearrange the remaining columns to form a $\textit{good board}$ determine the maximum possible value of \(k\).

In the triangle $ ABC $, the bisectors of the internal and external angles are drawn at the vertices $ A $ and $ B $. Prove that the orthogonal projections of the point $ C $ on these bisectors lie on one straight line.

Three metals, $A, B $and $C$, with solutions of their respective cations are tested in a voltaic cell with the following results: $A$ and $B$: $A$ is the cathode $B$ and $C$: $C$ is the cathode $A$ and $C$: $A$ is the anode What is the order of the reduction potentials from highest to lowest for the cations of these metals? $ \textbf{(A)}\ A>B>C \qquad\textbf{(B)}\ B>C>A\qquad$ ${\textbf{(C)}\ C>A>B\qquad\textbf{(D}}\ B>A>C\qquad$

Let $ABC$ be a triangle such that $\angle A=30^\circ$ and $\angle B=80^\circ$. Let $D$ and $E$ be points on sides $AC$ and $BC$ respectively so that $\angle ABD=\angle DBC$ and $DE\parallel AB$. Determine the measure of $\angle EAC$.

Let $\bigtriangleup ABC$ be a triangle and $D$ be a point in line $BC$ such that $AD$ bisects $\angle BAC$. Furthermore, let $F$ and $G$ be points on the circumcircle of $\bigtriangleup ABC$ and $E\neq D$ point in line $BC$ such that $AF=AE=AD=AG$. If $X$ and $Y$ are the feet of perpendiculars from $D$ to $EF$ and $EG,$ respectively. Prove that $XY\parallel AD$.

The real numbers x and у satisfy the equations $$\begin{cases} \sqrt{3x}\left(1+\dfrac{1}{x+y}\right)=2 \\ \\ \sqrt{7y}\left(1-\dfrac{1}{x+y}\right)=4\sqrt2 \end{cases}$$ Find the numerical value of the ratio $y/x$.

Determine all positive integers $n$ for which there exist pairwise distinct positive real numbers $a_1, a_2, \cdots, a_n$ satisfying $\displaystyle \left\{a_i+\frac{(-1)^i}{a_i}\mid 1\leq i \leq n\right\}=\{a_i\mid 1\leq i \leq n\}$

Per and Kari each have $n$ pieces of paper. They both write down the numbers from $1$ to $2n$ in an arbitrary order, one number on each side. Afterwards, they place the pieces of paper on a table showing one side. Prove that they can always place them so that all the numbers from $1$ to $2n$ are visible at once.

Find all functions $f : R \to R$ satisfying the conditions: 1. $f (x + 1) \ge f (x) + 1$ for all $x \in R$ 2. $f (x y) \ge f (x)f (y)$ for all $x, y \in R$

Let $ABCD$ be a trapezoid inscribed in a unit circle with diameter $AB$. If $DC = 4AD$, compute $AD$.

Prove that there is a natural number $n > 1$ such that the product of some $n$ consecutive natural numbers is equal to the product of some $n + 100$ consecutive natural numbers.