There are real numbers $x, y$ such that $x \ne 0$, $y \ne 0$, $xy + 1 \ne 0$ and $x + y \ne 0$. Suppose the numbers $x + \frac{1}{x} + y + \frac{1}{y}$ and $x^3+\frac{1}{x^3} + y^3 + \frac{1}{y^3}$ are rational. Prove that then the number $x^2+\frac{1}{x^2} + y^2 + \frac{1}{y^2}$ is also rational.

The function $\psi : \mathbb{N}\rightarrow\mathbb{N}$ is defined by $\psi (n)=\sum_{k=1}^n\gcd (k,n)$. $(a)$ Prove that $\psi (mn)=\psi (m)\psi (n)$ for every two coprime $m,n \in \mathbb{N}$. $(b)$ Prove that for each $a\in\mathbb{N}$ the equation $\psi (x)=ax$ has a solution.

In quadrilateral $ABCD$, $AB=2$, $AD=3$, $BC=CD=\sqrt7$, and $\angle DAB=60^\circ$. Semicircles $\gamma_1$ and $\gamma_2$ are erected on the exterior of the quadrilateral with diameters $\overline{AB}$ and $\overline{AD}$; points $E\neq B$ and $F\neq D$ are selected on $\gamma_1$ and $\gamma_2$ respectively such that $\triangle CEF$ is equilateral. What is the area of $\triangle CEF$?

Let $a, b, c $ be distinct positive integers. a) Prove that $a^2b^2 + a^2c^2 + b^2c^2 \ge 9$. b) if, moreover, $ab + ac + bc +3 = abc > 0,$ show that $$(a -1)(b -1)+(a -1)(c -1)+(b -1)(c -1) \ge 6.$$

Let $p>5$ be a prime number. Prove that there exist $m,n\in \mathbb{N}$ for which $m+n<p$ and $2^m 3^n-1$ is a multiple of $p$.

Let $A_1,A_2,...$ be a sequence of sets such that for any positive integer $i$, there are only finitely many values of $j$ such that $A_j\subseteq A_i$. Prove that there is a sequence of positive integers $a_1,a_2,...$ such that for any pair $(i,j)$ to have $a_i\mid a_j\iff A_i\subseteq A_j$.

In triangle $ABC$, $AB=3\sqrt{30}-\sqrt{10}$, $BC=12$, and $CA=3\sqrt{30}+\sqrt{10}$. Let $M$ be the midpoint of $AB$ and $N$ be the midpoint of $AC$. Denote $l$ as the line passing through the circumcenter $O$ and orthocenter $H$ of $ABC$, and let $E$ and $F$ be the feet of the perpendiculars from $B$ and $C$ to $l$, respectively. Let $l'$ be the reflection of $l$ in $BC$ such that $l'$ intersects lines $AE$ and $AF$ at $P$ and $Q$, respectively. Let lines $BP$ and $CQ$ intersect at $K$. $X$, $Y$, and $Z$ are the reflections of $K$ over the perpendicular bisectors of sides $BC$, $CA$, and $AB$, respectively, and $R$ and $S$ are the midpoints of $XY$ and $XZ$, respectively. If lines $MR$ and $NS$ intersect at $T$, then the length of $OT$ can be expressed in the form $\frac{p}{q}$ for relatively prime positive integers $p$ and $q$. Find $100p+q$. [i]Proposed by Vincent Huang and James Lin[/i]

A trapezium has parallel sides of length equal to $a$ and $b$ ($a <b$), and the distance between the parallel sides is the altitude $h$. The extensions of the non-parallel lines intersect at a point that is a vertex of two triangles that have as sides the parallel sides of the trapezium. Express the areas of the triangles as functions of $a,b$ and $h$.

Given triangle $ABC$ with circumcircle $\Gamma$, let $D$, $E$, and $F$ be the midpoints of sides $BC$, $CA$, and $AB$, respectively, and let the lines $AD$, $BE$, and $CF$ intersect $\Gamma$ again at points $J$, $K$, and $L$, respectively. Show that the area of triangle $JKL$ is at least that of triangle $ABC$.

Alina writes the numbers $1, 2, \dots , 9$ on separate cards, one number per card. She wishes to divide the cards into $3$ groups of $3$ cards so that the sum of the number in each group will be the same. In how many ways can this be done? $\textbf{(A) }0 \qquad \textbf{(B) } 1 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 4$

For which $n > 0$ it is possible to mark several different points and several different circles on the plane in such a way that: — exactly $n$ marked circles pass through each marked point; — exactly $n$ marked points lie on each marked circle; — the center of each marked circle is marked?

Two circles intersect at the points $A$ and $B$. Tangent lines drawn to both of the circles at the point $A$ intersect the circles at the points $M$ and $N$. The lines $BM$ and $BN$ intersect the circles once more at the points $P$ and $Q$ respectively. Prove that the segments $MP$ and $NQ$ are equal. (I Nagel)

Let $\Delta ABC$ be an acute triangle and $H$ its orthocenter. $B_1$ and $C_1$ are the feet of heights from $B$ and $C$, $M$ is the midpoint of $AH$. Point $K$ is on the segment $B_1C_1$, but isn't on line $AH$. Line $AK$ intersects the lines $MB_1$ and $MC_1$ in $E$ and $F$, the lines $BE$ and $CF$ intersect at $N$. Prove that $K$ is the orthocenter of $\Delta NBC$.

$2048$ frogs are sitting in a circle and each have a $\$1$ bill. After each minute, each frog will independently give away each of their $\$1$ bills to either the closest frog to their left or the closest frog to their right with equal probability. If a frog has $\$0$ at the end of any given minute, then they will not give any money but may receive money. The expected number of frogs to have at least $\$1$ after $3$ minutes can be denoted as a common fraction in the form $\tfrac{a}{b}.$ Find $a+b.$

Prove that $ \sum_{k \equal{} 0}^{995} \frac {( \minus{} 1)^k}{1991 \minus{} k} {1991 \minus{} k \choose k} \equal{} \frac {1}{1991}$

$50$ gangsters simultaneously shoot at each other, and each shoots at the nearest gangster (if there are several of them, then at one of them) and kills him. Find the smallest possible number of people killed.

A sequence of integers $\{f(n)\}$ for $n=0,1,2,\ldots$ is defined as follows: $f(0)=0$ and for $n>0$, $$\begin{matrix}f(n)=&f(n-1)+3,&\text{if }n=0\text{ or }1\pmod6,\\&f(n-1)+1,&\text{if }n=2\text{ or }5\pmod6,\\&f(n-1)+2,&\text{if }n=3\text{ or }4\pmod6.\end{matrix}$$Derive an explicit formula for $f(n)$ when $n\equiv0\pmod6$, showing all necessary details in your derivation.

For a convex polygon with $n$ edges $F$, if all its diagonals have the equal length, then $\text{(A)}F\in \{\text{quadrilaterals}\}$ $\text{(B)}F\in \{\text{pentagons}\}$ $\text{(C)}F\in \{\text{pentagons}\} \cup\{\text{quadrilaterals}\}$ $\text{(D)}F\in \{\text{convex polygons that have all edges' length equal}\} \cup\{\text{convex polygons that have all inner angles equal}\}$

John ordered $4$ pairs of black socks and some additional pairs of blue socks. The price of the black socks per pair was twice that of the blue. When the order was filled, it was found that the number of pairs of the two colors had been interchanged. This increased the bill by $ 50\%$. The ratio of the number of pairs of black socks to the number of pairs of blue socks in the original order was: $\textbf{(A)}\ 4:1 \qquad \textbf{(B)}\ 2:1 \qquad \textbf{(C)}\ 1:4 \qquad \textbf{(D)}\ 1:2 \qquad \textbf{(E)}\ 1:8$

Find all functions $g : R \to R$, for which there exists a strictly increasing function $f : R \to R$ such that $f(x + y) = f(x)g(y) + f(y)$.

Let $n \ge 2$ be an integer, and let $x_1, x_2, \ldots, x_n$ be reals for which: (a) $x_j > -1$ for $j = 1, 2, \ldots, n$ and (b) $x_1 + x_2 + \ldots + x_n = n.$ Prove that $$ \sum_{j = 1}^{n} \frac{1}{1 + x_j} \ge \sum_{j = 1}^{n} \frac{x_j}{1 + x_j^2} $$ and determine when does the equality occur.

Consider a circle centered at $O$. Parallel chords $AB$ of length $8$ and $CD$ of length $10$ are of distance $2$ apart such that $AC < AD$. We can write $\tan \angle BOD =\frac{a}{b}$ , where $a, b$ are positive integers such that gcd $(a, b) = 1$. Compute $a + b$.

Minivan and Megavan play a game. For a positive integer $n$, Minivan selects a sequence of integers $a_1,a_2,\ldots,a_n$. An operation on $a_1,a_2,\ldots,a_n$ means selecting an $a_i$ and increasing it by $1$. Minivan and Megavan take turns, with Minivan going first. On Minivan's turn, he performs at most $2025$ operations, and he may choose the same integer repeatedly. On Megavan's turn, he performs exactly $1$ operation instead. Megavan wins if at any point in the game, including in the middle of Minivan's operations, two numbers in the sequence are equal. [i](Proposed by Ho Janson)[/i]

Let $ABCD$ be a tetrahedron and suppose that $M$ is a point inside it such that $\angle MAD=\angle MBC$ and $\angle MDB=\angle MCA$. Prove that $$MA\cdot MB+MC\cdot MD<\max(AD\cdot BC,AC\cdot BD).$$

Let $n{}$ be a natural number. The pairwise distinct nonzero integers $a_1,a_2,\ldots,a_n$ have the property that the number \[(k+a_1)(k+a_2)\cdots(k+a_n)\]is divisible by $a_1a_2\cdots a_n$ for any integer $k{}.$ Find the largest possible value of $a_n.$ [i]Proposed by F. Petrov and K. Sukhov[/i]