Let $x, y,z$ satisfy the following inequalities $\begin{cases} | x + 2y - 3z| \le 6 \\ | x - 2y + 3z| \le 6 \\ | x - 2y - 3z| \le 6 \\ | x + 2y + 3z| \le 6 \end{cases}$ Determine the greatest value of $M = |x| + |y| + |z|$.

Let $m\ge 5$ be an odd integer, and let $D(m)$ denote the number of quadruples $\big(a_1, a_2, a_3, a_4\big)$ of distinct integers with $1\le a_i \le m$ for all $i$ such that $m$ divides $a_1+a_2+a_3+a_4$. There is a polynomial $$q(x) = c_3x^3+c_2x^2+c_1x+c_0$$such that $D(m) = q(m)$ for all odd integers $m\ge 5$. What is $c_1?$ $(\textbf{A})\: {-}6\qquad(\textbf{B}) \: {-}1\qquad(\textbf{C}) \: 4\qquad(\textbf{D}) \: 6\qquad(\textbf{E}) \: 11$

*. Positive numbers $x_1, x_2, ..., x_{100}$ satisfy the system $$\begin{cases} x^2_1+ x^2_2+ ... + x^2_{100} > 10 000 \\ x_1 + x_2 + ...+ x_{100} < 300 \end{cases}$$ Prove that among these numbers there are three whose sum is greater than $100$.

Let $ a $ and $ b $ be different real numbers. Prove that for any real numbers $ c_1, c_2, \ldots,c_n $ there exists a sequence of $ n $-elements $ (x_i) $, each term of which is equal to one of the numbers $ a $ or $ b $ such that $$ |x_1c_1 + x_2c_2 + \ldots + x_nc_n| \geq \frac{|b-a|}{2}(|c_1|+|c_2|+\ldots+|c_n|).$$

Find all monotonically increasing or monotonically decreasing functions $f: \mathbb{R}_+\to\mathbb{R}_+$ which satisfy the equation $f\left(xy\right)\cdot f\left(\frac{f\left(y\right)}{x}\right)=1$ for any two numbers $x$ and $y$ from $\mathbb{R}_+$. Hereby, $\mathbb{R}_+$ is the set of all positive real numbers. [i]Note.[/i] A function $f: \mathbb{R}_+\to\mathbb{R}_+$ is called [i]monotonically increasing[/i] if for any two positive numbers $x$ and $y$ such that $x\geq y$, we have $f\left(x\right)\geq f\left(y\right)$. A function $f: \mathbb{R}_+\to\mathbb{R}_+$ is called [i]monotonically decreasing[/i] if for any two positive numbers $x$ and $y$ such that $x\geq y$, we have $f\left(x\right)\leq f\left(y\right)$.

Given a quadratic trinomial $f\left(x\right)=x^2+ax+b$. Assume that the equation $f\left(f\left(x\right)\right)=0$ has four different real solutions, and that the sum of two of these solutions is $-1$. Prove that $b\leq -\frac14$.

Call a polynomial $ P(x_{1}, \ldots, x_{k})$ [i]good[/i] if there exist $ 2\times 2$ real matrices $ A_{1}, \ldots, A_{k}$ such that $ P(x_{1}, \ldots, x_{k}) = \det \left(\sum_{i=1}^{k}x_{i}A_{i}\right).$ Find all values of $ k$ for which all homogeneous polynomials with $ k$ variables of degree 2 are good. (A polynomial is homogeneous if each term has the same total degree.)

Let $n\geq2$ be an integer. $n$ is a prime if it is only divisible by $1$ and $n$. Prove that there are infinitely many prime numbers.

The sequence $a_1, a_2, a_3,...$ is defined by $$a_1 = 1\,\,\,, \,\,\,a_{n+1} =\frac{1}{16}(1 + 4a_n +\sqrt{1 + 24a_n}) \,\,\,(n \in N^* ).$$ Determine and prove a formula with which for every natural number $n$ the term $a_n$ can be computed directly without having to determine preceding terms of the sequence.

Show that there exists a positive number t such that for all positive numbers $a,b,c,d$ with $abcd = 1$, $$\frac{1}{1+a}+\frac{1}{1+b}+\frac{1}{1+c}+\frac{1}{1+d}> t.$$ and find the largest $t$ with this property.

Let $n$ be a positive integer. Prove that the polynomial \[P(x)= \frac{x^n}{n!}+\frac{x^{n-1}}{(n-1)!}+...+x+1 \] Does not have any rational root.

We say that a function $f: \mathbb{Z}_{\ge 0} \times \mathbb{Z}_{\ge 0} \to \mathbb{Z}$ is [i]great[/i] if for any nonnegative integers $m$ and $n$, \[f(m + 1, n + 1) f(m, n) - f(m + 1, n) f(m, n + 1) = 1.\] If $A = (a_0, a_1, \dots)$ and $B = (b_0, b_1, \dots)$ are two sequences of integers, we write $A \sim B$ if there exists a great function $f$ satisfying $f(n, 0) = a_n$ and $f(0, n) = b_n$ for every nonnegative integer $n$ (in particular, $a_0 = b_0$). Prove that if $A$, $B$, $C$, and $D$ are four sequences of integers satisfying $A \sim B$, $B \sim C$, and $C \sim D$, then $D \sim A$. [i]Ankan Bhattacharya[/i]

Find all polynomials $f$ that satisfy the equation \[\frac{f(3x)}{f(x)} = \frac{729 (x-3)}{x-243}\] for infinitely many real values of $x$.

[b]p1.[/b] We say that integers $a$ and $b$ are [i]friends [/i] if their product is a perfect square. Prove that if $a$ is a friend of $b$, then $a$ is a friend of $gcd (a, b)$. [b]p2.[/b] On the island of knights and liars, a traveler visited his friend, a knight, and saw him sitting at a round table with five guests. "I wonder how many knights are among you?" he asked. " Ask everyone a question and find out yourself" advised him one of the guests. "Okay. Tell me one: Who are your neighbors?" asked the traveler. This question was answered the same way by all the guests. "This information is not enough!" said the traveler. "But today is my birthday, do not forget it!" said one of the guests. "Yes, today is his birthday!" said his neighbor. Now the traveler was able to find out how many knights were at the table. Indeed, how many of them were there if [i]knights always tell the truth and liars always lie[/i]? [b]p3.[/b] A rope is folded in half, then in half again, then in half yet again. Then all the layers of the rope were cut in the same place. What is the length of the rope if you know that one of the pieces obtained has length of $9$ meters and another has length $4$ meters? [b]p4.[/b] The floor plan of the palace of the Shah is a square of dimensions $6 \times 6$, divided into rooms of dimensions $1 \times 1$. In the middle of each wall between rooms is a door. The Shah orders his architect to eliminate some of the walls so that all rooms have dimensions $2 \times 1$, no new doors are created, and a path between any two rooms has no more than $N$ doors. What is the smallest value of $N$ such that the order could be executed? [b]p5.[/b] There are $10$ consecutive positive integers written on a blackboard. One number is erased. The sum of remaining nine integers is $2011$. Which number was erased? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f(x) = x^n + a_{n-2} x^{n-2} + a_{n-3}x^{n-3} + \dots + a_1x + a_0$ be a polynomial with real coefficients $(n \ge 2)$. Suppose all roots of $f$ are real. Prove that the absolute value of each root is at most $\sqrt{\frac{2(1-n)}n a_{n-2}}$.

Find all real solutions of the system of equations $$x^2-y^2=2(xz+yz+x+y),$$$$y^2-z^2=2(yx+zx+y+z),$$$$z^2-x^2=2(zy+xy+z+x).$$

Let $ k $ be a natural number. A function $ f:S:=\left\{ x_1,x_2,...,x_k\right\}\longrightarrow\mathbb{R} $ is said to be [i]additive[/i] if, whenever $ n_1x_1+n_2x_2+\cdots +n_kx_k=0, $ it holds that $ n_1f\left( x_1\right)+n_2f\left( x_2\right)+\cdots +n_kf\left( x_k\right)=0, $ for all natural numbers $ n_1,n_2,...,n_k. $ Show that for every additive function and for every finite set of real numbers $ T, $ there exists a second function, which is a real additive function defined on $ S\cup T $ and which is equal to the former on the restriction $ S. $

(a) Does there exist an infinite sequence of real numbers such that the sum of every ten successive numbers is positive, while for every $n$ the sum of the first $10n + 1$ successive numbers is negative? (b) Does there exist an infinite sequence of integers with the same properties? (AK Tolpygo)

Find the largest possible value of the expression \( y - x \), if the non-negative real numbers \( x, y \) satisfy the equation: \[ x^4 = y(y - 2025)^3. \] [i]Proposed by Mykhailo Shtandenko, Anton Trygub[/i]

Define a sequence $<x_n>$ by $x_1 = 1, x_2 = x, x_{n+2} = xx_{n+1} + nx_n, n \ge 1$. Consider the polynomial $P_n(x) = x_{n-1}x_{n+1} - x_n^2$, for each $n \ge 2$. Prove or disprove that the coefficients of $P_n(x)$ are all non-negative, except for the constant term when $n$ is odd.

Let $x,y$ and $z$ be positive real numbers such that $xy+yz+xz=3xyz$. Prove that \[ x^2y+y^2z+z^2x \ge 2(x+y+z)-3 \] and determine when equality holds. [i]UK - David Monk[/i]

Find all function(s) $f:\mathbb R\to\mathbb R$ satisfying the equation \[f(x+y)+f(x)f(y)=(1+y)f(x)+(1+x)f(y)+f(xy);\] For all $x,y\in\mathbb R.$

[u]Part 1[/u] You might think this round is broken after solving some of these problems, but everything is intentional. [b]1.1.[/b] The number $n$ can be represented uniquely as the sum of $6$ distinct positive integers. Find $n$. [b]1.2.[/b] Let $ABC$ be a triangle with $AB = BC$. The altitude from $A$ intersects line $BC$ at $D$. Suppose $BD = 5$ and $AC^2 = 1188$. Find $AB$. [b]1.3.[/b] A lemonade stand analyzes its earning and operations. For the previous month it had a \$45 dollar budget to divide between production and advertising. If it spent $k$ dollars on production, it could make $2k - 12$ glasses of lemonade. If it spent $k$ dollars on advertising, it could sell each glass at an average price of $15 + 5k$ cents. The amount it made in sales for the previous month was $\$40.50$. Assuming the stand spent its entire budget on production and advertising, what was the absolute dierence between the amount spent on production and the amount spent on advertising? [b]1.4.[/b] Let $A$ be the number of dierent ways to tile a $1 \times n$ rectangle with tiles of size $1 \times 1$, $1 \times 3$, and $1 \times 6$. Let B be the number of different ways to tile a $1 \times n$ rectangle with tiles of size $1 \times 2$ and $1 \times 5$, where there are 2 different colors available for the $1 \times 2$ tiles. Given that $A = B$, find $n$. (Two tilings that are rotations or reflections of each other are considered distinct.) [b]1.5.[/b] An integer $n \ge 0$ is such that $n$ when represented in base $2$ is written the same way as $2n$ is in base $5$. Find $n$. [b]1.6.[/b] Let $x$ be a positive integer such that $3$, $ \log_6(12x)$, $\log_6(18x)$ form an arithmetic progression in some order. Find $x$. [u]Part 2[/u] Oops, it looks like there were some [i]intentional [/i] printing errors and some of the numbers from these problems got removed. Any $\blacksquare$ that you see was originally some positive integer, but now its value is no longer readable. Still, if things behave like they did for Part 1, maybe you can piece the answers together. [b]2.1.[/b] The number $n$ can be represented uniquely as the sum of $\blacksquare$ distinct positive integers. Find $n$. [b]2.2.[/b] Let $ABC$ be a triangle with $AB = BC$. The altitude from $A$ intersects line $BC$ at $D$. Suppose $BD = \blacksquare$ and $AC^2 = 1536$. Find $AB$. [b]2.3.[/b] A lemonade stand analyzes its earning and operations. For the previous month it had a $\$50$ dollar budget to divide between production and advertising. If it spent k dollars on production, it could make $2k - 2$ glasses of lemonade. If it spent $k$ dollars on advertising, it could sell each glass at an average price of $25 + 5k$ cents. The amount it made in sales for the previous month was $\$\blacksquare$. Assuming the stand spent its entire budget on production and advertising, what was the absolute dierence between the amount spent on production and the amount spent on advertising? [b]2.4.[/b] Let $A$ be the number of different ways to tile a $1 \times n$ rectangle with tiles of size $1 \times \blacksquare$, $1 \times \blacksquare$, and $1 \times \blacksquare$. Let $B$ be the number of different ways to tile a $1\times n$ rectangle with tiles of size $1 \times \blacksquare$ and $1 \times \blacksquare$, where there are $\blacksquare$ different colors available for the $1 \times \blacksquare$ tiles. Given that $A = B$, find $n$. (Two tilings that are rotations or reflections of each other are considered distinct.) [b]2.5.[/b] An integer $n \ge \blacksquare$ is such that $n$ when represented in base $9$ is written the same way as $2n$ is in base $\blacksquare$. Find $n$. [b]2.6.[/b] Let $x$ be a positive integer such that $1$, $\log_{96}(6x)$, $\log_{96}(\blacksquare x)$ form an arithmetic progression in some order. Find $x$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In an infinite sequence $a_1, a_2, a_3, \cdots$, the number $a_1$ equals $1$, and each $a_n, n > 1$, is obtained from $a_{n-1}$ as follows: [list]- if the greatest odd divisor of $n$ has residue $1$ modulo $4$, then $a_n = a_{n-1} + 1,$ - and if this residue equals $3$, then $a_n = a_{n-1} - 1.$[/list] Prove that in this sequence [b](a) [/b] the number $1$ occurs infinitely many times; [b](b)[/b] each positive integer occurs infinitely many times. (The initial terms of this sequence are $1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, \cdots$ )

Omar made a list of all the arithmetic progressions of positive integer numbers such that the difference is equal to $2$ and the sum of its terms is $200$. How many progressions does Omar's list have?