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

Let $OP$ be a diagonal of a unit cube. Find the minimum and the maximum value of the area of the intersection of the cube with a plane through $OP$.

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

For a positive integer $K$, define a sequence, $\{a_n\}$, as following: $a_1 = K$ and $a_{n+1} =a_n -1$ if $a_n$ is even $a_{n+1} =\frac{a_n - 1}{2}$ if $a_n$ is odd , for all $n \ge 1$. Find the smallest value of $K$, which makes $a_{2005}$ the first term equal to $0$.

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

All the fields of a square $n\times n$ (n>2) table are filled with $+1$ or $-1$ according to the rules: [i]At the beginning $-1$ are put in all the boundary fields. The number put in the field in turn (the field is chosen arbitrarily) equals to the product of the closest, from the different sides, numbers in its row or in its column. [/i] a) What is the minimal b) What is the maximal possible number of $+1$ in the obtained table?

Alex is going to make a set of cubical blocks of the same size and to write a digit on each of their faces so that it would be possible to form every $30$-digit integer with these blocks. What is the minimal number of blocks in a set with this property? (The digits $6$ and $9$ do not turn one into another.)

Let $n$ be a natural number. Determine the minimal number of equilateral triangles of side $1$ to cover the surface of an equilateral triangle of side $n +\frac{1}{2n}$.

Given a $\triangle ABC$, determine which is the circle with the smallest area that contains it.

Find the smallest real constant $p$ for which the inequality holds $\sqrt{ab}- \frac{2ab}{a + b} \le p \left( \frac{a + b}{2} -\sqrt{ab}\right)$ with any positive real numbers $a, b$.

Given a triangle $ABC$ with the are $1$. Let $A',B'$ and $C' $ are the midpoints of the sides $[BC], [CA]$ and $[AB]$ respectively. What is the minimal possible area of the common part of two triangles $A'B'C'$ and $KLM$, if the points $K,L$ and $M$ are lying on the segments $[AB'], [CA']$ and $[BC']$ respectively?

Given two circles with the radiuses $R$ and $r$, touching each other from the outer side. Consider all the trapezoids, such that its lateral sides touch both circles, and its bases touch different circles. Find the shortest possible lateral side.

A triangle $ABC$ and two lines $\ell_1, \ell_2$ are given. Through an arbitrary point $D$ on the side $AB$, a line parallel to $\ell_1$ intersects the $AC$ at point $E$ and a line parallel to $\ell_2$ intersects the $BC$ at point $F$. Construct a point $D$ for which the segment $EF$ has the smallest length.

Determine for which $m$ there exist exactly $2^{15}$ subsets $X$ of $\{1,2,...,47\}$ with the following property: $m$ is the smallest element of $X$, and for every $x \in X$, either $x+m \in X$ or $x+m > 47$.

Find the smallest positive integer $n$ such that the number $2^n + 2^8 + 2^{11}$ is a perfect square. (A): $8$, (B): $9$, (C): $11$, (D): $12$, (E) None of the above.

Let be a natural number $ n\ge 3. $ Find $$ \inf_{\stackrel{ x_1,x_2,\ldots ,x_n\in\mathbb{R}_{>0}}{1=P\left( x_1,x_2,\ldots ,x_n\right)}}\sum_{i=1}^n\left( \frac{1}{x_i} -x_i \right) , $$ where $ P\left( x_1,x_2,\ldots ,x_n\right) :=\sum_{i=1}^n \frac{1}{x_i+n-1} , $ and find in which circumstances this infimum is attained.

Find the smallest value of the expression $|3 \cdot 5^m - 11 \cdot 13^n|$ for all $m,n \in N$. (Folklore)

The plan of a picture gallery is a chequered figure where each square is a room, and every room can be reached from each other by moving to rooms adjacent by side. A custodian in a room can watch all the rooms that can be reached from this room by one move of a chess rook (without leaving the gallery). What minimum number of custodians is sufficient to watch all the rooms in every gallery of $n$ rooms ($n > 1$)?

Given that $a_1, a_2, . . . , a_n$ are nonnegative real numbers with $a_1 + \cdots + a_n = 1$, prove that the expression $$ \frac{a_1}{1+a_2 +a_3 +\cdots +a_n }\; +\; \frac{a_2}{1+a_1 +a_3 +\cdots +a_n }\; +\; \cdots \; +\, \frac{a_n }{1+a_1 +a_2+\cdots +a_{n-1} }$$ attains its minimum, and determine this minimum.

If $x$ and $y$ are nonnegative real numbers such that $x+y=1$, determine minimal and maximal value of $$A=x\sqrt{1+y}+y\sqrt{1+x}$$

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?

Let a, b be positive integers such that $5 \nmid a, b$ and $5^5 \mid a^5+b^5$. What is the minimum possible value of $a + b$?

An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.

Given equilateral triangle with the side $l$. What is the minimal length $d$ of a brush (segment), that will paint all the triangle, if its ends are moving along the sides of the triangle.

Let $a_1, a_2, . . . , a_{2019}$ be any positive real numbers such that $\frac{1}{a_1 + 2019}+\frac{1}{a_2 + 2019}+ ... +\frac{1}{a_{2019} + 2019}=\frac{1}{2019}$. Find the minimum value of $a_1a_2... a_{2019}$ and determine for which values of $a_1, a_2, . . . , a_{2019}$ this minimum occurs