The integers from $1$ to $2022$ are written on cards placed in a row on a table. Each number appears only once and each card shows exactly one number. Esmeralda performs consecutively the following operations $1011$ times: • She chooses a card on the table and puts it in a box on her right. • Right after it, she picks the leftmost card on the table and puts it in a box on her left. At the end of the process, she calculates the sum of the numbers in the left box. For each initial configuration $P$ of the cards, let $S(P)$ be the maximum sum Esmeralda can achieve. Determine the number of initial configurations $P$ for which $S(P)$ achieves its least value.

Prove that for all real numbers $x, y$ holds $(x^2 + 1)(y^2 + 1) \ge 2(xy - 1)(x + y)$. For which integers $x, y$ does equality occur?

Let $ D $ be a point on the side $ BC $ (excluding its endpoints) of a triangle $ ABC $ with $ AB>AC, $ such that $ \frac{\angle BAD}{\angle BAC} $ is a rational number. Prove the following: $$ \frac{\angle BAD}{\angle BAC} < \frac{AB\cdot AC - AC\cdot AD}{AB\cdot AD - AC\cdot AD} $$

Find all pairs $ (m,n)$ of integer numbers $ m,n > 1$ with property that $ mn \minus{} 1\mid n^3 \minus{} 1$.

Denote by $a_n$ the greatest number that is not divisible by $3$ and that divides $n$. Consider the sequence $s_0 = 0, s_n = a_1 +a_2+\cdots+a_n, n \in \mathbb N$. Denote by $A(n)$ the number of all sums $s_k \ (0 \leq k \leq 3^n, k \in \mathbb N_0)$ that are divisible by $3$. Prove the formula \[A(n) = 3^{n-1} + 2 \cdot 3^{(n/2)-1} \cos \left(\frac{n\pi}{6}\right), \qquad n\in \mathbb N_0.\]

There are $100$ boxes, each containing either a red cube or a blue cube. Alex has a sum of money initially, and places bets on the colour of the cube in each box in turn. The bet can be anywhere from $0$ up to everything he has at the time. After the bet has been placed, the box is opened. If Alex loses, his bet will be taken away. If he wins, he will get his bet back, plus a sum equal to the bet. Then he moves onto the next box, until he has bet on the last one, or until he runs out of money. What is the maximum factor by which he can guarantee to increase his amount of money, if he knows that the exact number of blue cubes is [list][b](a)[/b] $1$; [b](b)[/b] some integer $k$, $1 < k \leq 100$.[/list]

We start with any finite list of distinct positive integers. We may replace any pair $n, n + 1$ (not necessarily adjacent in the list) by the single integer $n-2$, now allowing negatives and repeats in the list. We may also replace any pair $n, n + 4$ by $n - 1$. We may repeat these operations as many times as we wish. Either determine the most negative integer which can appear in a list, or prove that there is no such minimum.

A three-quarter sector of a circle of radius $4$ inches together with its interior can be rolled up to form the lateral surface area of a right circular cone by taping together along the two radii shown. What is the volume of the cone in cubic inches? [asy] draw(Arc((0,0), 4, 0, 270)); draw((0,-4)--(0,0)--(4,0)); label("$4$", (2,0), S); [/asy] $\textbf{(A)}\ 3\pi \sqrt5 \qquad\textbf{(B)}\ 4\pi \sqrt3 \qquad\textbf{(C)}\ 3 \pi \sqrt7 \qquad\textbf{(D)}\ 6\pi \sqrt3 \qquad\textbf{(E)}\ 6\pi \sqrt7$

Prove that there are no positive integers $x, y$ such that: $(x + 1)^2 + (x + 2)^2 +...+ (x + 9)^2 = y^2$

Let $n$ be a positive integer. Solve the equation in $\mathbb{R}$ $$\sqrt[2n+1]{x}+\sqrt[2n+1]{x+1}+\sqrt[2n+1]{x+2}+\dots+\sqrt[2n+1]{x+n}=0.$$

Inside triangle $ABC$ there are three circles $k_1, k_2, k_3$ each of which is tangent to two sides of the triangle and to its incircle $k$. The radii of $k_1, k_2, k_3$ are $1, 4$, and $9$. Determine the radius of $k.$

Find all solutions of the equation $$p ^ 2 + q ^ 2 + 49r ^ 2 = 9k ^ 2-101$$ with $ p$, $q$ and $r$ positive prime numbers and $k$ a positive integer.

In the triangle $ABC$ the angle bisectors $AD$ and $BE$ are drawn. Prove that $\angle ACB = 60 {} ^ \circ$ if and only if $AE + BD = AB$. (Hilko Danilo)

Prove that for every positive integer $n,$ the set $\{2,3,4,\ldots,3n+1\}$ can be partitioned into $n$ triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle. [i]Proposed by Canada[/i]

Let \(\mathbb R^2\) denote the Euclidean plane. A continuous function \(f : \mathbb R^2 \to \mathbb R^2\) maps circles to circles. (A point is not a circle.) Prove that it maps lines to lines. [i]Proposed by Tony Wang[/i]

In convex quadrilateral $ ABCD$, $ CB,DA$ are external angle bisectors of $ \angle DCA,\angle CDB$, respectively. Points $ E,F$ lie on the rays $ AC,BD$ respectively such that $ CEFD$ is cyclic quadrilateral. Point $ P$ lie in the plane of quadrilateral $ ABCD$ such that $ DA,CB$ are external angle bisectors of $ \angle PDE,\angle PCF$ respectively. $ AD$ intersects $ BC$ at $ Q.$ Prove that $ P$ lies on $ AB$ if and only if $ Q$ lies on segment $ EF$.

Let $ABC$ be a triangle with $AB<AC$ and $I$ be your incenter. Let $M$ and $N$ be the midpoints of the sides $BC$ and $AC$, respectively. If the lines $AI$ and $IN$ are perpendicular, prove that the line $AI$ is tangent to the circumcircle of $\triangle IMC$.

For all positive integers $ n$ prove the inequality: $ \left( \frac{1\plus{}(n\plus{}1)^{n\plus{}1}}{n\plus{}2} \right)^{n\minus{}1}>\left( \frac{1\plus{}n^n}{n\plus{}1} \right)^n.$

Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

Find the smallest positive integer $n$ with the following property: For any integer $m$ with $0 < m < 2004$, there exists an integer $k$ such that \[\frac{m}{2004}<\frac{k}{n}<\frac{m+1}{2005}.\]

An $ n \times n$ matrix whose entries come from the set $ S \equal{} \{1, 2, \ldots , 2n \minus{} 1\}$ is called a [i]silver matrix[/i] if, for each $ i \equal{} 1, 2, \ldots , n$, the $ i$-th row and the $ i$-th column together contain all elements of $ S$. Show that: (a) there is no silver matrix for $ n \equal{} 1997$; (b) silver matrices exist for infinitely many values of $ n$.

Compute the period (i.e. length of the repeating part) of the decimal expansion of $\tfrac{1}{729}$.

Given an integer $n \ge 2$ ,determine the numbers that written in the form $a_1$$a_2$$+$$a_2$$a_3$$+$$...$$a_{k-1}$$a_k$ , where $k$ is an integer greater than or equal to 2, and $a_1$ ,... $a_k$ are positive integers with sum $n$.

In a right triangle rectangle $ABC$ such that $AB = AC$, $M$ is the midpoint of $BC$. Let $P$ be a point on the perpendicular bisector of $AC$, lying in the semi-plane determined by $BC$ that does not contain $A$. Lines $CP$ and $AM$ intersect at $Q$. Calculate the angles that form the lines $AP$ and $BQ$.

For how many integers $n$ between 1 and 100 does $x^2+x-n$ factor into the product of two linear factors with integer coefficients? $\text{(A)} \ 0 \qquad \text{(B)} \ 1 \qquad \text{(C)} \ 2 \qquad \text{(D)} \ 9 \qquad \text{(E)} \ 10$