Does there exist a sequence $ \{b_{i}\}_{i=1}^\infty$ of positive real numbers such that for each natural $ m$: \[ b_{m}+b_{2m}+b_{3m}+\dots=\frac1m\]

Given is a real number $a \in (0,1)$ and positive reals $x_0, x_1, \ldots, x_n$ such that $\sum x_i=n+a$ and $\sum \frac{1}{x_i}=n+\frac{1}{a}$. Find the minimal value of $\sum x_i^2$.

Find the total number of solutions to the following system of equations: $ \{\begin{array}{l} a^2 + bc\equiv a \pmod{37} \\ b(a + d)\equiv b \pmod{37} \\ c(a + d)\equiv c \pmod{37} \\ bc + d^2\equiv d \pmod{37} \\ ad - bc\equiv 1 \pmod{37} \end{array}$

In trapezoid $ABCD,$ leg $\overline{BC}$ is perpendicular to bases $\overline{AB}$ and $\overline{CD},$ and diagonals $\overline{AC}$ and $\overline{BD}$ are perpendicular. Given that $AB=\sqrt{11}$ and $AD=\sqrt{1001},$ find $BC^2.$

For each positive integer $n$, find the largest real number $C_n$ with the following property. Given any $n$ real-valued functions $f_1(x), f_2(x), \cdots, f_n(x)$ defined on the closed interval $0 \le x \le 1$, one can find numbers $x_1, x_2, \cdots x_n$, such that $0 \le x_i \le 1$ satisfying \[|f_1(x_1)+f_2(x_2)+\cdots f_n(x_n)-x_1x_2\cdots x_n| \ge C_n\] [i]Marko Radovanović, Serbia[/i]

Does there exist a piecewise linear function $f$ defined on the segment [$-1,1]$ (including the ends) such that $f(f(x)) = -x$ for all x? (A function is called piecewise linear if its graph is the union of a finite set of points and intervals; it may be discontinuous).

Let $(a_n)$ defined by: $a_0=1, \; a_1=p, \; a_2=p(p-1)$, $a_{n+3}=pa_{n+2}-pa_{n+1}+a_n, \; \forall n \in \mathbb{N}$. Knowing that (i) $a_n>0, \; \forall n \in \mathbb{N}$. (ii) $a_ma_n>a_{m+1}a_{n-1}, \; \forall m \ge n \ge 0$. Prove that $|p-1| \ge 2$.

Point $P$ lies inside triangle of sides of length $3, 4, 5$. Show that if distances between $P$ and vertices of triangle are rational numbers then distances from $P$ to sides of triangle are rational numbers too.

Let $n$ be a positive integer. Solve the system of equations \begin{align*}x_{1}+2x_{2}+\cdots+nx_{n}&= \frac{n(n+1)}{2}\\ x_{1}+x_{2}^{2}+\cdots+x_{n}^{n}&= n\end{align*} for $n$-tuples $(x_{1},x_{2},\ldots,x_{n})$ of nonnegative real numbers.

Determine whether there exist two reals $x,y$ and a sequence $\{a_n\}_{n=0}^{\infty}$ of nonzero reals such that $a_{n+2}=xa_{n+1}+ya_n$ for all $n\ge0$ and for every positive real number $r$, there exist positive integers $i,j$ such that $|a_i|<r<|a_j|$. [i]Alex Zhu.[/i]

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

Do there exist $10$ consecutive positive integers such that the sum of their squares is equal to the sum of squares of the next $9$ integers? (Inspired by a diagram in an old text book)

If $x$ is a positive real number, and $n$ is a positive integer, prove that \[[ nx] > \frac{[ x]}1 + \frac{[ 2x]}2 +\frac{[ 3x]}3 + \cdots + \frac{[ nx]}n,\] where $[t]$ denotes the greatest integer less than or equal to $t$. For example, $[ \pi] = 3$ and $\left[\sqrt2\right] = 1$.

The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.) Show that the sequence contains no sixth power of a natural number.

Let $M,a,b,r$ be non-negative integers with $a,r\ge 2$, and suppose there exists a function $f:\mathbb{Z}\rightarrow\mathbb{Z}$ satisfying the following conditions: (1) For all $n\in \mathbb{Z}$, $f^{(r)}(n)=an+b$ where $f^{(r)}$ denotes the composition of $r$ copies of $f$ (2) For all $n\ge M$, $f(n)\ge 0$ (3) For all $n>m>M$, $n-m|f(n)-f(m)$ Show that $a$ is a perfect $r$-th power.

Find all functions $f:\mathbb{R}\to \mathbb R$ satisfying \[f(x+y)f(x-y)=\left(f(x)+f(y)\right)^2-4x^2f(y),\] For all $x,y\in\mathbb R$.

Let $a$, $b$ and $c$ be positive real numbers such that $a+b+c=3$. Prove the inequality $$\frac{a^3}{a^2+1}+\frac{b^3}{b^2+1}+\frac{c^3}{c^2+1} \geq \frac{3}{2}.$$ [i]Proposed by Anastasija Trajanova[/i]

Let $f:\mathbb R\to\mathbb R$ be given by $$f(x)=\left|x^2-1\right|,x\in\mathbb R$$Then $\textbf{(A)}~f\text{ has local minima at }x=\pm1\text{ but no local maxima}$ $\textbf{(B)}~f\text{ has a local maximum at }x=0\text{ but no local minima}$ $\textbf{(C)}~f\text{ has local minima at }x=\pm1\text{ and a local maximum at }x=0$ $\textbf{(D)}~\text{None of the above}$

Find all pairs of polynomials $p(x),q(x)\in R[x]$ satisfying the equality $p(x^2)=p(x)q(1-x)+p(1-x)q(x)$ for all real $x$. I.Voronovich

Given two finite collections of pairs of real numbers It turned out that for any three pairs $(a_1, b_1)$, $(a_2, b_2)$ and $(a_3, b_3)$ from the first collection there is a pair $(c, d)$ from the second collection, such that the following three inequalities hold: \[ a_1c + b_1d \geq 0,a_2c + b_2c \geq 0 \text{ and } a_3c + b_3d \geq 0 \] Prove that there is a pair $(\gamma, \delta)$ in the second collection, such that for any pair $(\alpha, \beta)$ from the first collection inequality $\alpha \gamma + \beta \delta \geq 0$ holds.

Let $p$ be a prime and let $f(x)$ be a polynomial of degree $d$ with integer coefficients. Assume that the numbers $f(1),f(2),\dots,f(p)$ leave exactly $k$ distinct remainders when divided by $p$, and $1<k<p$. Prove that \[ \frac{p-1}{d}\leq k-1\leq (p-1)\left(1-\frac1d \right) .\] [i] Dániel Domán, Gauls Károlyi, and Emil Kiss [/i]

Let $A$ and $B$ be two non-empty subsets of $X = \{1, 2, . . . , 11 \}$ with $A \cup B = X$. Let $P_A$ be the product of all elements of $A$ and let $P_B$ be the product of all elements of $B$. Find the minimum and maximum possible value of $P_A +P_B$ and find all possible equality cases. [i]Proposed by Greece[/i]

Let $a$ and $b$ be positive real numbers such that $\log_{43}{a} = \log_{47} (3a + 4b) = \log_{2021}b^2$. Then, the value of $\tfrac{b^2}{a^2}$ can be written as $m + \sqrt{n}$, where $m$ and $n$ are integers. Find $m + n$.

In a sequence of $71$ nonzero real numbers, each number (apart from the fitrst one and the last one) is one less than the product of its two neighbors. Prove that the first and the last number are equal. [i](Josef Tkadlec)[/i]

Find all real solutions of $\sqrt[4]{13+x}+ \sqrt[4]{14-x} = 3$.