Consider positive real numbers $x,y,z$. Prove the inequality $$\frac 1x+\frac 1y+\frac 1z+\frac{9}{x+y+z}\ge 3\left (\left (\frac{1}{2x+y}+\frac{1}{x+2y}\right )+\left (\frac{1}{2y+z}+\frac{1}{y+2z}\right )+\left (\frac{1}{2z+x}+\frac{1}{x+2z}\right )\right ).$$ [i] (Vlad Robu \& Sergiu Novac)[/i]

Let $x_1,..., x_n$ be non-negative real numbers, not all of which are zeros. (i) Prove that $$1 \le \frac{\left(x_1+\frac{x_2}{2}+\frac{x_3}{3}+...+\frac{x_n}{n}\right)(x_1+2x_2+3x_3+...+nx_n)}{(x_1+x_2+x_3+...+x_n)^2} \le \frac{(n+1)^2}{4n}$$ (ii) Show that, for each $n > 1$, both inequalities can hold as equalities.

The equation $ax^5 + bx^4 + c = 0$ has three distinct roots. Show that so does the equation $cx^5 +bx+a = 0$.

The teacher wrote on the board the quadratic polyomial $x^2+10x+20$. Then in turn, each of the students came to the board and increased or decreased by $1$ either the coefficient at $x$ or the constant term, but not both at once. As a result, the quadratic polyomial $x^2 + 20x +10$ appeared on the board. Is it true that at some point a quadratic polyomial with integer roots appeared on the board?

Let $(m,n)$ be the pairs of integers satisfying $2(8n^3+m^3)+6(m^2-6n^2)+3(2m+9n)=437$. Find the sum of all possible values of $mn$.

There are $n=1681$ children, $a_1,a_2,...,a_{n}$ seated clockwise in a circle on the floor. The teacher walks behind the children in the clockwise direction with a box of $1000$ candies. She drops a candy behind the first child $a_1$. She then skips one child and drops a candy behind the third child, $a_3$. Now she skips two children and drops a candy behind the next child, $a_6$. She continues this way, at each stage skipping one child more than at the preceding stage before dropping a candy behind the next child. How many children will never receive a candy? Justify your answer.

There are 300 apples, any two of which differ in weight by no more than three times. Prove that they can be arranged into bags of four apples each so that any two bags differ in weight by no more than than one and a half times.

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

For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and \[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\ 2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases} \] Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.

Prove that the inequality \[\left(a^{2}+2\right)\left(b^{2}+2\right)\left(c^{2}+2\right) \geq 9\left(ab+bc+ca\right)\] holds for all positive reals $a$, $b$, $c$.

Find the solution of the functional equation $P(x)+P(1-x)=1$ with power $2015$ P.S: $P(y)=y^{2015}$ is also a function with power $2015$

Find all polynomials $ p\in\mathbb Z[x]$ such that $ (m,n)\equal{}1\Rightarrow (p(m),p(n))\equal{}1$

Solve the equation: \[2^{\lg x}+8=(x-8)^{\frac{1}{\lg 2}}\] Note: $\lg x=\log_{10}x$. [i]Daniel Jinga [/i]

[b]p1.[/b] Fun facts! We know that $1008^2-1007^2 = 1008+1007$ and $1009^2-1008^2 = 1009+1008$. Now compute the following: $$1010^2 - 1009^2 - 1.$$ [b]p2.[/b] Let $m$ be the smallest positive multiple of $2018$ such that the fraction $m/2019$ can be simplified. What is the number $m$? [b]p3.[/b] Given that $n$ satisfies the following equation $$n + 3n + 5n + 7n + 9n = 200,$$ find $n$. [b]p4.[/b] Grace and Somya each have a collection of coins worth a dollar. Both Grace and Somya have quarters, dimes, nickels and pennies. Serena then observes that Grace has the least number of coins possible to make one dollar and Somya has the most number of coins possible. If Grace has $G$ coins and Somya has $S$ coins, what is $G + S$? [b]p5.[/b] What is the ones digit of $2018^{2018}$? [b]p6.[/b] Kaitlyn plays a number game. Each time when Kaitlyn has a number, if it is even, she divides it by $2$, and if it is odd, she multiplies it by $5$ and adds $1$. Kaitlyn then takes the resulting number and continues the process until she reaches $1$. For example, if she begins with $3$, she finds the sequence of $6$ numbers to be $$3, 3 \cdot 5 + 1 = 16, 16/2 = 8, 8/2 = 4, 4/2 = 2, 2/2 = 1.$$ If Kaitlyn's starting number is $51$, how many numbers are in her sequence, including the starting number and the number $1$? [b]p7.[/b] Andrew likes both geometry and piano. His piano has $88$ keys, $x$ of which are white and $y$ of which are black. Each white key has area $3$ and each black key has area $11$. If the keys of his piano have combined area $880$, how many black keys does he have? [b]p8.[/b] A six-sided die contains the numbers $1$, $2$, $3$, $4$, $5$, and $6$ on its faces. If numbers on opposite faces of a die always sum to $7$, how many distinct dice are possible? (Two dice are considered the same if one can be rotated to obtain the other.) [b]p9.[/b] In $\vartriangle ABC$, $AB$ is $12$ and $AC$ is $15$. Alex draws the angle bisector of $BAC$, $AD$, such that $D$ is on $BC$. If $CD$ is $10$, then the area of $\vartriangle ABC$ can be expressed in the form $\frac{m \sqrt{n}}{p}$ where $m, p$ are relatively prime and $n$ is not divisible by the square of any prime. Find $m + n + p$. [b]p10.[/b] Find the smallest positive integer that leaves a remainder of $2$ when divided by $5$, a remainder of $3$ when divided by $6$, a remainder of $4$ when divided by $7$, and a remainder of $5$ when divided by $8$. [b]p11.[/b] Chris has a bag with $4$ marbles. Each minute, Chris randomly selects a marble out of the bag and flips a coin. If the coin comes up heads, Chris puts the marble back in the bag, while if the coin comes up tails, Chris sets the marble aside. What is the expected number of seconds it will take Chris to empty the bag? [b]p12.[/b] A real fixed point $x$ of a function $f(x)$ is a real number such that $f(x) = x$. Find the absolute value of the product of the real fixed points of the function $f(x) = x^4 + x - 16$. [b]p13.[/b] A triangle with angles $30^o$, $75^o$, $75^o$ is inscribed in a circle with radius $1$. The area of the triangle can be expressed as $\frac{a+\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p14.[/b] Dora and Charlotte are playing a game involving flipping coins. On a player's turn, she first chooses a probability of the coin landing heads between $\frac14$ and $\frac34$ , and the coin magically flips heads with that probability. The player then flips this coin until the coin lands heads, at which point her turn ends. The game ends the first time someone flips heads on an odd-numbered flip. The last player to flip the coin wins. If both players are playing optimally and Dora goes first, let the probability that Charlotte win the game be $\frac{a}{b}$ . Find $a \cdot b$. [b]p15.[/b] Jonny is trying to sort a list of numbers in ascending order by swapping pairs of numbers. For example, if he has the list $1$, $4$, $3$, $2$, Jonny would swap $2$ and $4$ to obtain $1$, $2$, $3$, $4$. If Jonny is given a random list of $400$ distinct numbers, let $x$ be the expected minimum number of swaps he needs. Compute $\left \lfloor \frac{x}{20} \right \rfloor$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A magician asked a spectator to think of a three-digit number $ \overline{abc}$ and then to tell him the sum of numbers $ \overline{acb}$, $ \overline{bac}$, $ \overline{bca}$, $ \overline{cab}$, and $ \overline{cba}$. He claims that when he knows this sum he can determine the original number. Is that so?

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. \]

Does existes a function $f:N->N$ and for all positeve integer n $f(f(n)+2011)=f(n)+f(f(n))$

Show that the equation $z^{n}+z+1=0$ has a solution with $|z|=1$ if and only if $n-2$ is divisble by $3$.

A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[ a + b, \; a - b, \; b - a, \; a \times b, \; a/b \text{ (if $b \neq 0$)}, \; b/a \text{ (if $a \neq 0$)}. \] Prove that, for every integer $n > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.

Suppose that $a$ and $b$ are two distinct positive real numbers such that $\lfloor na\rfloor$ divides $\lfloor nb\rfloor$ for any positive integer $n$. Prove that $a$ and $b$ are positive integers.

Of the students attending a school athletic event, $80\%$ of the boys were dressed in the school colors, $60\%$ of the girls were dressed in the school colors, and $45\% $ of the students were girls. Find the percentage of students attending the event who were wearing the school colors.

Let $ a$ be a positive real number and $ n$ a non-negative integer. Determine $ S\minus{}T$, where $ S\equal{} \sum_{k\equal{}\minus{}2n}^{2n\plus{}1} \frac{(k\minus{}1)^2}{a^{| \lfloor \frac{k}{2} \rfloor |}}$ and $ T\equal{} \sum_{k\equal{}\minus{}2n}^{2n\plus{}1} \frac{k^2}{a^{| \lfloor \frac{k}{2} \rfloor |}}$

[b]p1.[/b] Solve the equation $3^x + 9^x = 27^x$. [b]p2.[/b] An equilateral triangle in inscribed in a circle of area $1$ m$^2$. Then the second circle is inscribed in the triangle. Find the radius of the second circle. [b]p3.[/b] Solve the inequality: $2\sqrt{x^2 - 5x + 4} + 3\sqrt{x^2 + 2x - 3} \le 5\sqrt{6 - x - x^2}$ [b]p4.[/b] Peter and John played a game. Peter wrote on a blackboard all integers from $1$ to $18$ and offered John to choose $8$ different integers from this list. To win the game John had to choose 8 integers such that among them the difference between any two is either less than $7$ or greater than $11$. Can John win the game? Justify your answer. [b]p5.[/b] Prove that given $100$ different positive integers such that none of them is a multiple of $100$, it is always possible to choose several of them such that the last two digits of their sum are zeros. [b]p6.[/b] Given $100$ different squares such that the sum of their areas equals $1/2$ m$^2$ , is it possible to place them on a square board with area $1$ m$^2$ without overlays? Justify your answer. PS. You should use hide for answers.

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that any real numbers $x{}$ and $y{}$ satisfy \[f(xf(x)+f(y))=f(f(x^2))+y.\]

Let $ A,B\in\mathcal{M} \left( \mathbb{R} \right) $ that satisfy $ AB=O_3. $ Prove that: [b]a)[/b] The function $ f:\mathbb{C}\longrightarrow\mathbb{C} $ defined as $ f(x)=\det \left( A^2+B^2+xBA \right) $ is a polynomial one, of degree at most $ 2. $ [b]b)[/b] $ \det\left( A^2+B^2 \right)\ge 0. $