Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has \[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]

A city is a point on the plane. Suppose there are $n\geq 2$ cities. Suppose that for each city $X$, there is another city $N(X)$ that is strictly closer to $X$ than all the other cities. The government builds a road connecting each city $X$ and its $N(X)$; no other roads have been built. Suppose we know that, starting from any city, we can reach any other city through a series of road. We call a city $Y$ suburban if it is $N(X)$ for some city $X$. Show that there are at least $(n-2)/4$ suburban cities. Proposed by usjl.

Let $ABC$ be a triangle with $AB < AC$, incenter $I$, and $A$ excenter $I_{A}$. The incircle meets $BC$ at $D$. Define $E = AD\cap BI_{A}$, $F = AD\cap CI_{A}$. Show that the circumcircle of $\triangle AID$ and $\triangle I_{A}EF$ are tangent to each other

Let $a_1$, $a_2$, $a_3$, $\ldots$ be a sequence of positive integers such that $a_1=2021$ and $$\sqrt{a_{n+1}-a_n}=\lfloor \sqrt{a_n} \rfloor. $$Show that there are infinitely many odd numbers and infinitely many even numbers in this sequence. Proposed by Li4, Tsung-Chen Chen, and Ming Hsiao.

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

There are $2020$ points on the coordinate plane {$A_i = (x_i, y_i):i = 1, ..., 2020$}, satisfying $$0=x_1<x_2<...<x_{2020}$$$$0=y_{2020}<y_{2019}<...<y_1$$ Let $O=(0, 0)$ be the origin, $OA_1A_2...A_{2020}$ forms a polygon $C$. Now, you want to blacken the polygon $C$. Every time you can choose a point $(x,y)$ with $x, y > 0$, and blacken the area {$(x', y'): 0\leq x' \leq x, 0\leq y' \leq y$}. However, you have to pay $xy$ dollars for doing so. Prove that you could blacken the whole polygon $C$ by using $4|C|$ dollars. Here, $|C|$ stands for the area of the polygon $C$. Proposed by me

Let $ABC$ be a triangle with $AB<AC$, and let $I_a$ be its $A$-excenter. Let $D$ be the projection of $I_a$ to $BC$. Let $X$ be the intersection of $AI_a$ and $BC$, and let $Y,Z$ be the points on $AC,AB$, respectively, such that $X,Y,Z$ are on a line perpendicular to $AI_a$. Let the circumcircle of $AYZ$ intersect $AI_a$ again at $U$. Suppose that the tangent of the circumcircle of $ABC$ at $A$ intersects $BC$ at $T$, and the segment $TU$ intersects the circumcircle of $ABC$ at $V$. Show that $\angle BAV=\angle DAC$. Proposed by usjl.

Let $n$ be a given positive integer. We say that a positive integer $m$ is $n$-good if and only if there are at most $2n$ distinct primes $p$ satisfying $p^2\mid m$. (a) Show that if two positive integers $a,b$ are coprime, then there exist positive integers $x,y$ so that $ax^n+by^n$ is $n$-good. (b) Show that for any $k$ positive integers $a_1,\ldots,a_k$ satisfying $\gcd(a_1,\ldots,a_k)=1$, there exist positive integers $x_1,\ldots,x_k$ so that $a_1x_1^n+a_2x_2^n+\cdots+a_kx_k^n$ is $n$-good. (Remark: $a_1,\ldots,a_k$ are not necessarily pairwise distinct) Proposed by usjl.

Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions: $(i)$ $f(n) \neq 0$ for at least one $n$; $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$; $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$.

Let $ABC$ be a triangle with incenter $I$ and circumcircle $\Gamma$. Circles $\omega_{B}$ passing through $B$ and $\omega_{C}$ passing through $C$ are tangent at $I$. Let $\omega_{B}$ meet minor arc $AB$ of $\Gamma$ at $P$ and $AB$ at $M\neq B$, and let $\omega_{C}$ meet minor arc $AC$ of $\Gamma$ at $Q$ and $AC$ at $N\neq C$. Rays $PM$ and $QN$ meet at $X$. Let $Y$ be a point such that $YB$ is tangent to $\omega_{B}$ and $YC$ is tangent to $\omega_{C}$. Show that $A,X,Y$ are collinear.

Let $n$ and $k$ be positive integers, with $n\geq k+1$. There are $n$ countries on a planet, with some pairs of countries establishing diplomatic relations between them, such that each country has diplomatic relations with at least $k$ other countries. An evil villain wants to divide the countries, so he executes the following plan: (1) First, he selects two countries $A$ and $B$, and let them lead two allies, $\mathcal{A}$ and $\mathcal{B}$, respectively (so that $A\in \mathcal{A}$ and $B\in\mathcal{B}$). (2) Each other country individually decides wether it wants to join ally $\mathcal{A}$ or $\mathcal{B}$. (3) After all countries made their decisions, for any two countries with $X\in\mathcal{A}$ and $Y\in\mathcal{B}$, eliminate any diplomatic relations between them. Prove that, regardless of the initial diplomatic relations among the countries, the villain can always select two countries $A$ and $B$ so that, no matter how the countries choose their allies, there are at least $k$ diplomatic relations eliminated. Proposed by YaWNeeT.

Find all functions $f : \mathbb{Z}\rightarrow \mathbb{Z}$ satisfying \[f^{a^{2} + b^{2}}(a+b) = af(a) +bf(b)\]for all integers $a$ and $b$

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ Netherlands

Let $ ABCD $ be a rhombus with center $ O. $ $ P $ is a point lying on the side $ AB. $ Let $ I, $ $ J, $ and $ L $ be the incenters of triangles $ PCD, $ $ PAD, $ and $PBC, $ respectively. Let $ H $ and $ K $ be orthocenters of triangles $ PLB $ and $ PJA, $ respectively. Prove that $ OI \perp HK. $ Proposed by buratinogigle