Suppose $x,y$ and $z$ are integers that satisfy the system of equations \[x^2y+y^2z+z^2x=2186\] \[xy^2+yz^2+zx^2=2188.\] Evaluate $x^2+y^2+z^2.$

Let $n$ be a positive integer number. If $S$ is a finite set of vectors in the plane, let $N(S)$ denote the number of two-element subsets $\{\mathbf{v}, \mathbf{v'}\}$ of $S$ such that \[4\,(\mathbf{v} \cdot \mathbf{v'}) + (|\mathbf{v}|^2 - 1)(|\mathbf{v'}|^2 - 1) < 0. \] Determine the maximum of $N(S)$ when $S$ runs through all $n$-element sets of vectors in the plane. [i]***[/i]

Given a monic quadratic polynomial $Q(x)$, define \[ Q_n (x) = \underbrace{Q(Q(\cdots(Q(x))\cdots))}_{\text{compose $n$ times}} \] for every natural number $n$. Let $a_n$ be the minimum value of the polynomial $Q_n(x)$ for every natural number $n$. It is known that $a_n > 0$ for every natural number $n$ and there exists some natural number $k$ such that $a_k \neq a_{k+1}$. (a) Prove that $a_n < a_{n+1}$ for every natural number $n$. (b) Is it possible to satisfy $a_n < 2021$ for every natural number $n$? [i]Proposed by Fajar Yuliawan[/i]

Suppose $P(x)=x^2+Ax+B$ for real $A$ and $B$. If the sum of the roots of $P(2x)$ is $\tfrac 12$ and the product of the roots of $P(3x)$ is $\tfrac 13$, find $A+B$. [i]Proposed by Connor Gordon[/i]

The positive real numbers $x,y,z$ satisfy $xy+yz+zx=1$. Prove that: $$ 2(x^2+y^2+z^2)+\frac{4}{3}\bigg (\frac{1}{x^2+1}+\frac{1}{y^2+1}+\frac{1}{z^2+1}\bigg) \ge 5 $$

Find the set of solutions to the equation $\log_{\lfloor x\rfloor}(x^2-1)=2$

Find the number of $7$-tuples of positive integers $(a,b,c,d,e,f,g)$ that satisfy the following systems of equations: \begin{align*} abc&=70,\\ cde&=71,\\ efg&=72. \end{align*}

Find all positive integers $n$ such that there exists a monic polynomial $P(x)$ of degree $n$ with integers coefficients satisfying $$P(a)P(b)\neq P(c)$$ for all integers $a,b,c$.

The function $f(x, y)$ is defined for all real numbers $x, y$. It satisfies $f(x,0) = ax$ (where $a$ is a non-zero constant) and if $(c, d)$ and $(h, k)$ are distinct points such that $f(c, d) = f(h, k)$, then $f(x, y)$ is constant on the line through $(c, d)$ and $(h, k)$. Show that for any real $b$, the set of points such that $f(x, y) = b$ is a straight line and that all such lines are parallel. Show that $f(x, y) = ax + by$, for some constant $b$.

Let $n$ be a positive integer. Denote $M = \{(x, y)|x, y \text{ are integers }, 1 \leq x, y \leq n\}$. Define function $f$ on $M$ with the following properties: [b]a.)[/b] $f(x, y)$ takes non-negative integer value; [b] b.)[/b] $\sum^n_{y=1} f(x, y) = n - 1$ for $1 \eq x \leq n$; [b]c.)[/b] If $f(x_1, y_1)f(x2, y2) > 0$, then $(x_1 - x_2)(y_1 - y_2) \geq 0.$ Find $N(n)$, the number of functions $f$ that satisfy all the conditions. Give the explicit value of $N(4)$.

Given a positive integer $n$, suppose that $P(x,y)$ is a real polynomial such that \[P(x,y)=\frac{1}{1+x+y} \hspace{0.5cm} \text{for all $x,y\in\{0,1,2,\dots,n\}$} \] What is the minimum degree of $P$? [i]Proposed by Loke Zhi Kin[/i]

Marisela is putting on a juggling show! She starts with $1$ ball, tossing it once per second. Lawrence tosses her another ball every five seconds, and she always tosses each ball that she has once per second. Compute the total number of tosses Marisela has made one minute after she starts juggling.

Find all functions $f:\mathbb{Q}\rightarrow\mathbb{R} \setminus \{ 0 \}$ such that \[(f(x))^2f(2y)+(f(y))^2f(2x)=2f(x)f(y)f(x+y)\] for all $x,y\in\mathbb{Q}$

Given a rebus: $$AB + BC + CA = XY + YZ + ZX = KL + LM + MK $$ where different letters correspond to different numbers, and same letters correspond to the same numbers. Determine the value of $ AXK + BYL + CZM $. [i]Proposed by Giorgi Arabidze[/i]

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. (a) Let $p$ be a prime. Consider the graph whose vertices are the ordered pairs $(x, y)$ with $x, y \in\{0, 1, . . . , p-1\}$ and whose edges join vertices $(x, y)$ and $(x' , y')$ if and only if $xx'+yy'\equiv 1 \pmod{p}$ . Prove that this graph does not contain $C_{4}$ . (b) Prove that for infinitely many values $n$ there is a graph $G_{n}$ with $e(G_{n}) \geq \frac{n\sqrt{n}}{2}-n$ that does not contain $C_{4}$.

Determine the least real number $M$ such that the inequality \[|ab(a^{2}-b^{2})+bc(b^{2}-c^{2})+ca(c^{2}-a^{2})| \leq M(a^{2}+b^{2}+c^{2})^{2}\] holds for all real numbers $a$, $b$ and $c$.

Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.

Let $f$ be a function with the following properties: 1) $f(n)$ is defined for every positive integer $n$; 2) $f(n)$ is an integer; 3) $f(2)=2$; 4) $f(mn)=f(m)f(n)$ for all $m$ and $n$; 5) $f(m)>f(n)$ whenever $m>n$. Prove that $f(n)=n$.

Prove that every polynomial of fourth degree can be represented in the form $P(Q(x))+R(S(x))$, where $P,Q,R,S$ are quadratic trinomials. [i]A. Golovanov[/i] [b]EDIT.[/b] It is confirmed that assuming the coefficients to be [b]real[/b], while solving the problem, earned a maximum score.

Find all real numbers $x,y,z$ such that satisfied the following equalities at same time: $\sqrt{x^3-y}=z-1 \wedge \sqrt{y^3-z}=x-1\wedge \sqrt{z^3-x}=y-1$

For all $a$ and $b$, let $a\clubsuit b = 3a + 2b + 1$. Compute $c$ such that $(2c)\clubsuit (5\clubsuit (c + 3)) = 60$.

Find all positive integers $ k$ with the following property: There exists an integer $ a$ so that $ (a\plus{}k)^{3}\minus{}a^{3}$ is a multiple of $ 2007$.

Show that \[ a^n + b^n + c^n \geq ab^{n-1} + bc^{n-1} + ca^{n-1} \] for real $a,b,c \geq 0$ and $n$ a positive integer.

Solve the equation $\sqrt {x + 3 - 4 \sqrt{x -1}} +\sqrt{x + 8 - 6 \sqrt{x - 1}}= 1$.

Suppose $P$ is a polynomial with integer coefficients such that for every positive integer $n$, the sum of the decimal digits of $|P(n)|$ is not a Fibonacci number. Must $P$ be constant? (A [i]Fibonacci number[/i] is an element of the sequence $F_0, F_1, \dots$ defined recursively by $F_0=0, F_1=1,$ and $F_{k+2} = F_{k+1}+F_k$ for $k\ge 0$.) [i]Nikolai Beluhov[/i]