Polynomial $P$ with non-negative real coefficients and function $f:\mathbb{R}^+\to \mathbb{R}^+$ are given such that for all $x, y\in \mathbb{R}^+$ we have $$f(x+P(x)f(y)) = (y+1)f(x)$$ (a) Prove that $P$ has degree at most 1. (b) Find all function $f$ and non-constant polynomials $P$ satisfying the equality.

Let $P$ be a point in the interior of an acute triangle $ABC$, and let $Q$ be its isogonal conjugate. Denote by $\omega_P$ and $\omega_Q$ the circumcircles of triangles $BPC$ and $BQC$, respectively. Suppose the circle with diameter $\overline{AP}$ intersects $\omega_P$ again at $M$, and line $AM$ intersects $\omega_P$ again at $X$. Similarly, suppose the circle with diameter $\overline{AQ}$ intersects $\omega_Q$ again at $N$, and line $AN$ intersects $\omega_Q$ again at $Y$. Prove that lines $MN$ and $XY$ are parallel. (Here, the points $P$ and $Q$ are [i]isogonal conjugates[/i] with respect to $\triangle ABC$ if the internal angle bisectors of $\angle BAC$, $\angle CBA$, and $\angle ACB$ also bisect the angles $\angle PAQ$, $\angle PBQ$, and $\angle PCQ$, respectively. For example, the orthocenter is the isogonal conjugate of the circumcenter.) [i]Proposed by Sammy Luo[/i]

Paul can write polynomial $(x+1)^n$, expand and simplify it, and after that change every coefficient by its reciprocal. For example if $n=3$ Paul gets $(x+1)^3=x^3+3x^2+3x+1$ and then $x^3+\frac13x^2+\frac13x+1$. Prove that Paul can choose $n$ for which the sum of Paul’s polynomial coefficients is less than $2.022$.

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

Alice is making a batch of cookies and needs $2 \frac{1}{2}$ cups of sugar. Unforunately, her measuring cup holds only $\frac{1}{4}$ cup of sugar. How many times must she fill that cup to get the correct amount of sugar? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 16 \qquad\textbf{(E)}\ 20$

An open box is constructed by starting with a rectangular sheet of metal $ 10$ in. by $ 14$ in. and cutting a square of side $ x$ inches from each corner. The resulting projections are folded up and the seams welded. The volume of the resulting box is: $ \textbf{(A)}\ 140x \minus{} 48x^2 \plus{} 4x^3 \qquad \textbf{(B)}\ 140x \plus{} 48x^2 \plus{} 4x^3\qquad \\\textbf{(C)}\ 140x \plus{} 24x^2 \plus{} x^3\qquad \textbf{(D)}\ 140x \minus{} 24x^2 \plus{} x^3\qquad \textbf{(E)}\ \text{none of these}$

Sam drove $96$ miles in $90$ minutes. His average speed during the first $30$ minutes was $60$ mph (miles per hour), and his average speed during the second $30$ minutes was $65$ mph. What was his average speed, in mph, during the last $30$ minutes? $\textbf{(A) } 64 \qquad \textbf{(B) } 65 \qquad \textbf{(C) } 66 \qquad \textbf{(D) } 67 \qquad \textbf{(E) } 68$

How many sets of two or more consecutive positive integers have a sum of 15? $ \textbf{(A) } 1\qquad \textbf{(B) } 2\qquad \textbf{(C) } 3\qquad \textbf{(D) } 4\qquad \textbf{(E) } 5$

Thin and Fat eat a pizza of $2n$ pieces. Each piece contains a distinct amount of olives between $1$ and $2n$. Thin eats the first piece, and the two players alternately eat a piece neighbor of an eaten piece. However, neither Thin nor Fat like olives, so they will choose pieces that minimizes the total amount of olives they eat. For each arrangement $\sigma$ of the olives, let $s(\sigma)$ the minimal amount of olives that Thin can eat, considering that both play in the best way possible. Let $S(n)$ the maximum of $s(\sigma)$, considering all arrangements. $a)$ Prove that $n^2-1+\lfloor \frac{n}{2} \rfloor \le S(n) \le n^2+\lfloor \frac{n}{2} \rfloor$ $b)$ Prove that $S(n)=n^2-1+\frac{n}{2}$ for each even n.

Let $k,n$ and $r$ be positive integers. (a) Let $Q(x)=x^k+a_1x^{k+1}+\cdots+a_nx^{k+n}$ be a polynomial with real coefficients. Show that the function $\frac{Q(x)}{x^k}$ is strictly positive for all real $x$ satisfying $$0<|x|<\frac1{1+\sum\limits_{i=1}^n |a_i|}$$ (b) Let $P(x)=b_0+b_1x+\cdots+b_rx^r$ be a non zero polynomial with real coefficients. Let $m$ be the smallest number such that $b_m \neq 0$. Prove that the graph of $y=P(x)$ cuts the $x$-axis at the origin (i.e., $P$ changes signs at $x=0$) if and only if $m$ is an odd integer.

Find all integers $m$ and $n$ such that $2m^2 +n^2 = 2mn+3n$

You are given an odd number $n\ge 3$. For every pair of integers $(i, j)$ with $1\le i \le j \le n$ there is a domino, with $i$ written on one its end and with $j$ written on another (there are $\frac{n(n+1)}{2}$ domino overall). Amin took this dominos and started to put them in a row so that numbers on the adjacent sides of the dominos are equal. He has put $k$ dominos in this way, got bored and went away. After this Anton came to see this $k$ dominos, and he realized that he can't put all the remaining dominos in this row by the rules. For which smallest value of $k$ is this possible? [i]Oleksii Masalitin[/i]

On the side $BC$ of the rectangle $ABCD$, a point $P{}$ is marked so that $\angle APD = 90^\circ$. On the straight line $AD$, points $Q{}$ and $R{}$ are selected outside the segment $AD$ such that $AQ = BP$ and $CP = DR$. The circle $\omega$ passes through the points $Q, D$ and the circumcenter of the triangle $PDQ$. The circle $\gamma$ passes through the points $A, R$ and the circumcenter of the triangle $APR$. Prove that the radius of one of the circles touching the line $AD$ and the circles $\omega$ and $\gamma$ is $2AB$.

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]

Given an unit square and some circles inside. Radius of each circle is less than $0.001$, and there is no couple of points belonging to the different circles with the distance between them $0.001$ exactly. Prove that the area, covered by the circles is not greater than $0.34$.

Find all pairs of positive integers $\left( x;\;y\right) $ satisfying the equation $2^{x}=3^{y}+5.$

Given a positive integer $n$, all of its positive integer divisors are written on a board. Two players $A$ and $B$ play the following game: Each turn, each player colors one of these divisors either red or blue. They may choose whichever color they wish, but they may only color numbers that have not been colored before. The game ends once every number has been colored. $A$ wins if the product of all of the red numbers is a perfect square, or if no number has been colored red, $B$ wins otherwise. If $A$ goes first, determine who has a winning strategy for each $n$.

Let $S$ be the set of interior points of a sphere and $C$ be the set of interior points of a circle. Find, with proof, whether there exists a function $f:S\rightarrow C$ such that $d(A,B)\le d(f(A),f(B))$ for any two points $A,B\in S$ where $d(X,Y)$ denotes the distance between the points $X$ and $Y$. [i]Marius Cavachi[/i]

In a game, two players control an adventurer in a dungeon. The adventurer starts with $H{}$ hit points, an integer greater than one. The dungeon consists of several chambers. There are some passageways in the dungeon, each leading from a chamber to a chamber. These passageways are one-way, and a passageway may return to its starting chamber. Every chamber can be exited through at least one passageway. There are 5 types of chambers: [list] [*]Entrance: the adventurer starts here, no passageway comes in here; [*]Hollow: nothing happens; [*]Spike: the adventurer loses a hit point; [*]Trap: the adventurer gets shot by an arrow; [*]Catacomb: the adventurer loses hit points equal to the total number of times they have been hit by an arrow. [/list] The two players control the adventurer alternatively. At a turn, a player can move him through one passageway. A player loses if the adventurer’s hit points fall below zero due to their action (at 0 hit points, the character is alive). Construct a dungeon map, which has at most 20 chambers in total and exactly one entrance, with the following condition: the first player has a winning strategy if $H{}$ is a prime, and the second player has a winning strategy if $H{}$ is composite. [i]Note: If the game doesn’t end after a finite number of moves, neither player wins.[/i]

Let $ a $ be a positive real number. Prove that $$ a^{\sin x}\cdot (a+1)^{\cos x}\ge a,\quad\forall x\in \left[ 0,\frac{\pi }{2} \right] . $$

Let point $I$ be the center of the inscribed circle of an acute-angled triangle $ABC$. Rays $AI$ and $BI$ intersect the circumcircle $k$ of triangle $ABC$ at points $D$ and $E$ respectively. The segments $DE$ and $CA$ intersect at point $F$, the line through point $E$ parallel to the line $FI$ intersects the circle $k$ at point $G$, and the lines $FI$ and $DG$ intersect at point $H$. Prove that the lines $CA$ and $BH$ touch the circumcircle of the triangle $DFH$ at the points $F$ and $H$ respectively.

$n$ points are given on a plane where $n\ge4$. All pairs of points are connected with a segment. Find the maximal number of segments which don't intersect with any other segments in their interior.

A teacher asks each of eleven pupils to write a positive integer with at most four digits, each on a separate yellow sticky note. Show that if all the numbers are different, the teacher can always submit two or more of the eleven stickers so that the average of the numbers on the selected notes are not an integer.

Find all quadruples of real numbers $(a,b,c,d)$ satisfying the system of equations \[\begin{cases}(b+c+d)^{2010}=3a\\ (a+c+d)^{2010}=3b\\ (a+b+d)^{2010}=3c\\ (a+b+c)^{2010}=3d\end{cases}\]

Let $G$ be a group and $n \ge 2$ be an integer. Let $H_1, H_2$ be $2$ subgroups of $G$ that satisfy $$[G: H_1] = [G: H_2] = n \text{ and } [G: (H_1 \cap H_2)] = n(n-1).$$ Prove that $H_1, H_2$ are conjugate in $G.$ Official definitions: $[G:H]$ denotes the index of the subgroup of $H,$ i.e. the number of distinct left cosets $xH$ of $H$ in $G.$ The subgroups $H_1, H_2$ are conjugate if there exists $g \in G$ such that $g^{-1} H_1 g = H_2.$