Find all functions $f:[0,1] \to \mathbb{R}$ such that the inequality \[(x-y)^2\leq|f(x) -f(y)|\leq|x-y|\] is satisfied for all $x,y\in [0,1]$

It is given that $ a^2\plus{}b^2\plus{}(a\plus{}b)^2\equal{}c^2\plus{}d^2\plus{}(c\plus{}d)^2$. Prove that $ a^4\plus{}b^4\plus{}(a\plus{}b)^4\equal{}c^4\plus{}d^4\plus{}(c\plus{}d)^4$.

Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that \[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]

Let $P_k(x)=1+x+x^2+\ldots +x^{k-1}$. Show that \[ \sum_{k=1}^n \binom{n}{k} P_k(x)=2^{n-1} P_n \left( \frac{x+1}{2} \right) \] for every real number $x$ and every positive integer $n$.

Two sequences of positive integers, $x_1,x_2,x_3, ...$ and $y_1,y_2,y_3,..$ are given, such that $\frac{y_{n+1}}{x_{n+1}} > \frac{y_n}{x_n}$ for each $n \ge 1$. Prove that there are infinitely many values of $n$ such that $y_n > \sqrt{n}$.

Let $L$ be the length of the altitude to the hypotenuse of a right triangle with legs $5$ and $12$. Find the least integer greater than $L$.

Find all functions $f : \mathbb{R} \to \mathbb{R}$ and $h : \mathbb{R}^2 \to \mathbb{R}$ such that \[f(x+y-z)^2=f(xy)+h(x+y+z, xy+yz+zx)\] for all real numbers $x,y,z$.

Find all functions from the reals to the reals satisfying \[f(xf(y) + x) = xy + f(x)\]

[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$. [b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials. [b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? [b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Define a sequence of polynomials $F_n(x)$ by $F_0(x)=0, F_1(x)=x-1$, and for $n\geq 1$, $$F_{n+1}(x)=2xF_n(x)-F_{n-1}(x)+2F_1(x).$$ For each $n$, $F_n(x)$ can be written in the form $$F_n(x)=c_nP_1(x)P_2(x)\cdots P_{g(n)}(x)$$ where $c_n$ is a constant and $P_1(x),P_2(x)\cdots, P_{g(n)}(x)$ are non-constant polynomials with integer coefficients and $g(n)$ is as large as possible. For all $2< n< 101$, let $t$ be the minimum possible value of $g(n)$ in the above expression; for how many $k$ in the specified range is $g(k)=t$?

Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$? [i]Proposed by David Yang[/i]

For every $n$, the decreasing sequence $\{x_k\}$ satisfies a condition $$x_1+x_4/2+x_9/3+...+x_n^2/n \le 1$$ Prove that for every $n$, it also satisfies $$x_1+x_2/2+x_3/3+...+x_n/n\le 3$$

Prove that: there exists only one function $f:\mathbb{N^*}\to\mathbb{N^*}$ satisfying: i) $f(1)=f(2)=1$; ii)$f(n)=f(f(n-1))+f(n-f(n-1))$ for $n\ge 3$. For each integer $m\ge 2$, find the value of $f(2^m)$.

For real numbers $a, b, c, d \in [0, 1]$, find the largest possible value of the following expression: $$a^2+b^2+c^2+d^2-ab-bc-cd-da$$ [i]Proposed by Mykhailo Shtandenko[/i]

Show that a sequence $(a_n)$ of $+1$ and $-1$ is periodic with period a power of $2$ if and only if $a_n=(-1)^{P(n)}$, where $P$ is an integer-valued polynomial with rational coefficients.

Let $x, y, z$ be nonzero real numbers such that $ x + y + z = 0$ and $$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}= 1 -xyz + \frac{1}{xyz}.$$ Determine the value of the expression ' $$\frac{x}{(1-xy) (1-xz)}+\frac{y}{(1- yx) (1- yz)}+\frac{z}{(1- zx) (1-zy)}.$$

Let $ f(x)\equal{}x^n\plus{}a_{n\minus{}1} x^{n\minus{}1}\plus{}...\plus{}a_0$ $ (n \ge 1)$ be a polynomial with real coefficients such that $ |f(0)|\equal{}f(1)$ and each root $ \alpha$ of $ f$ is real and lies in the interval $ [0,1]$. Prove that the product of the roots does not exceed $ \frac{1}{2^n}$.

Prove that for $\forall$ $z\in \mathbb{C}$ the following inequality is true: $|z|^2+2|z-1|\geq 1$, where $"="$ is reached when $z=1$.

Given $n$, let $k = k(n)$ be the minimal degree of any monic integral polynomial $$f(x)=x^k + a_{k-1}x^{k-1}+\ldots+a_0$$ such that the value of $f(x)$ is exactly divisible by $n$ for every integer $x.$ Find the relationship between $n$ and $k(n)$. In particular, find the value of $k(n)$ corresponding to $n = 10^6.$

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that $f(2m+2n)=f(m)f(n)$ for all natural numbers $m,n$.

Determine all functions $f : R_+ \to R_+$ such that: a) $f(xf(y))f(y) = f(x + y)$ for $x, y \ge 0$ b) $f(2) = 0$ c) $f(x) \ne 0$ for $0 \le x < 2$.

Two of the squares of a $ 7\times 7$ checkerboard are painted yellow, and the rest are painted green. Two color schemes are equivalent if one can be obtained from the other by applying a rotation in the plane of the board. How many inequivalent color schemes are possible?

Let $a, b, c$ be reals such that $$a^2(c^2-2b-1)+b^2(a^2-2c-1)+c^2(b^2-2a-1)=0.$$ Show that $$3(a^2+b^2+c^2)+4(a+b+c)+3 \geq 6abc.$$

Find all functions $f : R \to R$ which for all $x, y \in R$ satisfy $f(x^2)f(y^2) + |x|f(-xy^2) = 3|y|f(x^2y)$.

Compute all ordered triples $(x, y, z)$ of real numbers satisfying the following system of equations: $$xy + z = 40$$ $$xz + y = 51$$ $$x + y + z = 19.$$