Let $ S $ be the set of positive integers which are not divisible by perfect squares greater than $ 1.$ Prove that for every $n\in\mathbb{N}$ the following equality is true $$\sum_{k\in S}\left[\sqrt{\frac{n}{k}}\right]=n,$$ where $[x]$ is the integer part of $x\in\mathbb{R}.$

Let $k$ be a given even positive integer. Sarah first picks a positive integer $N$ greater than $1$ and proceeds to alter it as follows: every minute, she chooses a prime divisor $p$ of the current value of $N$, and multiplies the current $N$ by $p^k -p^{-1}$ to produce the next value of $N$. Prove that there are infinitely many even positive integers $k$ such that, no matter what choices Sarah makes, her number $N$ will at some point be divisible by $2018$.

Let $ABC$ be a triangle for which the tangent from $A$ to the circumcircle intersects line $BC$ at $D$, and let $O$ be the circumcenter. Construct the line $l$ that passes through $A$ and is perpendicular to $OD$. $l$ intersects $OD$ at $E$ and $BC$ at $F$. Let the circle passing through $ADO$ intersect $BC$ again at $H$. It is given that $AD=AO=1$. a) Find $OE$ b) Suppose for this part only that $FH=\frac{1}{\sqrt{12}}$: determine the area of triangle $OEF$. c) Suppose for this part only that $BC=\sqrt3$: determine the area of triangle $OEF$. d) Suppose that $B$ lies on the angle bisector of $DEF$. Find the area of the triangle $OEF$.

Answer the following questions : $\textbf{(a)}~$ A natural number $k$ is called stable if there exist $k$ distinct natural numbers $a_1, a_2,\cdots, a_k$, each $a_i>1$, such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_k}=1$$ Show that if $k$ is stable, then $(k+1)$ is also stable. Using this or otherwise, find all stable numbers. $\textbf{(b)}$ Let $f$ be a differentiable function defined on a subset $A$ of the real numbers. Define $$f^*(y):=\max_{x\in A} \left\{yx-f(x)\right\}$$ whenever the above maximum is finite. For the function $f(x)=\ln x$, determine the set of points for which $f^*$ is defined and find an expression for $f^*(y)$ involving only $y$ and constants.

Points $A,B$ are on circle $\omega$. Points $C$ and $D$ are moved on the arc $AB$, such that $CD$ has constant length. $I_1,I_2$ - incenters of $ABC$ and $ABD$. Prove that line $I_1I_2$ is tangent to some fixed circle.

A rational number $ x$ is called [i]good[/i] if it satisfies: $ x\equal{}\frac{p}{q}>1$ with $ p$, $ q$ being positive integers, $ \gcd (p,q)\equal{}1$ and there exists constant numbers $ \alpha$, $ N$ such that for any integer $ n\geq N$, \[ |\{x^n\}\minus{}\alpha|\leq\dfrac{1}{2(p\plus{}q)}\] Find all the good numbers.

$\textbf{Problem G1}$ Consider a triangle $ABC$ with $\angle ACB=90^{\circ}$. Let $F$ be the foot of the altitude from $C$. Circle $\omega$ touches the line segment $FB$ at point $P$, the altitude $CF$ at point $Q$ and the circumcircle of $ABC$ at point $R$. Prove that points $A, Q, R$ are collinear and $AP = AC$.

$\angle{A}$ is the least angle in $\Delta{ABC}$. Point $D$ is on the arc $BC$ from the circumcircle of $\Delta{ABC}$. The perpendicular bisectors of the segments $AB,AC$ intersect the line $AD$ at $M,N$, respectively. Point $T$ is the meet point of $BM,CN$. Suppose that $R$ is the radius of the circumcircle of $\Delta{ABC}$. Prove that: \[ BT+CT\leq{2R}. \]

Prove that the equation $x^3+y^3+z^3=t^4$ has infinitely many solutions in positive integers such that $\gcd(x,y,z,t)=1$. [i]Mihai Pitticari & Sorin Rǎdulescu[/i]

Consider the integral $$\int_{-1}^1 x^nf(x) \; dx$$ for every $n$-th degree polynomial $f$ with integer coefficients. Let $\alpha_n$ denote the smallest positive real number that such an integral can give. Determine the limit value $$\lim_{n\to \infty} \frac{\log \alpha_n}n.$$

Let $ f(x)$ be a function defined on $ [0,\ 1]$. For $ n=1,\ 2,\ 3,\ \cdots$, a polynomial $ P_n(x)$ is defined by $ P_n(x)=\sum_{k=0}^n {}_nC{}_k f\left(\frac{k}{n}\right)x^k(1-x)^{n-k}$. Prove that $ \lim_{n\to\infty} \int_0^1 P_n(x)dx=\int_0^1 f(x)dx$.

Given an odd prime $p$, find all functions $f:Z \rightarrow Z$ satisfying the following two conditions: (i) $f(m)=f(n)$ for all $m,n \in Z$ such that $m\equiv n\pmod p$; (ii) $f(mn)=f(m)f(n)$ for all $m,n \in Z$.

Let $\omega$ be a circle with center $O$ and a non-diameter chord $BC$ of $\omega$. A point $A$ varies on $\omega$ such that $\angle BAC<90^{\circ}$. Let $S$ be the reflection of $O$ through $BC$. Let $T$ be a point on $OS$ such that the bisector of $\angle BAC$ also bisects $\angle TAS$. 1. Prove that $TB=TC=TO$. 2. $TB, TC$ cut $\omega$ the second times at points $E, F$, respectively. $AE, AF$ cut $BC$ at $M, N$, respectively. Let $SM$ intersects the tangent line at $C$ of $\omega$ at $X$, $SN$ intersects the tangent line at $B$ of $\omega$ at $Y$. Prove that the bisector of $\angle BAC$ also bisects $\angle XAY$.

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]

The [i]Olimpia[/i] country is formed by $n$ islands. The most populated one is called [i]Panacenter[/i], and every island has a different number of inhabitants. We want to build bridges between these islands, which we'll be able to travel in both directions, under the following conditions: a) No pair of islands is joined by more than one bridge. b) Using the bridges we can reach every island from Panacenter. c) If we want to travel from Panacenter to every other island, in such a way that we use each bridge at most once, the number of inhabitants of the islands we visit is strictly decreasing. Determine the number of ways we can build the bridges.

Dexter and Raquel are playing a game with $N$ stones. Dexter goes first and takes one stone from the pile. After that, the players alternate turns and can take anywhere from $1$ to $x + 1$ stones from the pile, where $x$ is the number of stones the other player took on the turn immediately prior. The winner is the one to take the last stone from the pile. Assuming Dexter and Raquel play optimally, compute the number of positive integers $N \le 2021$ where Dexter wins this game.