The set of nonempty integers $A$ is said to be "elegant" if it is for any $a\in A,$ $1\leq k\leq 2023,$ $$\left| \left\{ b\in A:\left\lfloor\frac b{3^k}\right\rfloor =\left\lfloor\frac a{3^k}\right\rfloor\right\}\right| =2^k.$$ Prove that if the intersection of the integer set $S$ and any "elegant" set is not empty$,$ then $S$ contains an "elegant" set.

Let $a, b, c$ be positive integers such that the product $$\gcd(a,b) \cdot \gcd(b,c) \cdot \gcd(c,a) $$ is a perfect square. Prove that the product $$\operatorname{lcm}(a,b) \cdot \operatorname{lcm}(b,c) \cdot \operatorname{lcm}(c,a) $$ is also a perfect square.

In the following list of numbers (given in their binary representations), each number appears an even number of times, except for one number that appears exactly three times. Find the number that appears exactly three times. Leave the answer in its binary representation. \begin{tabular}{cccccc} 010111 & 000001 & 100000 & 011000 & 110101 & 100001 \\ 010100 & 011111 & 111001 & 010001 & 010100 & 101100 \\ 010001 & 011011 & 011111 & 011011 & 100000 & 000001 \\ 110011 & 001000 & 111101 & 100001 & 101100 & 110011 \\ 111111 & 011000 & 001000 & 101000 & 111111 & 101000 \\ 010111 & 100011 & 111001 & 100011 & 110101 & 011111 \\ 100000 & 010100 & 010001 & 101100 & 010111 & 011011 \\ 011000 & 111101 & 111111 & 100001 & 101000 & 100011 \\ 011011 & 010111 & 110011 & 111111 & 000001 & 010001 \\ 101000 & 111001 & 010100 & 110101 & 011000 & 110101 \\ 001000 & 000001 & 100000 & 111101 & 100011 & 001000 \\ 111001 & 110011 & 100001 & 011111 & 101100 \end{tabular}

Regular $2n$-gon is inscribed in the unit circle. Find the sum of the squares of all sides and diagonal lengths in the $2n$-gon.

There are $n \geq 3$ islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route. After each year, the ferry company will close a ferry route between some two islands $X$ and $Y$. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected to a ferry route to exactly one of $X$ and $Y$, a new route between this island and the other of $X$ and $Y$ is added. Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.

Ivan is playing Lego with $4n^2$ $1 \times 2$ blocks. First, he places $2n^2$ $1 \times 2$ blocks to fit a $2n \times 2n$ square as the bottom layer. Then he builds the top layer on top of the bottom layer using the remaining $2n^2$ $1 \times 2$ blocks. Note that the blocks in the bottom layer are connected to the blocks above it in the top layer, just like real Lego blocks. He wants the whole two-layered building to be connected and not in seperate pieces. Prove that if he can do so, then the four $1\times 2$ blocks connecting the four corners of the bottom layer, must be all placed horizontally or all vertically. [i]Proposed by Ivan Chan Kai Chin[/i]

Let $a \ne 0$ be a real number. Find all functions $f : R_{>0}\to R_{>0}$ with $$f(f(x) + y) = ax + \frac{1}{f\left(\frac{1}{y}\right)}$$ for all $x, y \in R_{>0}$. [i](Proposed by Walther Janous)[/i]

Your answer to this problem will be an integer between $0$ and $100$, inclusive. From all the teams who submitted an answer to this problem, let the average answer be $A$. Estimate the value of $\left\lfloor \frac23 A \right\rfloor$. If your estimate is $E$ and the answer is $A$, your score for this problem will be \[\max\left(0,\lfloor15-2\cdot\left|A-E\right|\right \rfloor).\] [i]Proposed by Andrew Zhao[/i]

Let $x_0 = 1$ and $x_1 = 2003$ and define the sequence $(x_n)_{n \ge 0}$ by: $x_{n+1} =\frac{x^2_n + 1}{x_{n-1}}$ , $\forall n \ge 1$ Prove that for every $n \ge 2$ the denominator of the fraction $x_n$, when $x_n$ is expressed in lowest terms is a power of $2003$.

Let $P$ be any point inside the parallelogram $ABCD$ and let $R$ be the radius of the circle through $A$, $B$, and $C$. Show that the distance from $P$ to the nearest vertex is not greater than $R$.

Find all functions $f: R \to R$, such that equality $f (xf (y) - yf (x)) = f (xy) - xy$ holds for all $x, y \in R$.

In convex hexagon $ ABCDEF$ all sides have equal length and $ \angle A\plus{}\angle C\plus{}\angle E\equal{}\angle B\plus{}\angle D\plus{}\angle F$. Prove that the diagonals $ AD,BE,CF$ are concurrent.

Are there such $x,y$ that $\lg{(x+y)}=\lg x \lg y$ and $\lg{(x-y)}=\frac{\lg x}{\lg y}$ ?

Find all real numbers $x, y$ such that: $y+3\sqrt{x+2}=\frac{23}2+y^2-\sqrt{49-16x}$

Determine all real numbers $a, b$ and all integers $n\ge 1$ for which$ (a + b)^n = a^n + b^n$ holds.

Let $S$ be a set of $n\ge 3$ points in the interior of a circle. $a)$ Show that there are three distinct points $a,b,c\in S$ and three distinct points $A,B,C$ on the circle such that $a$ is (strictly) closer to $A$ than any other point in $S$, $b$ is closer to $B$ than any other point in $S$ and $c$ is closer to $C$ than any other point in $S$. $b)$ Show that for no value of $n$ can four such points in $S$ (and corresponding points on the circle) be guaranteed.

Three numbers are initially written on the board: 2023, 2024, and 2025. In each move, you can increase any two of these numbers by 1 and decrease the third one by 2. a) Determine whether it is possible to perform a sequence of operations such that the board eventually contains two numbers that are equal. b) Calculate the number of all possible ordered triples of positive integers that can be obtained by performing such operations some number of times. [i]Proposed by Giorgi Arabidze, Georgia [/i]