Is it true that if $H$ and $A$ are bounded subsets of $\mathbb{R}$, then there exists at most one set $B$ such that $a+b(a\in A,b\in B)$ are pairwise distinct and $H=A+B$.

Let $ n\ge 2 $ be a natural number and $ A $ be a subset of $ \{1,2,\ldots ,n\} $ having the property that $ x+y $ belongs to $ A $ for any choosing of $ x,y $ such that $ x+y\le n. $ Prove that the arithmetic mean of the elements of $ A $ is at least $ \frac{n+1}{2} . $

[b]p4.[/b] For how many three-digit multiples of $11$ in the form $\underline{abc}$ does the quadratic $ax^2 + bx + c$ have real roots? [b]p5.[/b] William draws a triangle $\vartriangle ABC$ with $AB =\sqrt3$, $BC = 1$, and $AC = 2$ on a piece of paper and cuts out $\vartriangle ABC$. Let the angle bisector of $\angle ABC$ meet $AC$ at point $D$. He folds $\vartriangle ABD$ over $BD$. Denote the new location of point $A$ as $A'$. After William folds $\vartriangle A'CD$ over $CD$, what area of the resulting figure is covered by three layers of paper? [b]p6.[/b] Compute $(1)(2)(3) + (2)(3)(4) + ... + (18)(19)(20)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the following sequence of positive real numbers $\dots<a_{-2}<a_{-1}<a_0<a_1<a_2<\dots$ infinite in both directions. For each positive integer $k$ let $b_k$ be the least integer such that the ratio between the sum of $k$ consecutive terms and the greatest of these $k$ terms is less than or equal to $b_k$(This fact occurs for any sequence of $k$ consecutive numbers). Prove that the sequence $b_1,b_2,b_3,...$ coincides with the sequence $1,2,3,...$ or is eventually constant.

Factor $(b - c)^3 + (c - a)^3 + (a - b)^3$.

Two lines parallel to the $x$-axis cut the graph of $y=ax^3+bx^2+cx+d$ in points $A,C,E$ and $B,D,F$ respectively, in that order from left to right. Prove that the length of the projection of the segment $CD$ onto the $x$-axis equals the sum of the lengths of the projections of $AB$ and $EF$.

Let $a$ be a real number, such that $a\ne 0, a\ne 1, a\ne -1$ and $m,n,p,q$ be natural numbers . Prove that if $a^m+a^n=a^p+a^q$ and $a^{3m}+a^{3n}=a^{3p}+a^{3q}$ , then $m \cdot n = p \cdot q$.

Given sequence $ \{ c_n \}$ satisfying the conditions that $ c_0\equal{}1$, $ c_1\equal{}0$, $ c_2\equal{}2005$, and $ c_{n\plus{}2}\equal{}\minus{}3c_n \minus{} 4c_{n\minus{}1} \plus{}2008$, ($ n\equal{}1,2,3, \cdots$). Let $ \{ a_n \}$ be another sequence such that $ a_n\equal{}5(c_{n\plus{}1} \minus{} c_n) \cdot (502 \minus{} c_{n\minus{}1} \minus{} c_{n\minus{}2}) \plus{} 4^n \times 2004 \times 501$, ($ n\equal{}2,3, \cdots$). Is $ a_n$ a perfect square for every $ n > 2$?

Let $\mathcal{P}$ be the set of all polynomials with coefficients in $\{0, 1\}$. Suppose $a, b$ are non-zero integers such that for every $f \in \mathcal{P}$ with $f(a)\neq 0$, we have $f(a) \mid f(b)$. Prove that $a=b$. [i]Proposed by Shashank Ingalagavi and Krutarth Shah[/i]

For arbitrary real number $x$, the function $f : \mathbb R \to \mathbb R$ satisfies $f(f(x))-x^2+x+3=0$. Show that the function $f$ does not exist.

Show that for any positive real numbers $a$, $b$, $c$ the following inequality takes place $$\frac{a}{\sqrt{7a^2+b^2+c^2}}+\frac{b}{\sqrt{a^2+7b^2+c^2}}+\frac{c}{\sqrt{a^2+b^2+7c^2}} \leq 1.$$

Let $ M$ be the set of all polynomials $ P(x)$ with pairwise distinct integer roots, integer coefficients and all absolut values of the coefficients less than $ 2007$. Which is the highest degree among all the polynomials of the set $ M$?

Prove that the equation $$ (x - a) (x - c) + 2 (x - b) (x - d) = 0,$$ in which $ a < b < c < d $, has two real roots.

Let $a$, $b$, $c$ be positive real numbers. Determine the minimum value of the following expression $$ \frac{a^2+2b^2+4c^2}{b(a+2c)}$$

For every non-constant polynomial $p$, let $H_p=\big\{z\in \mathbb{C} \, \big| \, |p(z)|=1\big\}$. Prove that if $H_p=H_q$ for some polynomials $p,q$, then there exists a polynomial $r$ such that $p=r^m$ and $q=\xi\cdot r^n$ for some positive integers $m,n$ and constant $|\xi|=1$.

For $k \in \left \{ 0, 1, \ldots, 9 \right \},$ let $\epsilon_k \in \left \{-1, 1 \right \}$. If the minimum possible value of $\sum_{i = 1}^9 \sum_{j = 0}^{i -1} \epsilon_i \epsilon_j 2^{i + j}$ is $m$, find $|m|$.

Let \[ p(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x+a_0, \] where the coefficients $a_i$ are integers. If $p(0)$ and $p(1)$ are both odd, show that $p(x)$ has no integral roots.

In a mathematical contest, three problems, $A,B,C$ were posed. Among the participants ther were 25 students who solved at least one problem each. Of all the contestants who did not solve problem $A$, the number who solved $B$ was twice the number who solved $C$. The number of students who solved only problem $A$ was one more than the number of students who solved $A$ and at least one other problem. Of all students who solved just one problem, half did not solve problem $A$. How many students solved only problem $B$?

Show that $abc \le (ab + bc + ca)(a^2 + b^2 + c^2)^2$ for all positive real numbers $a, b$ and $c$ such that $a + b + c = 1$.

Quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$, both of which have real roots, are called friendly if for all $t \in [0,1]$ quadratic polynomial $tP(x)+(1-t)Q(x)$ also has real roots. a) Provide an example of quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$ and which have real roots, that are not friendly. b) Prove that for any two quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$ that have real roots, there is a quadratic polynomial $R(x)$ which has a leading coefficient $1$ and which is friendly to both $P$ and $Q$

Solve the following system of equations: $$\begin{cases} x^3+y+z=1\\ x+y^3+z=1\\ x+y+z^3=1\end{cases}$$

For which real $a$ are there distinct reals $x$, $y$ such that $$\begin{cases} x = a - y^2 \\ y = a - x^2 \,\,\, ? \end {cases}$$

Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of \[ \left|1-\sum_{i \in X} a_{i}\right| \] is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that \[ \sum_{i \in X} b_{i}=1. \]

Do there exist two polynomials with integer coefficients such that each polynomial has a coefficient with an absolute value exceeding $2015$ but all coefficients of their product have absolute values not exceeding $1$? [i]($10$ points)[/i]

For a quadratic trinomial $f(x)$ and the different numbers $a$ and $b$ it is known that $f(a)=b$ and $f(b)=a$. We call such $a$ and $b$ [i]conjugate[/i] for $f(x)$. Prove that $f(x)$ has no other [i]conjugate[/i] numbers.