Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.

Solve in natural numbers $a,b,c$ the system \[\left\{ \begin{array}{l}a^3 -b^3 -c^3 = 3abc \\ a^2 = 2(a+b+c)\\ \end{array} \right. \]

Solve \[\left\{ \begin{array}{l} y(x+y)^2 = 9 \\ y(x^3-y^3) = 7 \\ \end{array} \right. \]

Find the real numbers $ x, y, z $ satisfying the system of equations $$(z - x)(x - y) = a $$ $$(x - y)(y - z) = b$$ $$(y - z)(z - x) = c$$ where $ a, b, c $ are given real numbers.

Solve a set of inequalities in the domain of integer numbers: $$3x^2 +2yz \le 1+y^2$$ $$3y^2 +2zx \le 1+z^2$$ $$3z^2 +2xy \le 1+x^2$$

Show that there are positive reals $a$, $b$, $c$ such that \[\left\{ \begin{array}{l} a^2 + b^2 + c^2 > 2 \\ a^3 + b^3 + c^3 <2 \\ a^4 + b^4 + c^4 > 2 \\ \end{array} \right. \]

Real numbers $a$ and $b$ satisfy the system of equations $$\begin{cases} a^3-a^2+a-5=0 \\ b^3-2b^2+2b+4=0 \end{cases}$$ Find the numerical value of the sum $a+ b$.

Let $a, b, c $and $d$ be integers such that for all integers m and n, there exist integers $x$ and $y$ such that $ax + by = m$, and $cx + dy = n$. Prove that $ad - bc = \pm 1$.

Let $p$ be a prime number. The natural numbers $m$ and $n$ are written in the system with the base $p$ as $n = a_0 + a_1p +...+ a_kp^k$ and $m = b_0 + b_1p +..+ b_kp^k$. Prove that $${n \choose m} \equiv \prod_{i=0}^{k}{a_i \choose b_i} (mod p)$$

Determine all sets of real numbers $x,y,z$ which satisfy the system of equations $$\begin{cases} xy = z \\ xz =y \\ yz =x \end{cases}$$

Let $k > 1$ be a positive integer and $n \ge 2019$ be an odd positive integer. The non-zero rational numbers $x_1, x_2,..., x_n$ are not all equal, and satisfy the following chain of equalities: $$x_1 +\frac{k}{x_2}= x_2 +\frac{k}{x_3}= x_3 +\frac{k}{x_4}= ... = x_{n-1} +\frac{k}{x_n}= x_n +\frac{k}{x_1}.$$ What is the smallest possible value of $k$?

Find all sets $x,y,z$ of real numbers that satisfy $$\begin{cases} x^3 - y^2 = z^2 - x \\ y^3 -z^2 =x^2 -y \\z^3 -x^2 = y^2 -z \end{cases}$$

Given $x,y,z\in \mathbb{R} ^+$ , that are the solutions to the system of equations : $$x^2+xy+y^2=57$$ $$y^2+yz+z^2=84$$ $$z^2+zx+x^2=111$$ What is the value of $xy+3yz+5zx$? [i](maphybich)[/i]

Find all real solutions $x, y$ of the system of equations $$\begin{cases} x + \dfrac{3x-y}{x^2 + y^2} = 3 \\ \\ y-\dfrac{x + 3y}{x^2 + y^2} = 0 \end{cases}$$

Determine all real solutions to the system of equations: $$x_1 + x_2 +...+ x_{2004 }= 2004$$ $$x^4_1+ x^4_2+ ... + x^4_{2004} = x^3_1+x^3_2+... + x^3_{2004}$$

If $a$ and $b$ are distinct real numbers, solve the systems (a) $\begin{cases} x+y = 1 \\ (ax+by)^2 \le a^2x+b^2y \end{cases}$ and (b) $\begin{cases} x+y = 1 \\ (ax+by)^4 \le a^4x+b^4y \end{cases}$

Find all triplets $(x, y, z)$ of real numbers for which $$\begin{cases}x^2- yz = |y-z| +1 \\ y^2 - zx = |z-x| +1 \\ z^2 -xy = |x-y| + 1 \end{cases}$$

Solve in $R$ the system: $$\begin{cases} \dfrac{xyz}{x + y + 1}= 1998000\\ \\ \dfrac{xyz}{y + z - 1}= 1998000 \\ \\ \dfrac{xyz}{z+x}= 1998000 \end{cases}$$

$C$ is the circle center $(0,1)$, radius $1$. $P$ is the parabola $y = ax^2$. They meet at $(0, 0)$. For what values of $a$ do they meet at another point or points?

Let $n$ be an integer $> 1$. In a circular arrangement of $n$ lamps $L_0, \cdots, L_{n-1}$, each one of which can be either ON or OFF, we start with the situation that all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \cdots$. If $L_{j-1}$ ($j$ is taken mod n) is ON, then $Step_j$ changes the status of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the status of any of the other lamps. If $L_{j-1}$ is OFF, then $Step_j$ does not change anything at all. Show that: [i](a)[/i] There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again. [i](b)[/i] If $n$ has the form $2^k$, then all lamps are ON after $n^2 - 1$ steps. [i](c) [/i]If $n$ has the form $2^k +1$, then all lamps are ON after $n^2 -n+1$ steps.

Determine, for any positive real number $a$, the number of solutions $(x,y)$ to the system of equations $$\begin{cases} |x|+|y|= 1 \\ x^2 + y^2 = a \end{cases}$$ where $x$ and $y$ are real numbers.

The reals $a, b$ satisfy $$\begin{cases} a^3 - 3a^2 + 5a - 17 = 0 \\ b^3 - 3b^2 + 5b + 11 = 0 .\end{cases}$$ Find $a+b$.

For which real $a$ are there distinct reals $x$, $y$ such that $$\begin{cases} x = a - y^2 \\ y = a - x^2 \,\,\, ? \end {cases}$$

Find all triples $(x,y,z)$ of positive integers such that $$\begin{cases} x + y +z = 2010 \\x^2 + y^2 + z^2 - xy - yz - zx =3 \end{cases}$$

For what real numbers $p$ has the system of equations $$\begin{cases} x_1^4+\dfrac{1}{x_1^2}=px_2 \\ \\ x_2^4+\dfrac{1}{x_2^2}=px_3 \\ ... \\ x_{2004}^4+\dfrac{1}{x_{2004}^2}=px_{2005} \\ \\ x_{2005}^4+\dfrac{1}{x_{2005}^2}=px_{1}\end{cases}$$ just one solution $(x_1,x_2,...,x_{2005})$, where $x_1,x_2,...,x_{2005}$ are real numbers?