Find the minimum value of $\frac{xy}{z} + \frac{yz}{x} +\frac{ zx}{y}$ for positive reals $x, y, z$ with $x^2 + y^2 + z^2 = 1$.

Let $a$ and $b$ be two positive reals such that the following inequality \[ ax^3 + by^2 \geq xy - 1 \] is satisfied for any positive reals $x, y \geq 1$. Determine the smallest possible value of $a^2 + b$. [i]Proposed by Fajar Yuliawan[/i]

Given is a regular polygon. Volodya wants to mark $k$ points on its perimeter so that any another regular polygon (maybe having a different number of sides) doesn’t contain all marked points on its perimeter. Find the minimal $k$ sufficient for any given polygon.

Two grasshoppers sit at opposite ends of the interval $[0, 1]$. A finite number of points (greater than zero) in the interval are marked. A move is for a grasshopper to select a marked point and jump over it to the equidistant point the other side. This point must lie in the interval for the move to be allowed, but it does not have to be marked. What is the smallest $n$ such that if each grasshopper makes $n$ moves or less, then they end up with no marked points between them?

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?

A switch has two inputs $1, 2$ and two outputs $1, 2$. It either connects $1$ to $1$ and $2$ to $2$, or $1$ to $2$ and $2$ to 1. If you have three inputs $1, 2, 3$ and three outputs $1, 2, 3$, then you can use three switches, the first across $1$ and $2$, then the second across $2$ and $3$, and finally the third across $1$ and $2$. It is easy to check that this allows the output to be any permutation of the inputs and that at least three switches are required to achieve this. What is the minimum number of switches required for $4$ inputs, so that by suitably setting the switches the output can be any permutation of the inputs?

We have to divide a cube onto $k$ non-overlapping tetrahedrons. For what smallest $k$ is it possible?

A square is subdivided into $K^2$ equal smaller squares. We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself). Find the minimum number of links in this broken line. (A Andjans, Riga)

a) Find the minimal value of the polynomial $$P(x,y) = 4 + x^2y^4 + x^4y^2 - 3x^2y^2$$ b) Prove that it cannot be represented as a sum of the squares of some polynomials of $x,y$.

Positive integers $x, y, z$ satisfy $xy + z = 160$. Compute the smallest possible value of $x + yz$.

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

Let $f(x) = \sin \frac{x}{3}+ \cos \frac{3x}{10}$ for all real $x$. Find the least natural number $n$ such that $f(n\pi + x)= f(x)$ for all real $x$.

The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a $2 \times 2$ square. What is the smallest possible number of polygons? [missing figure]

In a mathematical olympiad students received marks for any of the four areas: algebra, geometry, number theory and combinatorics. Any two of the students have distinct marks for all four areas. A group of students is called [i]nice [/i] if all students in the group can be ordered in increasing order simultaneously of at least two of the four areas. Find the least positive integer N, such that among any N students there exist a [i]nice [/i] group of ten students.

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$ ?

What is the smallest possible value of $x^2 + y^2 - x -y - xy$?

A unit square has a circle of radius $r$ with center at it's midpoint. The four quarter circles are centered on the vertices of the square and are tangent to the central circle (see figure). Find the maximum and minimum possible value of the area of the striped figure in the figure and the corresponding values of $r$ such these, the maximum and minimum are achieved. [img]https://2.bp.blogspot.com/-DOT4_B5Mx-8/XnmsTlWYfyI/AAAAAAAALgs/TVYkrhqHYGAeG8eFuqFxGDCTnogVbQFUwCK4BGAYYCw/s400/96%2Bestonia%2Bopen%2Bs1.4.png[/img]

At a quiz show there are three doors. Behind exactly one of the doors, a prize is hidden. You may ask the quizmaster whether the prize is behind the left-hand door. You may also ask whether the prize is behind the right-hand door. You may ask each of these two questions multiple times, in any order that you like. Each time, the quizmaster will answer ‘yes’ or ‘no’. The quizmaster is allowed to lie at most $10$ times. You have to announce in advance how many questions you will be asking (but which questions you will ask may depend on the answers of the quizmaster). What is the smallest number you can announce, such that you can still determine with absolute certainty the door behind which the prize is hidden?

A convex polygon $P$ lies on a flat wooden table. You are allowed to drive some nails into the table. The nails must not go through $P$, but they may touch its boundary. We say that a set of nails blocks $P$ if the nails make it impossible to move $P$ without lifting it off the table. What is the minimum number of nails that suffices to block any convex polygon $P$? (N. Beluhov, S. Gerdgikov)

Let $n$ be a positive integer. For a set of points in the plane $M$, we call $2$ distinct points $A,B \in M$ [i]connected[/i] if the line $AB$ contains exactly $n+1$ points from $M$. Find the minimum value of a positive integer $m$ such that there exists a set $M$ of $m$ points in the plane with the property that any point $A \in M$ is connected with exactly $2n$ other points from $M$.

Determine the minimum value of the expression $2x^4 - 2x^2y^2 + y^4 - 8x^2 + 18$ where $x, y \in R$.

Two men, $A$ and $B$, set out from town $M$ to town $N$, which is $15$ km away. Their walking speed is $6$ km/hr. They also have a bicycle which they can ride at $15$ km/hr. Both $A$ and $B$ start simultaneously, $A$ walking and $B$ riding a bicycle until $B$ meets a pedestrian girl, $C$, going from $N$ to $M$. Then $B$ lends his bicycle to $C$ and proceeds on foot; $C$ rides the bicycle until she meets $A$ and gives $A$ the bicycle which $A$ rides until he reaches $N$. The speed of $C$ is the same as that of $A$ and $B$. The time spent by $A$ and $B$ on their trip is measured from the moment they started from $M$ until the arrival of the last of them at $N$. a) When should the girl $C$ leave $N$ for $A$ and $B$ to arrive simultaneously in $N$? b) When should $C$ leave $N$ to minimize this time?

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

In the triangle $ABC$, $\angle C$ is obtuse and $D$ is a fixed point on the side $BC$, different from $B$ and $C$. For any point $M$ on the side $BC$, different from $D$, the ray $AM$ intersects the circumcircle $S$ of $ABC$ at $N$. The circle through $M, D$ and $N$ meets $S$ again at $P$, different from $N$. Find the location of the point $M$ which minimises $MP$.

What is the least positive integer $k$ such that, in every convex $101$-gon, the sum of any $k$ diagonals is greater than or equal to the sum of the remaining diagonals?