Find minimal value of $a \in \mathbb{R}$ such that system $$\sqrt{x-1}+\sqrt{y-1}+\sqrt{z-1}=a-1$$ $$\sqrt{x+1}+\sqrt{y+1}+\sqrt{z+1}=a+1$$ has solution in set of real numbers

Six musicians gathered at a chamber music festival . At each scheduled concert some of these musicians played while the others listened as members of the audience . What is the least number of such concerts which would need to be scheduled in order to enable each musician to listen , as a member of the audience, to all the other musicians? (Canadian origin)

Two straight lines intersecting at an angle of $46^o$ are the axes of symmetry of the figure $F$ on the plane. What is the smallest number of axes of symmetry this figure can have?

What is the smallest positive integer $k$ such that $k(3^3 + 4^3 + 5^3) = a^n$ for some positive integers $a$ and $n$, with $n > 1$?

Let $ABC$ a right isosceles triangle with hypotenuse $AB=\sqrt2$ . Determine the positions of the points $X,Y,Z$ on the sides $BC,CA,AB$ respectively so that the triangle $XYZ$ is isosceles, right, and with minimum area.

Each of $K$ friends simultaneously learns one different item of news. They begin to phone one another to tell them their news. Each conversation lasts exactly one hour, during which time it is possible for two friends to tell each other all of their news. What is the minimum number of hours needed in order for all of the friends to know all of the news? Consider in this problem: (a) $K = 64$. (b) $K = 55$. (c) $K = 100$. (A Andjans, Riga) PS. (a) was the junior problem, (a),(b),(c) the senior one

Let the sum of positive numbers $x_1, x_2, ... , x_n$ be $1$. Let $s$ be the greatest of the numbers $$\left\{\frac{x_1}{1+x_1}, \frac{x_2}{1+x_1+x_2}, ..., \frac{x_n}{1+x_1+...+x_n}\right\}$$ What is the minimal possible $s$? What $x_i $correspond it?

Given a circle centered at the origin. Prove that there is a circle of smaller radius that has no less points with integer coordinates.

Determine the largest and smallest fractions $F = \frac{y-x}{x+4y}$ if the real numbers $x$ and $y$ satisfy the equation $x^2y^2 + xy + 1 = 3y^2$.

Find the least possible value of $(x + y)(y + z)$ for positive reals satisfying $(x + y + z) xyz = 1$.

Represent $1957$ as the sum of $12$ positive integer summands $a_1, a_2, ... , a_{12}$ for which the number $a_1! \cdot a_2! \cdot a_3! \cdot ... \cdot a_{12}!$ is minimal.

Given points $A_1 (x_1, y_1, z_1), A_2 (x_2, y_2, z_2), .., A_n (x_n, y_n, z_n)$ let $P (x, y, z)$ be the point which minimizes $\Sigma ( |x - x_i| + |y -y_i| + |z -z_i| )$. Give an example (for each $n > 4$) of points $A_i $ for which the point $P$ lies outside the convex hull of the points $A_i$.

Inside the circle with center $O$, points $A$ and $B$ are marked so that $OA = OB$. Draw a point $M$ on the circle from which the sum of the distances to points $A$ and $B$ is the smallest among all possible.

Let $x, y$ be positive reals such that $x \ne y$. Find the minimum possible value of $(x + y)^2 + \frac{54}{xy(x-y)^2}$ .

Let $n$ be a fixed positive integer and let $b(n)$ be the minimum value of $$k+\frac{n}{k},$$ where $k$ is allowed to range through all positive integers. Prove that $\lfloor b(n) \rfloor= \lfloor \sqrt{4n+1} \rfloor.$

Given an infinite sheet of square ruled paper. Some of the squares contain a piece. A move consists of a piece jumping over a piece on a neighbouring square (which shares a side) onto an empty square and removing the piece jumped over. Initially, there are no pieces except in an $m x n$ rectangle ($m, n > 1$) which has a piece on each square. What is the smallest number of pieces that can be left after a series of moves?

Consider a board consisting of $n\times n$ unit squares where $n \ge 2$. Two cells are called neighbors if they share a horizontal or vertical border. In the beginning, all cells together contain $k$ tokens. Each cell may contain one or several tokens or none. In each turn, choose one of the cells that contains at least one token for each of its neighbors and move one of those to each of its neighbors. The game ends if no such cell exists. (a) Find the minimal $k$ such that the game does not end for any starting configuration and choice of cells during the game. (b) Find the maximal $k$ such that the game ends for any starting configuration and choice of cells during the game. Proposed by Theresia Eisenkölbl

Let $x,y$ be positive numbers, $s$ -- the least of $$\{ x, (y+ 1/x), 1/y\}$$ What is the greatest possible value of $s$? To what $x$ and $y$ does it correspond?

In a circle there are $2019$ plates, on each lies one cake. Petya and Vasya are playing a game. In one move, Petya points at a cake and calls number from $1$ to $16$, and Vasya moves the specified cake to the specified number of check clockwise or counterclockwise (Vasya chooses the direction each time). Petya wants at least some $k$ pastries to accumulate on one of the plates and Vasya wants to stop him. What is the largest $k$ Petya can succeed?

Inside the triangle $ABC$ a point $M$ is given . Find the points $P,Q$ and $R$ lying on the sides $AB,BC$ and $AC$ respectively and such so that the sum $MP+PQ+QR+RM$ is the smallest.

Consider a pyramid whose base is an equilateral triangle $BCD$ and whose other faces are triangles isosceles, right at the common vertex $A$. An ant leaves the vertex $B$ arrives at a point $P$ of the $CD$ edge, from there goes to a point $Q$ of the edge $AC$ and returns to point $B$. If the path you made is minimal, how much is the angle $PQA$ ?

If $x$ and $y$ are positive real numbers such that $(x + \sqrt{x^2 + 1})(y +\sqrt{y^2 + 1}) = 2018$: The minimum possible value of $x + y$ is A. $\frac{2017}{\sqrt{2018}}$ B. $\frac{2018}{\sqrt{2019}}$ C. $\frac{2017}{2\sqrt{2018}}$ D. $\frac{2019}{\sqrt{2018}}$ E. $\sqrt{3}$

What $n$ is the smallest such that “there is a $n$-gon that can be cut into a triangle, a quadrilateral, ..., a $2006$-gon''?

What minimal number of numbers from the set $\{1,2,...,1982\}$ should be deleted to provide the property: [i]none of the remained numbers equals to the product of two other remained numbers[/i]?

In a unit cube, $CG$ is the edge perpendicular to the face $ABCD$. Let $O_1$ be the incircle of square $ABCD$ and $O_2$ be the circumcircle of triangle $BDG$. Determine min$\{XY|X\in O_1,Y\in O_2\}$.