Find all functions $f: R \to R$ such that for all real numbers $x, y$ holds $f(y - xy) = f(x)y + (x - 1)^2 f(y)$

Let $x,y,z$ be positive real numbers such that $x^2+y^2+z^2=3$. Prove that \[ xyz(x+y+z)+2021\geqslant 2024xyz\]

Inside an $11\times 11$ square, Pablo drew a rectangle and extending its sides divided the square into $5$ rectangles, as shown in the figure. [img]https://cdn.artofproblemsolving.com/attachments/5/a/7774da7085f283b3aae74fb5ff472572571827.gif[/img] Sofía did the same, but she also managed to make the lengths of the sides of the $5$ rectangles be whole numbers between $1$ and $10$, all different. Show a figure like the one Sofia made.

There are scales and $(n+1)$ weights with the total weight $2n$. Each weight is an integer. We put all the weights in turn on the lighter side of the scales, starting from the heaviest one, and if the scales is in equilibrium -- on the left side. Prove that when all the weights will be put on the scales, they will be in equilibrium.

Given four colours and enough square plates $1\times 1$. We have to paint four edges of every plate with four different colours and combine plates, putting them with the edges of the same colour together. Describe all the pairs $m,n$, such that we can combine those plates in a $n\times m$ rectangle, that has every edge of one colour, and its four edges have different colours.

Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients.

A cube has eight vertices (corners) and twelve edges. A segment, such as $x$, which joins two vertices not joined by an edge is called a diagonal. Segment $y$ is also a diagonal. How many diagonals does a cube have? [asy]draw((0,3)--(0,0)--(3,0)--(5.5,1)--(5.5,4)--(3,3)--(0,3)--(2.5,4)--(5.5,4)); draw((3,0)--(3,3)); draw((0,0)--(2.5,1)--(5.5,1)--(0,3)--(5.5,4),dashed); draw((2.5,4)--(2.5,1),dashed); label("$x$",(2.75,3.5),NNE); label("$y$",(4.125,1.5),NNE); [/asy] $\textbf{(A)}\ 6 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 16$

Let $A$ and $B$ be sets of positive integers with $|A|\ge 2$ and $|B|\ge 2$. Let $S$ be a set consisting of $|A|+|B|-1$ numbers of the form $ab$ where $a\in A$ and $b\in B$. Prove that there exist pairwise distinct $x,y,z\in S$ such that $x$ is a divisor of $yz$.

Let $n$ be an even integer greater than $2$. On the vertices of a regular polygon with n sides we can place red or blue chips. Two players, $A$ and $B$, play alternating turns of the next mode: each player, on their turn, chooses two vertices that have no tiles and places on one of them a red chip and in the other a blue chip. The goal of $A$ is to get three vertices consecutive with tiles of the same color. $B$'s goal is to prevent this from happening. To the beginning of the game there are no tiles in any of the vertices. Show that regardless of who starts to play, Player $B$ can always achieve his goal.

[b]p1.[/b] $17$ rooks are placed on an $8\times 8$ chess board. Prove that there must be at least one rook that is attacking at least $2$ other rooks. [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h, i$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ x & & & d & e \\ \hline & f & a & c & c \\ + & g & h & i & \\ \hline f & f & f & c & c \\ \end{tabular}$ [b]p4.[/b] Pinocchio rode a bicycle for $3.5$ hours. During every $1$-hour period he went exactly $5$ km. Is it true that his average speed for the trip was $5$ km/h? Explain your reasoning. [b]p5.[/b] Let $a, b, c$ be odd integers. Prove that the equation $ax^2 + bx + c = 0$ cannot have a rational solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $x_i\ge -1$ and $\sum^n_{i=1}x_i^3=0$. Prove $\sum^n_{i=1}x_i \le \frac{n}{3}$.

suppose that $O$ is the circumcenter of acute triangle $ABC$. we have circle with center $O$ that is tangent too $BC$ that named $w$ suppose that $X$ and $Y$ are the points of intersection of the tangent from $A$ to $w$ with line $BC$($X$ and $B$ are in the same side of $AO$) $T$ is the intersection of the line tangent to circumcirle of $ABC$ in $B$ and the line from $X$ parallel to $AC$. $S$ is the intersection of the line tangent to circumcirle of $ABC$ in $C$ and the line from $Y$ parallel to $AB$. prove that $ST$ is tangent $ABC$.

Let $n$ numbers all equal to $1$ be written on a blackboard. A move consists of replacing two numbers on the board with two copies of their sum. It happens that after $h$ moves all $n$ numbers on the blackboard are equal to $m.$ Prove that $h \leq \frac{1}{2}n \log_2 m.$

Let $k$ be a positive integer and $n_1, n_2, ..., n_k$ be non-negative integers. Points $P_1, P_2, ..., P_k$ lie on a circle in such a way that at point $P_i$ there are $n_i$ stones. Leandro wishes to change the position of some of these stones in order to accomplish his objective which is to have the same number of stones at each point of the circle. He does this by repeating as many times as necessary the following operation: if there exists a point on the circle with at least $k - 1$ stones, he can choose $k -1$ of these and distribute them by giving one to each of the remaining $k - 1$ points. For which values $n_1, n_2, ..., n_k$ can Leandro accomplish his objective? In the figure below there is a configuration of stones for $k = 4$. On the right is the initial division of stones, while on the left there is the configuration obtained from the initial one by choosing $k - 1 = 3$ stones from the top point on the circle and distributing one each to the other points. [figures missing]

Let functions $f, g: \mathbb{R}^+ \to \mathbb{R}^+$ satisfy the following: \[ f(g(x)y + f(x)) = (y+2015)f(x) \] for every $x,y \in \mathbb{R}^+$. (a) Prove that $g(x) = \frac{f(x)}{2015}$ for every $x \in \mathbb{R}^+. $ (b) State an example of function that satisfy the equation above and $f(x), g(x) \ge 1$ for every $x \in \mathbb{R}^+$.

Let $ ABC$ be a triangle with circum-circle $ \Gamma$. Let $ M$ be a point in the interior of triangle $ ABC$ which is also on the bisector of $ \angle A$. Let $ AM, BM, CM$ meet $ \Gamma$ in $ A_{1}, B_{1}, C_{1}$ respectively. Suppose $ P$ is the point of intersection of $ A_{1}C_{1}$ with $ AB$; and $ Q$ is the point of intersection of $ A_{1}B_{1}$ with $ AC$. Prove that $ PQ$ is parallel to $ BC$.

Let $n$ be a positive integer. Let $f(n)$ be the probability that, if divisors $a, b, c$ of $n$ are selected uniformly at random with replacement, then $\gcd(a, \text{lcm}(b, c)) = \text{lcm}(a, \gcd(b, c))$. Let $s(n)$ be the sum of the distinct prime divisors of $n$. If $f(n) < \frac{1}{2018}$, compute the smallest possible value of $s(n)$.

Find all the positive integers $n$ for which there exists a Family $\mathcal{F}$ of three-element subsets of $S=\{1,2,...,n\}$ satisfying \[\text{(i) for any two different elements $a,b \in S$ there exists exactly one $A \in \mathcal{F}$ containing both $a$ and $b$;}\] \[\text{(ii) if $a,b,c,x,y,z$ are elements of $S$ such that $\{a,b,x\},\{a,c,y\},\{b,c,z\} \in \mathcal{F}$, then $\{x,y,z\} \in \mathcal{F} $ }.\]

Determine for which natural numbers $n$ it is possible to completely cover a board of $ n \times n$, divided into $1 \times 1$ squares, with pieces like the one in the figure, without gaps or overlays and without leaving the board. Each of the pieces covers exactly six boxes. Note: Parts can be rotated. [img]https://cdn.artofproblemsolving.com/attachments/c/2/d87d234b7f9799da873bebec845c721e4567f9.png[/img]

In a trapezoid $ABCD$ with $AB // CD$, the diagonals $AC$ and $BD$ intersect at point $E$. Let $F$ and $G$ be the orthocenters of the triangles $EBC$ and $EAD$. Prove that the midpoint of $GF$ lies on the perpendicular from $E$ to $AB$.

Let $x,y$ be positive real numbers such that $x+y+xy=3$. Prove that $x+y\geq 2$. For what values of $x$ and $y$ do we have $x+y=2$?

An integer $n>2$ is called [i]tasty[/i] if for every ordered pair of positive integers $(a,b)$ with $a+b=n,$ at least one of $\frac{a}{b}$ and $\frac{b}{a}$ is a terminating decimal. Do there exist infinitely many tasty integers? [i]Proposed by Vincent Huang[/i]

On a circle there are $2n+1$ points, dividing it into equal arcs ($n\ge 2$). Two players take turns to erase one point. If after one player's turn, it turned out that all the triangles formed by the remaining points on the circle were obtuse, then the player wins and the game ends. Who has a winning strategy: the starting player or his opponent?

In an acute-angled triangle $ABC$, the point $H{}$ is the orthocenter, $M{}$ is the midpoint of the side $BC$ and $\omega$ is the circumcircle. The lines $AH, BH$ and $CH{}$ intersect $\omega$ a second time at points $D, E$ and $F{}$ respectively. The ray $MH$ intersects $\omega$ at point $J{}$. The points $K{}$ and $L{}$ are the centers of the inscribed circles of the triangles $DEJ$ and $DFJ$ respectively. Prove that $KL\parallel BC$.

The diagram shows an octagon consisting of $10$ unit squares. The portion below $\overline{PQ}$ is a unit square and a triangle with base $5$. If $\overline{PQ}$ bisects the area of the octagon, what is the ratio $\frac{XQ}{QY}$? [asy] import graph; size(300); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen xdxdff = rgb(0.49,0.49,1); draw((0,0)--(6,0),linewidth(1.2pt)); draw((0,0)--(0,1),linewidth(1.2pt)); draw((0,1)--(1,1),linewidth(1.2pt)); draw((1,1)--(1,2),linewidth(1.2pt)); draw((1,2)--(5,2),linewidth(1.2pt)); draw((5,2)--(5,1),linewidth(1.2pt)); draw((5,1)--(6,1),linewidth(1.2pt)); draw((6,1)--(6,0),linewidth(1.2pt));draw((1,1)--(5,1),linewidth(1.2pt)); draw((1,1)--(1,0),linewidth(1.2pt));draw((2,2)--(2,0),linewidth(1.2pt)); draw((3,2)--(3,0),linewidth(1.2pt)); draw((4,2)--(4,0),linewidth(1.2pt)); draw((5,1)--(5,0),linewidth(1.2pt)); draw((0,0)--(5,1.5),linewidth(1.2pt)); dot((0,0),ds); label("$P$", (-0.23,-0.26),NE*lsf); dot((0,1),ds); dot((1,1),ds); dot((1,2),ds); dot((5,2),ds); label("$X$", (5.14,2.02),NE*lsf); dot((5,1),ds); label("$Y$", (5.12,1.14),NE*lsf); dot((6,1),ds); dot((6,0),ds); dot((1,0),ds); dot((2,0),ds); dot((3,0),ds); dot((4,0),ds); dot((5,0),ds); dot((2,2),ds); dot((3,2),ds); dot((4,2),ds); dot((5,1.5),ds); label("$Q$", (5.14,1.51),NE*lsf); clip((-4.19,-5.52)--(-4.19,6.5)--(10.08,6.5)--(10.08,-5.52)--cycle); [/asy] $\textbf{(A)}\ \frac 25 \qquad \textbf{(B)}\ \frac 12 \qquad \textbf{(C)}\ \frac 35 \qquad \textbf{(D)}\ \frac 23 \qquad \textbf{(E)}\ \frac 34$