For real numbers $x$, $y$ and $z$, solve the system of equations: $$x^3+y^3=3y+3z+4$$ $$y^3+z^3=3z+3x+4$$ $$x^3+z^3=3x+3y+4$$

For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$

Find all pairs $(a,b)$ of real numbers, so that $\sin(2009x)+\sin(ax)+\sin(bx)=0$ holds for any $x\in \mathbf {R}$.

A pair $(f,g)$ of degree $2$ real polynomials is called [i]foolish[/i] if $f(g(x)) = f(x) \cdot g(x)$ for all real $x.$ How many positive integers less than $2023$ can be a root of $g(x)$ for some foolish pair $(f,g)$?

The sequence $ (a_n)_{n\ge 1}$ is defined by $ a_1 \equal{} 3$, $ a_2 \equal{} 11$ and $ a_n \equal{} 4a_{n\minus{}1}\minus{}a_{n\minus{}2}$, for $ n \ge 3$. Prove that each term of this sequence is of the form $ a^2 \plus{} 2b^2$ for some natural numbers $ a$ and $ b$.

For a positive real number $p$, find all real solutions to the equation \[\sqrt{x^2 + 2px - p^2} -\sqrt{x^2 - 2px - p^2} =1.\]

Given are quadratic trinomials $f$ and $g$ with integral coefficients. For each positive integer $n$ there is an integer $k$ such that \[\frac{f(k)}{g(k)}=\frac{n + 1}{n}. \] Prove that $f$ and $g$ have a common root. [i] Proposed by A. Golovanov [/i]

Petya bought one cake, two cupcakes and three bagels, Apya bought three cakes and a bagel, and Kolya bought six cupcakes. They all paid the same amount of money for purchases. Lena bought two cakes and two bagels. And how many cupcakes could be bought for the same amount spent to her?

[b]p1.[/b] Show that for every $n \ge 6$, a square in the plane may be divided into $n$ smaller squares, not necessarily all of the same size. [b]p2.[/b] Let $n$ be the $4018$-digit number $111... 11222...2225$, where there are $2008$ ones and $2009$ twos. Prove that $n$ is a perfect square. (Giving the square root of $n$ is not sufficient. You must also prove that its square is $n$.) [b]p3.[/b] Let $n$ be a positive integer. A game is played as follows. The game begins with $n$ stones on the table. The two players, denoted Player I and Player II (Player I goes first), alternate in removing from the table a nonzero square number of stones. (For example, if $n = 26$ then in the first turn Player I can remove $1$ or $4$ or $9$ or $16$ or $25$ stones.) The player who takes the last stone wins. Determine if the following sentence is TRUE or FALSE and prove your answer: There are infinitely many starting values n such that Player II has a winning strategy. (Saying that Player II has a winning strategy means that no matter how Player I plays, Player II can respond with moves that lead to a win for Player II.) [b]p4.[/b] Consider a convex quadrilateral $ABCD$. Divide side $AB$ into $8$ equal segments $AP_1$, $P_1P_2$, $...$ , $P_7B$. Divide side $DC$ into $8$ equal segments $DQ_1$, $Q_1Q_2$, $...$ , $Q_7C$. Similarly, divide each of sides $AD$ and $BC$ into $8$ equal segments. Draw lines to form an $8 \times 8$ “checkerboard” as shown in the picture. Color the squares alternately black and white. (a) Show that each of the $7$ interior lines $P_iQ_i$ is divided into $8$ equal segments. (b) Show that the total area of the black regions equals the total area of the white regions. [img]https://cdn.artofproblemsolving.com/attachments/1/4/027f02e26613555181ed93d1085b0e2de43fb6.png[/img] [b]p5.[/b] Prove that exactly one of the following two statements is true: A. There is a power of $10$ that has exactly $2008$ digits in base $2$. B. There is a power of $10$ that has exactly $2008$ digits in base $5$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $s_1, s_2, s_3$ be the three roots of $x^3 + x^2 +\frac92x + 9$. $$\prod_{i=1}^{3}(4s^4_i + 81)$$ can be written as $2^a3^b5^c$. Find $a + b + c$.

Let $x_1,x_2,\dots,x_{31}$ be real numbers. Then find the maximum value can $$\sum_{i,j=1,2,\dots,31, \; i\neq j}{\lceil x_ix_j \rceil }-30\left(\sum_{i=1,2,\dots,31}{\lfloor x_i^2 \rfloor } \right)$$ achieve. P.S.: For a real number $x$ we denote the smallest integer that does not subseed $x$ by $\lceil x \rceil$ and the biggest integer that does not exceed $x$ by $\lfloor x \rfloor$. For example $\lceil 2.7 \rceil=3$, $\lfloor 2.7 \rfloor=2$ and $\lfloor 4 \rfloor=\lceil 4 \rceil=4$

A shepherd left, as an inheritance, to his children a flock of $k$ sheep, distributed as follows: the oldest received $\left\lfloor\frac{k}{2}\right\rfloor$ sheep, the middle one $\left\lfloor\frac{k}{3}\right\rfloor$ sheep and the youngest $\left\lfloor\frac{k}{5}\right\rfloor$ sheep. Knowing that there are no sheep left, determine all possible values for $k$.

Let $f(x)$ be a non-constant polynomial with non-negative integer coefficients. Prove that there are infinitely many positive integers $n$, for which $f(n)$ is not divisible by any of $f(2)$, $f(3)$, ..., $f(n-1)$.

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

Laura is putting together the following list: $a_0, a_1, a_2, a_3, a_4, ..., a_n$, where $a_0 = 3$ and $a_1 = 4$. She knows that the following equality holds for any value of $n$ integer greater than or equal to $1$: $$a_n^2-2a_{n-1}a_{n+1} =(-2)^n.$$Laura calculates the value of $a_4$. What value does it get?

The negative real numbers $x, y, z, t$ satisfy simultaneously equalities, $$x + y + z = t, \,\,\,\,\frac{1}{x}+ \frac{1}{y}+\frac{1}{z}= \frac{1}{t}, \\,\,\,\, x^3 + y^3 + z^3 = 1000^3$$ Compute $x + y + z + t$.

$p(x)$ is a real polynomial that for each $x\geq 0$, $p(x)\geq 0$. Prove that there are real polynomials $A(x),B(x)$ that $p(x)=A(x)^{2}+xB(x)^{2}$

All positive differences $a_i -a_j$ of five different positive integers $a_1$, $a_2$, $a_3$, $a_4$ and $a_5$ are all different. Let $A$ be the set formed by the largest elements of each group of $5$ elements that meet said condition. Determine the minimum element of $A$.

Find all positive integers $n$ such that $n+ \left[ \frac{n}{6} \right] \ne \left[ \frac{n}{2} \right] + \left[ \frac{2n}{3} \right]$

For all real numbers $x,y$ define $x\star y = \frac{ x+y}{ 1+xy}$. Evaluate the expression \[ ( \cdots (((2 \star 3) \star 4) \star 5) \star \cdots ) \star 1995. \] [i]Macedonia[/i]

Solve: \[ \begin{cases}x_{2}x_{3}x_{4}\cdots x_{n}=a_{1}x_{1}\\ x_{1}x_{3}x_{4}\cdots x_{n}=a_{2}x_{2}\\x_{1}x_{2}x_{4}\cdots x_{n}=a_{3}x_{3}\\ \ldots\\x_{1}x_{2}x_{3}\cdots x_{n-1}=a_{n-1}x_{n-1} \end{cases} \]

Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $ (x, y)$ such that [i](i)[/i] $ x$ and $ y$ are relatively prime; [i](ii)[/i] $ y$ divides $ x^2 \plus{} m$; [i](iii)[/i] $ x$ divides $ y^2 \plus{} m.$ [i](iv)[/i] $ x \plus{} y \leq m \plus{} 1\minus{}$ (optional condition)

Let $a$ be a real number. Let $(f_n(x))_{n\ge 0}$ be a sequence of polynomials such that $f_0(x)=1$ and $f_{n+1}(x)=xf_n(x)+f_n(ax)$ for all non-negative integers $n$. a) Prove that $f_n(x)=x^nf_n\left(x^{-1}\right)$ for all non-negative integers $n$. b) Find an explicit expression for $f_n(x)$.

Show that for all real numbers $x,y,z$ such that $x + y + z = 0$ and $xy + yz + zx = -3$, the expression $x^3y + y^3z + z^3x$ is a constant.

For each pair of positive integers $(x, y)$ a nonnegative integer $x\Delta y$ is defined. It is known that for all positive integers $a$ and $b$ the following equalities hold: i. $(a + b)\Delta b = a\Delta b + 1$. ii. $(a\Delta b) \cdot (b\Delta a) = 0$. Find the values of the expressions $2016\Delta 121$ and $2016\Delta 144$.