Find all functions $f:\mathbb R\to\mathbb R$ such that for reals $x,y$, $$f(xf(y)+y)=yf(x)+f(y).$$

[b]p1.[/b] Replace $*$’s by an arithmetic operations (addition, subtraction, multiplication or division) to obtain true equality $$2*0*1*6*7=1.$$ [b]p2.[/b] The interval of length $88$ cm is divided into three unequal parts. The distance between middle points of the left and right parts is $46$ cm. Find the length of the middle part. [b]p3.[/b] A $5\times 6$ rectangle is drawn on a square grid. Paint some cells of the rectangle in such a way that every $3\times 2$ sub‐rectangle has exactly two cells painted. [b]p4.[/b] There are $8$ similar coins. $5$ of them are counterfeit. A detector can analyze any set of coins and show if there are counterfeit coins in this set. The detector neither determines which coins nare counterfeit nor how many counterfeit coins are there. How to run the detector twice to find for sure at least one counterfeit coin? [b]p5.[/b] There is a set of $20$ weights of masses $1, 2, 3,...$ and $20$ grams. Can one divide this set into three groups of equal total masses? [b]p6.[/b] Replace letters $A,B,C,D,E,F,G$ by the digits $0,1,...,9$ to get true equality $AB+CD=EF * EG$ (different letters correspond to different digits, same letter means the same digit, $AB$, $CD$, $EF$, and $EG$ are two‐digit numbers). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $f,g: \mathbb{R} \to \mathbb{R}$ are functions that satisfy $f(x+g(y)) = 2x+y $ $\forall x,y \in \mathbb{R}$, then determine $g(x+f(y))$.

Define $a_1=1$ and $a_{n+1}=\frac{a_n}{n}+\frac{n}{a_n}$ for $n\in\mathbb{N}$. Find the greatest integer not exceeding $a_{2000}$ and prove your claim.

Let $p,q, r, s$ be real numbers with $q \ne -1$ and $s \ne -1$. Prove that the quadratic equations $x^2 + px+q = 0$ and $x^2 +rx+s = 0$ have a common root, while their other roots are inverse of each other, if and only if $pr = (q+1)(s+1)$ and $p(q+1)s = r(s+1)q$. (A double root is counted twice.)

Find all triples of nonnegative real numbers \((x, y, z)\) that satisfy the equality: \[ \frac{\left(x^2 - y\right)(1 - y)}{(x - y)^2} + \frac{\left(y^2 - z\right)(1 - z)}{(y - z)^2} + \frac{\left(z^2 - x\right)(1 - x)}{(z - x)^2} = 3 \] [i]Proposed by Vadym Solomka[/i]

Determine all positive integers $n$ for which the number \[ N = \frac{1}{n \cdot (n + 1)} \] can be represented as a finite decimal fraction.

Let $a$ and $b$ be real numbers such that $a+b=\log_2( \log_2 3)$. What is the minimum value of $2^a + 3^b$ ?

Find all $x$ for which the equation $ x^2 + y^2 + z^2 + 2xyz = 1$ (relative to $z$) has a valid solution for any $y$.

Let $x_1=1$ and $x_{n+1} =x_n+\left\lfloor \frac{x_n}{n}\right\rfloor +2$, for $n=1,2,3,\ldots $ where $x$ denotes the largest integer not greater than $x$. Determine $x_{1997}$.

Determine all triples $(a,b,c)$ of integers that simultaneously satisfy the following relations: \begin{align*} a^2 + a = b + c, \\ b^2 + b = a + c, \\ c^2 + c = a + b. \end{align*}

Consider the parabola consisting of the points $(x, y)$ in the real plane satisfying $$(y + x) = (y - x)^2 + 3(y - x) + 3.$$ Find the minimum possible value of $y$.

Let $m \neq 0 $ be an integer. Find all polynomials $P(x) $ with real coefficients such that \[ (x^3 - mx^2 +1 ) P(x+1) + (x^3+mx^2+1) P(x-1) =2(x^3 - mx +1 ) P(x) \] for all real number $x$.

Prove that there does not exist a function $f : \mathbb R^+\to\mathbb R^+$ such that \[f(f(x)+y)=f(x)+3x+yf(y)\] for all positive reals $x,y$.

We say that a nonconstant polynomial $p(x)$ with real coefficients is split into two squares if it is represented as $a(x) +b(x)$ where $a(x)$ and $b(x)$ are squares of polynomials with real coefficients. Is there such a polynomial $p(x)$ that it may be split into two squares: a) in exactly one way; b) in exactly two ways? Note: two splittings that differ only in the order of summands are considered to be the same. Sergey Markelov

A shop sells bottles with this capacity: $1L, 2L, 3L,..., 1996L$, the prices of bottles satifies this $2$ conditions: $1$. Two bottles have the same price, if and only if, your capacities satifies $m - n = 1000$ $2$. The price of bottle $m$($1001>m>0$) is $1996 - m$ dollars. Find all pair(s) $m$ and $n$ such that: a) $m + n = 1000$ b) the cost is smallest possible!!! c) with the pair, the shop can measure $k$ liters, with $0<k<1996$(for all $k$ integer) Note: The operations to measure are: i) To fill or empty any one of two bottles ii)Pass water of a bottle for other bottle We can measure $k$ liters when the capacity of one bottle plus the capacity of other bottle is equal to $k$

Let $a_{1},a_{2},\ldots ,a_{n}$ be positive real numbers such that $a_{1}+a_{2}+\cdots +a_{n}<1$. Prove that \[ \frac{a_{1} a_{2} \cdots a_{n} \left[ 1 - (a_{1} + a_{2} + \cdots + a_{n}) \right] }{(a_{1} + a_{2} + \cdots + a_{n})( 1 - a_{1})(1 - a_{2}) \cdots (1 - a_{n})} \leq \frac{1}{ n^{n+1}}. \]

Call a polynomial positive reducible if it can be written as a product of two nonconstant polynomials with positive real coefficients. Let $ f(x)$ be a polynomial with $ f(0)\not\equal{}0$ such that $ f(x^n)$ is positive reducible for some natural number $ n$. Prove that $ f(x)$ itself is positive reducible. [L. Redei]

Solve in $ \mathbb{R} $ the equation $ 4^{x^2-x}=\log_2 x+\sqrt{x-1} +14. $ [i]Marin Tolosi[/i]

Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that \[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\] for all $ m,n \in S$. [i]Bulgaria[/i]

Let $n \ge 2$ be a natural number and suppose that positive numbers $a_0,a_1,...,a_n$ satisfy the equality $(a_{k-1}+a_{k})(a_{k}+a_{k+1})=a_{k-1}-a_{k+1}$ for each $k =1,2,...,n -1$. Prove that $a_n< \frac{1}{n-1}$

Let $N$ be the smallest positive integer such that $N+2N+3N+\ldots +9N$ is a number all of whose digits are equal. What is the sum of digits of $N$?

Find the minimum value of $S = |x + 1| + |x + 5|+ |x + 14| + |x + 97| + |x + 1920|$.

Prove that if for a polynomial $P(x, y)$, we have \[P(x - 1, y - 2x + 1) = P(x, y),\] then there exists a polynomial $\Phi(x)$ with $P(x, y) = \Phi(y - x^2).$