Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ that satisfy the following condition for any real numbers $x{}$ and $y$ $$f(x)+f(x+y) \leq f(xy)+f(y).$$

Solve the system of equations: $\left\{ \begin{aligned} x^4+y^2-xy^3-\frac{9}{8}x = 0 \\ y^4+x^2-yx^3-\frac{9}{8}y=0 \end{aligned} \right.$

Solve $2|3-2x|-|x-2|=x$ , $x\in\mathbb{R}$ .

[b]p1.[/b] A Slavic dragon has three heads. A knight fights the dragon. If the knight cuts off one dragon’s head three new heads immediately grow. Is it possible that the dragon has $2018$ heads at some moment of the fight? [b]p2.[/b] Peter has two squares $3\times 3$ and $4\times 4$. He must cut one of them or both of them in no more than four parts in total. Is Peter able to assemble a square using all these parts? [b]p3.[/b] Usually, dad picks up Constantine after his music lessons and they drive home. However, today the lessons have ended earlier and Constantine started walking home. He met his dad $14$ minutes later and they drove home together. They arrived home $6$ minutes earlier than usually. Home many minutes earlier than usual have the lessons ended? Please, explain your answer. [b]p4.[/b] All positive integers from $1$ to $2018$ are written on a blackboard. First, Peter erased all numbers divisible by $7$. Then, Natalie erased all remaining numbers divisible by $11$. How many numbers did Natalie remove? Please, explain your answer. [b]p5.[/b] $30$ students took part in a mathematical competition consisting of four problems. $25$ students solved the first problem, $24$ students solved the second problem, $22$ students solved the third, and, finally, $21$ students solved the fourth. Show that there are at least two students who solved all four problems. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\alpha$ be a real number. Determine all polynomials $P$ with real coefficients such that $$P(2x+\alpha)\leq (x^{20}+x^{19})P(x)$$ holds for all real numbers $x$. [i]Proposed by Walther Janous, Austria[/i]

Find a finite sequence of 16 numbers such that: (a) it reads same from left to right as from right to left. (b) the sum of any 7 consecutive terms is $ \minus{}1$, (c) the sum of any 11 consecutive terms is $ \plus{}1$.

[b]p1.[/b] Find the minimum value of $x^4 +2x^3 +3x^2 +2x+2$, where x can be any real number. [b]p2.[/b] A type of digit-lock has $5$ digits, each digit chosen from $\{1,2, 3, 4, 5\}$. How many different passwords are there that have an odd number of $1$'s? [b]p3.[/b] Tony is a really good Ping Pong player, or at least that is what he claims. For him, ping pong balls are very important and he can feel very easily when a ping pong ball is good and when it is not. The Ping Pong club just ordered new balls. They usually order form either PPB company or MIO company. Tony knows that PPB balls have $80\%$ chance to be good balls and MIO balls have $50\%$ chance to be good balls. I know you are thinking why would anyone order MIO balls, but they are way cheaper than PPB balls. When the box full with balls arrives (huge number of balls), Tony tries the first ball in the box and realizes it is a good ball. Given that the Ping Pong club usually orders half of the time from PPB and half of the time from MIO, what is the probability that the second ball is a good ball? [b]p4.[/b] What is the smallest positive integer that is one-ninth of its reverse? [b]p5.[/b] When Michael wakes up in the morning he is usually late for class so he has to get dressed very quickly. He has to put on a short sleeved shirt, a sweater, pants, two socks and two shoes. People usually put the sweater on after they put the short sleeved shirt on, but Michael has a different style, so he can do it both ways. Given that he puts on a shoe on a foot after he put on a sock on that foot, in how many dierent orders can Michael get dressed? [b]p6.[/b] The numbers $1, 2,..., 2015$ are written on a blackboard. At each step we choose two numbers and replace them with their nonnegative difference. We stop when we have only one number. How many possibilities are there for this last number? [b]p7.[/b] Let $A = (a_1b_1a_2b_2... a_nb_n)_{34}$ and $B = (b_1b_2... b_n)_{34}$ be two numbers written in base $34$. If the sum of the base-$34$ digits of $A$ is congruent to $15$ (mod $77$) and the sum of the base $34$ digits of $B$ is congruent to $23$ (mod $77$). Then if $(a_1b_1a_2b_2... a_nb_n)_{34} \equiv x$ (mod $77$) and $0 \le x \le 76$, what is $x$? (you can write $x$ in base $10$) [b]p8.[/b] What is the sum of the medians of all nonempty subsets of $\{1, 2,..., 9\}$? [b]p9.[/b] Tony is moving on a straight line for $6$ minutes{classic Tony. Several finitely many observers are watching him because, let's face it, you can't really trust Tony. In fact, they must watch him very closely{ so closely that he must never remain unattended for any second. But since the observers are lazy, they only watch Tony uninterruptedly for exactly one minute, and during this minute, Tony covers exactly one meter. What is the sum of the minimal and maximal possible distance Tony can walk during the six minutes? [b]p10.[/b] Find the number of nonnegative integer triplets $a, b, c$ that satisfy $$2^a3^b + 9 = c^2.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

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.

Prove that for positive reals $a,b,c$, \[\frac{8a^2+2ab}{(b+\sqrt{6ac}+3c)^2}+\frac{2b^2+3bc}{(3c+\sqrt{2ab}+2a)^2}+\frac{18c^2+6ac}{(2a+\sqrt{3bc}+b})^2\geq 1\]

Let $x,y,z \in \mathbb{R}^+$ satisfying $xyz=3(x+y+z)$. Prove, that \begin{align*} \sum \frac{1}{x^2(y+1)} \geq \frac{3}{4(x+y+z)} \end{align*}

$a_1, a_2,...,a_{2006}$ is a permutation of $1,2,...,2006$. Prove that $\prod_{i = 1}^{2006} (a_{i}^2-i) $ is a multiple of $3$. ($0$ is counted as a multiple of $3$)

A real number sequence $a_1, \cdots ,a_{2021}$ satisfies the below conditions. $$a_1=1, a_2=2, a_{n+2}=\frac{2a_{n+1}^2}{a_n+a_{n+1}} (1\leq n \leq 2019)$$ Let the minimum of $a_1, \cdots ,a_{2021}$ be $m$, and the maximum of $a_1, \cdots ,a_{2021}$ be $M$. Let a 2021 degree polynomial $$P(x):=(x-a_1)(x-a_2) \cdots (x-a_{2021})$$ $|P(x)|$ is maximum in $[m, M]$ when $x=\alpha$. Show that $1<\alpha <2$.

$P(x)$ is polynomial with degree $n>5$ and integer coefficients have $n$ different integer roots. Prove that $P(x)+3$ have $n$ different real roots.

Let $x$ and $y$ be positive numbers with $x +y=1$. Show that $$\left(1+\frac{1}{x}\right)\left(1+\frac{1}{y}\right) \ge 9.$$

Let $n \in \mathbb{N}, n \ge 2$ and the positive real numbers $a_1,a_2,…,a_n$ and $b_1,b_2,…,b_n$ such that $a_1+a_2+…+a_n=b_1+b_2+…+b_n=S.$ $\textbf{a)}$ Prove that $\sum\limits_{k=1}^n \frac{a_k^2}{a_k+b_k} \ge \frac{S}{2}.$ $\textbf{b)}$ Prove that $\sum\limits_{k=1}^n \frac{a_k^2}{a_k+b_k}= \sum\limits_{k=1}^n \frac{b_k^2}{a_k+b_k}.$

Solve in the interval $ (2,\infty ) $ the following equation: $$ 1=\cos\left( \pi\log_3 (x+6)\right)\cdot\cos\left( \pi\log_3 (x-2)\right) . $$

Find the smallest real number \(a\) such that for any positive integer number \(n > 2\) and any arrangement of the numbers from 1 to \(n\) on a circle, there exists a pair of adjacent numbers whose ratio (when dividing the larger number by the smaller one) is less than \(a\). [i]Proposed by Mykhailo Shtandenko[/i]

Let $P$ be a polynomial with real coefficients. Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that there exists a real number $t$ such that \[f(x+t) - f(x) = P(x)\] for all $x \in \mathbb{R}$.

Find all real $x,y,z$ such that $\frac{x-2y}{y}+\frac{2y-4}{x}+\frac{4}{xy}=0$ and $\frac{1}{x}+\frac{1}{y}+\frac{1}{z}=2$.

Given are real numbers $a_1, a_2,..., a_{2020}$, not necessarily different. For every $n \ge 2020$, define $a_{n + 1}$ as the smallest real zero of the polynomial $$P_n (x) = x^{2n} + a_1x^{2n - 2} + a_2x^{2n - 4} +... + a_{n -1}x^2 + a_n$$, if it exists. Assume that $a_{n + 1}$ exists for all $n \ge 2020$. Prove that $a_{n + 1} \le a_n$ for all $n \ge 2021$.

$k$ is a fixed positive integer. Let $a_n$ be the number of maps $f$ from the subsets of $\{1, 2, ... , n\}$ to $\{1, 2, ... , k\}$ such that for all subsets $A, B$ of $\{1, 2, ... , n\}$ we have $f(A \cap B) = \min (f(A), f(B))$. Find $\lim_{n \to \infty} \sqrt[n]{a_n}$.

Show that the only polynomial of odd degree satisfying $p(x^2-1) = p(x)^2 - 1$ for all $x$ is $p(x) = x$

An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

On the first day of school, Ashley the teacher asked some of her students what their favorite color was and used those results to construct the pie chart pictured below. During this first day, $165$ students chose yellow as their favorite color. The next day, she polled $30$ additional students and was shocked when none of them chose yellow. After making a new pie chart based on the combined results of both days, Ashley noticed that the angle measure of the sector representing the students whose favorite color was yellow had decreased. Compute the difference, in degrees, between the old and the new angle measures. [img]https://cdn.artofproblemsolving.com/attachments/2/5/f605bf8d684075fe13fee9eb44f8f50b64c7d3.png[/img]

Prove that for every natural number $k$ ($k \geq 2$) there exists an irrational number $r$ such that for every natural number $m$, \[[r^m] \equiv -1 \pmod k .\] [i]Remark.[/i] An easier variant: Find $r$ as a root of a polynomial of second degree with integer coefficients. [i]Proposed by Yugoslavia.[/i]