Find all functions $ f: \mathbb{R}\to\mathbb{R}$ such that $ f(x+y)+f(x)f(y)=f(xy)+2xy+1$ for all real numbers $ x$ and $ y$. [i]Proposed by B.J. Venkatachala, India[/i]

Given some monic polynomials $P_1, \ldots, P_n$ with real coefficients, for any real number $y$, let $S_y$ be the set of real number $x$ such that $y = P_i(x)$ for some $i = 1, 2, ..., n$. If the sets $S_{y_1}, S_{y_2}$ have the same size for any two real numbers $y_1, y_2$, show that $P_1, \ldots, P_n$ have the same degree. [i] Proposed by usjl[/i]

$10.$ A $2\times 3$ rectangle and a $3 \times 4$ rectangle are contained within a square without overlapping at any interior point, and the sides of the square are parallel to the sides of the two given rectangles. What is the smallest possible area of the square $?$

Find the sum of all positive integers $x$ such that there is a positive integer $y$ satisfying $9x^2 - 4y^2 = 2021$.

Consider $f(x)=x^4+ax^3+bx^2+cx+d\; (a,b,c,d\in\mathbb{R})$. It is known that $f$ intersects X-axis in at least $3$ (distinct) points. Show either $f$ has $4$ $\mathbf{distinct}$ real roots or it has $3$ $\mathbf{distinct}$ real roots and one of them is a point of local maxima or minima.

Let $f : N \to R$ be a function, satisfying the following condition: for every integer $n > 1$, there exists a prime divisor $p$ of $n$ such that $f(n) = f \big(\frac{n}{p}\big)-f(p)$. If $f(2^{2007}) + f(3^{2008}) + f(5^{2009}) = 2006$, determine the value of $f(2007^2) + f(2008^3) + f(2009^5)$

A quadrilateral $ABCD$ is inscribed in a circle. Suppose that $|DA| =|BC|= 2$ and$ |AB| = 4$. Let $E $ be the intersection point of lines $BC$ and $DA$. Suppose that $\angle AEB = 60^o$ and that $|CD| <|AB|$. Calculate the radius of the circle.

Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$; Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$. Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins. [i]Proposed by Hans Zantema, Netherlands[/i]

Let $a, b$ and $c$ be positive real numbers for which $a + b + c = 1$. Prove that $$\frac{a^2}{b^3 + c^4 + 1}+\frac{b^2}{c^3 + a^4 + 1}+\frac{c^2}{a^3 + b^4 + 1} > \frac{1}{5}$$

Let $ABC$ be a triangle, the point $E$ is in the segment $AC$, the point $F$ is in the segment $AB$ and $P=BE\cap CF$. Let $D$ be a point such that $AEDF$ is a parallelogram, Prove that $D$ is in the side $BC$, if and only if, the triangle $BPC$ and the quadrilateral $AEPF$ have the same area.

Let $\mathbb{Z}^+$ be the set of positive integers. Find all functions $f:\mathbb{Z}^+ \rightarrow\mathbb{Z}^+$ such that the following conditions both hold: (i) $f(n!)=f(n)!$ for every positive integer $n$, (ii) $m-n$ divides $f(m)-f(n)$ whenever $m$ and $n$ are different positive integers.

Determine all functions $f : R \to R$ such that for all $x, y\in R$ holds $$f (f(x) + 2f(y)) = f(2x) + 8y + 6.$$

Let $ABC$ be a triangle with $AB = AC$ with centroid $G$. Let $M$ and $N$ be the midpoints of $AB$ and $AC$ respectively and $O$ be the circumcenter of triangle $BCN$ . Prove that $MBOG$ is a cyclic quadrilateral .

Two players are playing game. Players alternately write down one natural number greater than $1$, but it is not allowed to write linear combination previously written numbers with nonnegative integer coefficients. Player lose a game if he can't write a new number. Does any of players can have wiining strategy, if yes, then which one of them? [i]Journal "Kvant" / Aleksandar Ilic[/i]

The interior bisector of $\angle A$ from $\triangle ABC$ intersects the side $BC$ and the circumcircle of $\Delta ABC$ at $D,M$, respectively. Let $\omega$ be a circle with center $M$ and radius $MB$. A line passing through $D$, intersects $\omega$ at $X,Y$. Prove that $AD$ bisects $\angle XAY$.

Triangle $\vartriangle ABC$ has $m\angle C = 135^o$, and $D$ is the foot of the altitude from $C$ to $AB$. We are told that $CD = 2$ and that $AD$ and $BD$ are finite positive integers. What is the sum of all distinct possible values of $AB$?

We have $ 100$ equal cubes. Player $ A$ has to paint the faces of the cubes, each white or black, such that every cube has at least one face of each colour, at least $ 50$ cubes have more than one black face and at least $ 50$ cubes have more than one white face . Player $ B$ has to place the coloured cubes in a table in a way that their bases form the frame that surrounds a $ 40*12$ rectangle. There are some faces that can not been seen because they are overlapped with other faces or based on the table, we call them invisible faces. On the other hand, the ones which can be seen are called visible faces. Prove that player $ B$ can always place the cubes in such a way that the number of visible faces is the the same as the number of invisible faces, despite the initial colouring of player $ A$ Note: It is easy to see that in the configuration, each cube has three visible faces and three invisible faces

Find all positive integers $n$ such that the number $\frac{(2n)!+1}{n!+1}$ is positive integer.

Determine all ordered quadruples of real numbers $(x_1, x_2, x_3, x_4)$ for which the following system of equations exists, is fulfilled: $$x_1 + ax_2 + x_3 = b $$ $$x_2 + ax_3 + x_4 = b $$ $$x_3 + ax_4 + x_1 = b $$ $$x_4 + ax_1 + x_2 = b$$ Here $a$ and $b$ are real numbers (case distinction!).

[b]2.[/b] Construct a sequence $(a_n)_{n=1}^{\infty}$ of complex numbers such that, for every $l>0$, the series $\sum_{n=1}^{\infty} \mid a_n \mid ^{l}$ be divergent, but for almost all $\theta$ in $(0,2\pi)$, $\prod_{n=1}^{\infty} (1+a_n e^{i\theta})$ be convergent. [b](S. 11)[/b]

$(BUL 5)$ Let $Z$ be a set of points in the plane. Suppose that there exists a pair of points that cannot be joined by a polygonal line not passing through any point of $Z.$ Let us call such a pair of points unjoinable. Prove that for each real $r > 0$ there exists an unjoinable pair of points separated by distance $r.$

Initially one have the number $0$ in each cell of the table $29 \times 29$. A [i]moviment[/i] is when one choose a sub-table $5 \times 5$ and add $+1$ for every cell of this sub-table. Find the maximum value of $n$, where after $1000$ [i]moviments[/i], there are $4$ cells such that your centers are vertices of a square and the sum of this $4$ cells is at least $n$. [b]Note:[/b] A square does not, necessarily, have your sides parallel with the sides of the table.

Make a graphical representation of the function $y=\vert \vert \vert x-1 \vert -2 \vert -3 \vert$ on the interval $-8 \leq x \leq 8$.

For each positive integer $n$, let $f(n)$ be the maximal natural number such that: $2^{f(n)}$ divides $\sum^{\left\lfloor \frac{n - 1}{2}\right\rfloor}_{i=0} \binom{n}{2 \cdot i + 1} 3^i$. Find all $n$ such that $f(n) = 1996.$ [hide="old version"]For each positive integer $n$, let $f(n)$ be the maximal natural number such that: $2^{f(n)}$ divides $\sum^{n + 1/2}_{i=1} \binom{2 \cdot i + 1}{n}$. Find all $n$ such that $f(n) = 1996.$[/hide]

Find all functions $f$, of the form $f(x) = x^3 +px^2 +qx+r$ with $p$, $q$ and $r$ integers, such that $f(s) = 506$ for some integer $s$ and $f(\sqrt3) = 0$.