Let ${f}$ be a bounded real function defined for all real numbers and satisfying for all real numbers ${x}$ the condition ${ f \Big(x+\frac{1}{3}\Big) + f \Big(x+\frac{1}{2}\Big)=f(x)+ f \Big(x+\frac{5}{6}\Big)}$ . Show that ${f}$ is periodic.

Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that for all real numbers $a, b, c$, we have \[ f(a+b+c)f(ab+bc+ca) - f(a)f(b)f(c) = f(a+b)f(b+c)f(c+a). \] [i]Proposed by Mainak Ghosh and Rijul Saini[/i]

We are allowed to put several brackets in the expression $$\frac{29 : 28 : 27 : 26 :... : 17 : 16}{15 : 14 : 13 : 12 : ... : 3 : 2}$$ always in the same places below each other. (a) Find the smallest possible integer value we can obtain in that way. (b) Find all possible integer values that can be obtained. Remark: in this problem, $$\frac{(29 : 28) : 27 : ... : 16}{(15 : 14) : 13 : ... : 2},$$ is valid position of parenthesis, on the other hand $$\frac{(29 : 28) : 27 : ... : 16}{15 : (14 : 13) : ... : 2}$$ is forbidden.

Let's consider a set of distinct positive integers with a sum equal to 2023. Among these integers, there are a total of $d$ even numbers and $m$ odd numbers. Determine the maximum possible value of $2d + 4m$. [i]Proposed by Gogi Khimshiashvili, Georgia[/i]

Find all one-to-one mappings $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $n$ the following relation holds: \[ f(f(n)) \leq \frac {n+f(n)} 2 . \]

Show that the only real solution to \[\left\{ \begin{array}{l} x(x+y)^2 = 9 \\ x(y^3 - x^3) = 7 \\ \end{array} \right. \] is $x = 1$, $y = 2$.

Prove that for any three infinite sequences of natural numbers $(a_n)_{n\ge 1}$, $(b_n)_{n\ge 1}$, $(c_n)_{n\ge 1}$, there exist numbers $p$ and $q$ such that $a_p\ge a_q$, $b_p\ge b_q$ and $c_p\ge c_q$.

Maxim has guessed a polynomial $f(x)$ of degree $n$. Sasha wants to guess it (knowing $n$). During a turn, Sasha can name a certain segment $[a;b]$ and Maxim will give in response the maximum value of $f(x)$ on the segment $[a;b]$. Will Sasha be able to guess $f(x)$ in a finite number of steps? [i]M. Didin[/i]

Let $n$ be the square of an integer whose each prime divisor has an even number of decimal digits. Consider $P(x) = x^n - 1987x$. Show that if $x,y$ are rational numbers with $P(x) = P(y)$, then $x = y$.

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $f(x)f(y)=f(x+y)+xy$ for all $x,y\in \mathbb{R}$.

Let $f:\mathbb{R}\to\mathbb{R}$ be a bijective function. Does there always exist an infinite number of functions $g:\mathbb{R}\to\mathbb{R}$ such that $f(g(x))=g(f(x))$ for all $x\in\mathbb{R}$? [i]Proposed by Daniel Liu[/i]

If $f(x)$ is a monic quartic polynomial such that $f(-1)=-1$, $f(2)=-4$, $f(-3)=-9$, and $f(4)=-16$, find $f(1)$.

Let $c$ be a positive integer. The sequence $\{f_n\}$ is defined as follows: \[f_1 = 1, f_2 = c, f_{n+1} = 2f_n - f_{n-1} + 2 \quad (n \geq 2).\] Show that for each $k \in \mathbb N$ there exists $r \in \mathbb N$ such that $f_kf_{k+1}= f_r.$

Find all function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following equality holds \[ f(\left\lfloor x\right\rfloor y)=f(x)\left\lfloor f(y)\right\rfloor \] where $\left\lfloor a\right\rfloor $ is greatest integer not greater than $a.$ [i]Proposed by Pierre Bornsztein, France[/i]

Prove that for all positive reals $a, b,c$ we have: $a +\sqrt{ab}+ \sqrt[3]{abc}\le \frac43 (a + b + c)$

Suppose $2$ cars are going into a turn the shape of a half-circle. Car $ 1$ is traveling at $50$ meters per second and is hugging the inside of the turn, which has radius $200$ meters. Car $2$ is trying to pass Car $ 1$ going along the turn, but in order to do this, he has to move to the outside of the turn, which has radius $210$. Suppose that both cars come into the turn side by side, and that they also end the turn being side by side. What was the average speed of Car $2$, in meters per second, throughout the turn?

Find all pairs of positive integers $ (m,n)$ such that $ mn \minus{} 1$ divides $ (n^2 \minus{} n \plus{} 1)^2$. [i]Aaron Pixton.[/i]

For each positive integer $n$ find the largest subset $M(n)$ of real numbers possessing the property: \[n+\sum_{i=1}^{n}x_{i}^{n+1}\geq n \prod_{i=1}^{n}x_{i}+\sum_{i=1}^{n}x_{i}\quad \text{for all}\; x_{1},x_{2},\cdots,x_{n}\in M(n)\] When does the inequality become an equality ?

Determine all 2nd degree polynomials with integer coefficients of the form $P(X)=aX^{2}+bX+c$, that satisfy: $P(a)=b$, $P(b)=a$, with $a\neq b$.

Find all strictly increasing sequences of positive integers $a_1, a_2, \ldots$ with $a_1=1$, satisfying $$3(a_1+a_2+\ldots+a_n)=a_{n+1}+\ldots+a_{2n}$$ for all positive integers $n$.

[b]7.1 / 6.3[/b] All integers from 1 to 1966 are written on the board. Allowed is to erase any two numbers by writing their difference instead. Prove that repeating such an operation many times cannot ensure that There are only zeros left on the board. [b]7.2 [/b] Prove that the radius of a circle is equal to the difference between the lengths of two chords, one of which subtends an arc of $1/10$ of a circle, and the other subtends an arc in $3/10$ of a circle. [b]7.3[/b] Prove that for any natural number $n$ the number $ n(2n+1)(3n+1)...(1966n + 1) $ is divisible by every prime number less than $1966$. [b]7.4[/b] What number needs to be put in place * so that the next the problem had a unique solution: [i]“There are n straight lines on the plane, intersecting at * points. Find n.” ?[/i] [b]7.5 / 6.4[/b] Black paint was sprayed onto a white surface. Prove that there are three points of the same color lying on the same line, and so, that one of the points lies in the middle between the other two. [b]7.6 [/b] There are $n$ points on the plane so that any triangle with vertices at these points has an area less than $1$. Prove that all these points can be enclosed in a triangle of area $4$. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988082_1966_leningrad_math_olympiad]here[/url].

A magician asked a spectator to think of a three-digit number $ \overline{abc}$ and then to tell him the sum of numbers $ \overline{acb}$, $ \overline{bac}$, $ \overline{bca}$, $ \overline{cab}$, and $ \overline{cba}$. He claims that when he knows this sum he can determine the original number. Is that so?

A polynomial with rational coefficients is called [i]integer[/i], if it takes integer values ​​for all integer values ​​of the variable. For an integer polynomial $P$, consider the sequence $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$ a) Prove that this sequence is periodic, the period of which is some power of two (i.e. for some integer $k$ and for all natural $i$, the $i$-th and ($i+2^k$)th members of the sequence are equal). b) Prove that for any periodic sequence consisting of $(- 1)$ and $ 1$ and with a period of some power of two, there exists a integer, polynomial P for which this sequence is $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$

Find all polynomials of degree $3$ with integer coeffcients such that $f(2014) = 2015, f(2015) = 2016$ and $f(2013) - f(2016)$ is a prime number.

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.