Find all functions $f : R \to R$ that satisfy $f (xy + f(xy)) = 2x f(y)$ for all $x, y \in R$

Find all function $f:\mathbb{N}\rightarrow\mathbb{N}$ such that for all $a,b\in\mathbb{N}$ , $(f(a)+b) f(a+f(b))=(a+f(b))^2$

Let $a_1,a_2,...,a_{2007}$ be real number such that $ a_1+a_2+...+a_{2007}\geq 2007^{2}$ and $a_1^{2}+a_2^{2}+...+a_{2007}^{2}\leq 2007^{3}-1 $. Prove that $ a_k\in[2006;2008]$ for all $k\in\left \{ 1,2,...,2007 \right \}$

Determine all the positive real numbers $x_1, x_2, x_3, \dots, x_{2021}$ such that $x_{i+1}=\frac{x_i^3+2}{3x_i^2}$ for every $i=1, 2, 3, \dots, 2020$ and $x_{2021}=x_1$

Solve the system of equations for variables $x,y$, where $\{a,b\}\in\mathbb{R}$ are constants and $a\neq 0$. \[x^2 + xy = a^2 + ab\] \[y^2 + xy = a^2 - ab\]

The sports plane flew along a diamond-shaped route in windy weather. He flew through the first three sides of the rhombus in $a $, $b$ and $c$ hours, respectively. How long did it take him to cover the fourth side of the diamond? (The speed of an aircraft is a vector equal to the sum of two vectors: the aircraft’s own speed and the wind speed. Wind speed is a constant vector. The aircraft’s own speed is a vector of constant length).

For certain $a,b,c$ holds: $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{1}{a+b+c}$ Prove that for all odd $n$ holds, $$\frac{1}{a^n}+\frac{1}{b^n}+\frac{1}{c^n}=\frac{1}{a^n+b^n+c^n}.$$

Let $f : \mathbb R \to \mathbb R$ be a real-valued function defined on the set of real numbers that satisfies \[f(x + y) \leq yf(x) + f(f(x))\] for all real numbers $x$ and $y$. Prove that $f(x) = 0$ for all $x \leq 0$. [i]Proposed by Igor Voronovich, Belarus[/i]

Discriminant of a second degree polynomial with integer coefficients cannot be $ \textbf{(A)}\ 23 \qquad\textbf{(B)}\ 24 \qquad\textbf{(C)}\ 25 \qquad\textbf{(D)}\ 28 \qquad\textbf{(E)}\ 33 $

Let $a,b$ be positive integers satisfying $$\sqrt{\dfrac{ab}{2b^2-a}}=\dfrac{a+2b}{4b}$$. Find $|10(a-5)(b-15)|+8$.

Let $ x$ be an arbitrary real number in $ (0,1)$. For every positive integer $ k$, let $ f_k(x)$ be the number of points $ mx\in [k,k \plus{} 1)$ $ m \equal{} 1,2,...$ Show that the sequence $ \sqrt [n]{f_1(x)f_2(x)\cdots f_n(x)}$ is convergent and find its limit.

Let $ a,b,c $ be three real numbers such that $ \cos a+\cos b+\cos c=\sin a+\sin b+\sin c=0. $ Prove that [b]i)[/b] $ \cos 6a+\cos 6b+\cos 6c=3\cos (2a+2b+2c) $ [b]ii)[/b] $ \sin 6a+\sin 6b+\sin 6c=3\sin (2a+2b+2c) $ [i]Vasile Pop[/i]

Let $ABC$ be a triangle and $n$ a positive integer. Consider on the side $BC$ the points $A_1, A_2, ..., A_{2^n-1}$ that divide the side into $2^n$ equal parts, that is, $BA_1=A_1A_2=...=A_{2^n-2}A_{2^n-1}=A_{2^n-1}C$. Set the points $B_1, B_2, ..., B_{2^n-1}$ and $C_1, C_2, ..., C_{2^n-1}$ on the sides $CA$ and $AB$, respectively, analogously. Draw the line segments $AA_1, AA_2, ..., AA_{2^n-1}$, $BB_1, BB_2, ..., BB_{2^n-1}$ and $CC_1, CC_2, ..., CC_{2^n-1}$. Find, in terms of $n$, the number of regions into which the triangle is divided.

Let $f(x) = x^2 + \lfloor x\rfloor ^2 - 2x \lfloor x \rfloor + 1$. Compute $f\left(4 + \frac56 \right)$. Here, $\lfloor m \rfloor$ is defined as the greatest integer less than or equal to $m$. For example, $\lfloor 3 \rfloor = 3$ and $\lfloor - 4.25 \rfloor = -5$.

Let $a, b, c$, and $d$ be real numbers such that $a^2 + b^2 + c^2 + d^2 = 3a + 8b + 24c + 37d = 2018$. Evaluate $3b + 8c + 24d + 37a$.

[u]Round 1[/u] [b]p1.[/b] In a chemical lab there are three vials: one that can hold $1$ oz of fluid, another that can hold $2$ oz, and a third that can hold $3$ oz. The first is filled with grape juice, the second with sulfuric acid, and the third with water. There are also $3$ empty vials in the cupboard, also of sizes $1$ oz, $2$ oz, and $3$ oz. In order to save the world with grape-flavored acid, James Bond must make three full bottles, one of each size, filled with a mixture of all three liquids so that each bottle has the same ratio of juice to acid to water. How can he do this, considering he was silly enough not to bring any equipment? [b]p2.[/b] Twelve people, some are knights and some are knaves, are sitting around a table. Knaves always lie and knights always tell the truth. At some point they start up a conversation. The first person says, “There are no knights around this table.” The second says, “There is at most one knight at this table.” The third – “There are at most two knights at the table.” And so on until the $12$th says, “There are at most eleven knights at the table.” How many knights are at the table? Justify your answer. [b]p3.[/b] Aquaman has a barrel divided up into six sections, and he has placed a red herring in each. Aquaman can command any fish of his choice to either ‘jump counterclockwise to the next sector’ or ‘jump clockwise to the next sector.’ Using a sequence of exactly $30$ of these commands, can he relocate all the red herrings to one sector? If yes, show how. If no, explain why not. [img]https://cdn.artofproblemsolving.com/attachments/0/f/956f64e346bae82dee5cbd1326b0d1789100f3.png[/img] [b]p4.[/b] Is it possible to place $13$ integers around a circle so that the sum of any $3$ adjacent numbers is exactly $13$? [b]p5.[/b] Two girls are playing a game. The first player writes the letters $A$ or $B$ in a row, left to right, adding one letter on her turn. The second player switches any two letters after each move by the first player (the letters do not have to be adjacent), or does nothing, which also counts as a move. The game is over when each player has made $2011$ moves. Can the second player plan her moves so that the resulting letters form a palindrome? (A palindrome is a sequence that reads the same forward and backwards, e.g. $AABABAA$.) [u]Round 2[/u] [b]p6.[/b] Eight students participated in a math competition. There were eight problems to solve. Each problem was solved by exactly five people. Show that there are two students who solved all eight problems between them. [b]p7.[/b] There are $3n$ checkers of three different colors: $n$ red, $n$ green and $n$ blue. They were used to randomly fill a board with $3$ rows and $n$ columns so that each square of the board has one checker on it. Prove that it is possible to reshuffle the checkers within each row so that in each column there are checkers of all three colors. Moving checkers to a different row is not allowed. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve in positives $$x^y=z,y^z=x,z^x=y$$

Let $k > 1$ be a positive integer and $n \ge 2019$ be an odd positive integer. The non-zero rational numbers $x_1, x_2,..., x_n$ are not all equal, and satisfy the following chain of equalities: $$x_1 +\frac{k}{x_2}= x_2 +\frac{k}{x_3}= x_3 +\frac{k}{x_4}= ... = x_{n-1} +\frac{k}{x_n}= x_n +\frac{k}{x_1}.$$ What is the smallest possible value of $k$?

Let $a,b,c,d$ be any real numbers such that $a+b+c+d=0$, prove that \[1296(a^7+b^7+c^7+d^7)^2\le637(a^2+b^2+c^2+d^2)^7\]

Let $r$, $s$, $t$ be the roots of the polynomial $x^3+2x^2+x-7$. Then \[ \left(1+\frac{1}{(r+2)^2}\right)\left(1+\frac{1}{(s+2)^2}\right)\left(1+\frac{1}{(t+2)^2}\right)=\frac{m}{n} \] for relatively prime positive integers $m$ and $n$. Compute $100m+n$. [i]Proposed by Justin Stevens[/i]

Let $a$, $b$, $c$, $d$ and $e$ be distinct positive real numbers such that $a^2+b^2+c^2+d^2+e^2=ab+ac+ad+ae+bc+bd+be+cd+ce+de$ $a)$ Prove that among these $5$ numbers there exists triplet such that they cannot be sides of a triangle $b)$ Prove that, for $a)$, there exists at least $6$ different triplets

Among all the numbers representable as $36^k - 5^l$ ($k$ and $l$ are natural numbers) find the smallest. Prove that it is really the smallest.

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

Given a positive integer $n$. (a) If $P$ is a polynomial of degree $n$ where $P(x) \in \mathbb{Z}$ for every $x \in \mathbb{Z}$, prove that for every $a,b \in \mathbb{Z}$ where $P(a) \neq P(b)$, \[\text{lcm}(1, 2, \ldots, n) \ge \left| \dfrac{a-b}{P(a) - P(b)} \right|\] (b) Find one $P$ (for each $n$) such that the equality case above is achieved for some $a,b \in \mathbb{Z}$.

[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].