Nico picks $13$ pairwise distinct $3-$digit positive integers. Ian then selects several of these 13 numbers, the ones he wants, and using only once each selected number and some of the operations addition, subtraction, multiplication and division ($+,-,\times ,:$) must get an expression whose value is greater than $3$ and less than $4$. If he succeeds, Ian wins; otherwise, Nico wins. Which of the two has a winning strategy?

In a row there are $51$ written positive integers. Their sum is $100$ . An integer is representable if it can be expressed as the sum of several consecutive numbers in a row of $51$ integers. Show that for every $k$ , with $1\le k \le 100$ , one of the numbers $k$ and $100-k$ is representable.

Let $ABC$ be a triangle of perimeter $100$ and $I$ be the point of intersection of its bisectors. Let $M$ be the midpoint of side $BC$. The line parallel to $AB$ drawn by$ I$ cuts the median $AM$ at point $P$ so that $\frac{AP}{PM} =\frac73$. Find the length of side $AB$.

For a positive integer $n$ we denote $D_2(n)$ to the number of divisors of $n$ which are perfect squares and $D_3(n)$ to the number of divisors of $n$ which are perfect cubes. Prove that there exists such that $D_2(n)=999D_3(n).$ Note. The perfect squares are $1^2,2^2,3^2,4^2,…$ , the perfect cubes are $1^3,2^3,3^3,4^3,…$ .

We will say that a list of positive integers is admissible if all its numbers are less than or equal to $100$ and their sum is greater than $1810$. Find the smallest positive integer $d$ such that each admissible list can be crossed out some numbers such that the sum of the numbers left uncrossed out is greater than or equal to $1810-d$ and less than or equal to $1810+d$ .

Draw all the diagonals of a convex polygon of $10$ sides. They divide their angles into $80$ parts. It is known that at least $59$ of those parts are equal. Determine the largest number of distinct values among the $ 80$ angles of division and how many times each of those values occurs.