Determine the number of distinct positive real solutions to $$\lfloor x \rfloor ^{\{x\}} = \frac{1}{2022}x^2$$ . Note: $\lfloor x \rfloor$ is known as the floor function, which returns the greatest integer less than or equal to $x$. Furthermore, $\{x\}$ is defined as $x - \lfloor x \rfloor$.

Find all sequences $(a_n)$ of positive integers satisfying the equality $a_n=a_{a_{n-1}}+a_{a_{n+1}}$ a) for all $n\ge 2$ b) for all $n \ge 3$ (I. Gorodnin)

Prove that for every positive integer $n \geq 2$ the following inequality holds: $e^{n-1}n!<n^{n+\frac{1}{2}}$

Let $x,y,z\in \mathbb{R}^+_0$ such that $xy+yz+zx=1$. Prove that $$\frac{1}{\sqrt{x+y}}+\frac{1}{\sqrt{y+z}}+\frac{1}{\sqrt{z+x}}\ge 2+\frac{1}{\sqrt{2}}.$$ [i](Anonymous314)[/i]

The solutions to the system of equations \begin{eqnarray*} \log_{225}{x}+\log_{64}{y} &=& 4\\ \log_x{225}-\log_y{64} &=& 1 \end{eqnarray*} are $(x_1,y_1)$ and $(x_2, y_2).$ Find $\log_{30}{(x_1y_1x_2y_2)}.$

Let $n \geq 1$ be an odd integer. Determine all functions $f$ from the set of integers to itself, such that for all integers $x$ and $y$ the difference $f(x)-f(y)$ divides $x^n-y^n.$ [i]Proposed by Mihai Baluna, Romania[/i]

[b]p1.[/b] Find all real solutions of the system $$x^5 + y^5 = 1$$ $$x^6 + y^6 = 1$$ [b]p2.[/b] The centers of three circles of the radius $R$ are located in the vertexes of equilateral triangle. The length of the sides of the triangle is $a$ and $\frac{a}{2}< R < a$. Find the distances between the intersection points of the circles, which are outside of the triangle. [b]p3.[/b] Prove that no positive integer power of $2$ ends with four equal digits. [b]p4.[/b] A circle is divided in $10$ sectors. $90$ coins are located in these sectors, $9$ coins in each sector. At every move you can move a coin from a sector to one of two neighbor sectors. (Two sectors are called neighbor if they are adjoined along a segment.) Is it possible to move all coins into one sector in exactly$ 2004$ moves? [b]p5.[/b] Inside a convex polygon several points are arbitrary chosen. Is it possible to divide the polygon into smaller convex polygons such that every one contains exactly one given point? Justify your answer. [b]p6.[/b] A troll tried to spoil a white and red $8\times 8$ chessboard. The area of every square of the chessboard is one square foot. He randomly painted $1.5\%$ of the area of every square with black ink. A grasshopper jumped on the spoiled chessboard. The length of the jump of the grasshopper is exactly one foot and at every jump only one point of the chessboard is touched. Is it possible for the grasshopper to visit every square of the chessboard without touching any black point? Justify your answer. PS. You should use hide for answers.

Positive real numbers $a_1, a_2, \ldots, a_{2024}$ are arranged in a circle. It turned out that for any $i = 1, 2, \ldots, 2024$, the following condition holds: $a_ia_{i+1} < a_{i+2}$. (Here we assume that $a_{2025} = a_1$ and $a_{2026} = a_2$). What largest number of positive integers could there be among these numbers $a_1, a_2, \ldots, a_{2024}$? [i]Proposed by Mykhailo Shtandenko[/i]

Let $P(x), Q(x)$ be distinct polynomials of degree $2020$ with non-zero coefficients. Suppose that they have $r$ common real roots counting multiplicity and $s$ common coefficients. Determine the maximum possible value of $r + s$. [i]Demetres Christofides, Cyprus[/i]

What's the smallest possible value of $$\frac{(x+y+|x-y|)^2}{xy}$$ over positive real numbers $x, y$?

We call a function $g$ [i]special [/i] if $g(x)=a^{f(x)}$ (for all $x$) where $a$ is a positive integer and $f$ is polynomial with integer coefficients such that $f(n)>0$ for all positive integers $n$. A function is called an [i]exponential polynomial[/i] if it is obtained from the product or sum of special functions. For instance, $2^{x}3^{x^{2}+x-1}+5^{2x}$ is an exponential polynomial. Prove that there does not exist a non-zero exponential polynomial $f(x)$ and a non-constant polynomial $P(x)$ with integer coefficients such that $$P(n)|f(n)$$ for all positive integers $n$.

Let a function $f$ satisfy $f(1) = 1$ and $f(1)+ f(2)+...+ f(n) = n^2f(n)$ for all $n \in N$. Determine $f(1995)$.

Prove that there exists an infinite number of relatively prime pairs $(m, n)$ of positive integers such that the equation \[x^3-nx+mn=0\] has three distint integer roots.

Find all functions $f$ that is defined on all reals but $\tfrac13$ and $- \tfrac13$ and satisfies \[ f \left(\frac{x+1}{1-3x} \right) + f(x) = x \] for all $x \in \mathbb{R} \setminus \{ \pm \tfrac13 \}$.

Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying \[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\] for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set \[X_v=\{x\in\mathbb Z:f(x)=v\}\] is finite and nonempty. (a) Prove that there exists such a function $f$ for which there is an $f$-rare integer. (b) Prove that no such function $f$ can have more than one $f$-rare integer. [i]Netherlands[/i]

Suppose one is given $n$ real numbers, not all zero, but such that their sum is zero. Prove that one can label these numbers $a_1, a_2, ..., a_n$ in such a manner that $a_1a_2 + a_2a_3 +...+a_{n-1}a_n + a_na_1 < 0$.

Consider polynomials $P(x)$ of degree at most $3$, each of whose coefficients is an element of $\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$. How many such polynomials satisfy $P(-1) = -9$? $\textbf{(A) } 110 \qquad \textbf{(B) } 143 \qquad \textbf{(C) } 165 \qquad \textbf{(D) } 220 \qquad \textbf{(E) } 286 $

In base-$2$ notation, digits are $0$ and $1$ only and the places go up in powers of $-2$. For example, $11011$ stands for $(-2)^4+(-2)^3+(-2)^1+(-2)^0$ and equals number $7$ in base $10$. If the decimal number $2019$ is expressed in base $-2$ how many non-zero digits does it contain ?

Is there a function $f(x)$, which satisfies both of the following conditions: a) if $x \ne y$, then $f(x)\ne f(y)$ b) for all real $x$, holds the inequality $f(x^2-1998x)-f^2(2x-1999)\ge \frac14$?

$f$ is a function defined on integers and satisfies $f(x)+f(x+3)=x^2$ for every integer $x$. If $f(19)=94$, then calculate $f(94)$.

Let $S$ be the domain surrounded by the two curves $C_1:y=ax^2,\ C_2:y=-ax^2+2abx$ for constant positive numbers $a,b$. Let $V_x$ be the volume of the solid formed by the revolution of $S$ about the axis of $x$, $V_y$ be the volume of the solid formed by the revolution of $S$ about the axis of $y$. Find the ratio of $\frac{V_x}{V_y}$.

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

Determine the set of all real numbers $\alpha$ with the following property: For each positive $c$ there exists a rational number $\frac mn~(m\in\mathbb Z,n\in\mathbb N)$ different than $\alpha$ such that $$\left|\alpha-\frac mn\right|<\frac cn.$$

Let $a, b$, and $c$ be positive real numbers. Prove that \[\frac{a^4 + 3}{b} + \frac{b^4 + 3}{c} + \frac{c^4 + 3}{a} \ge 12.\] When does equality hold? [i]Proposed by Petar Filipovski[/i]

Let $n$ be a positive integer. Find the number of polynomials $P(x)$ with coefficients in $\{0, 1, 2, 3\}$ for which $P(2) = n$.