Consider a sequence of positive integers with total sum $20$ such that no number and no sum of a set of consecutive numbers is equal to $3$. Is it possible for such a sequence to contain more than $10$ numbers? (Alexandr Shapovalov)

Consider 2n+1 coins lying in a circle. At the beginning, all the coins are heads up. Moving clockwise, 2n+1 flips are performed: one coin is flipped, the next coin is skipped, the next coin is flipped, the next two coins are skipped, the next coin is flipped,the next three coins are skipped and so on, until finally 2n coins are skipped and the next coin is flipped.Prove that at the end of this procedure,exactly one coin is heads down.

The product of two positive integers $m$ and $n$ is divisible by their sum. Prove that $m + n \le n^2$. (Boris Frenkin)

Isosceles triangles with a fixed angle $\alpha$ at the vertex opposite to the base are being inscribed into a rectangle $ABCD$ so that this vertex lies on the side $BC$ and the vertices of the base lie on the sides $AB$ and $CD$. Prove that the midpoints of the bases of all such triangles coincide. (Igor Zhizhilkin)

A magician and his assistent are performing the following trick.There is a row of 12 empty closed boxes. The magician leaves the room, and a person from the audience hides a coin in each of two boxes of his choice, so that the assistent knows which boxes contain coins. The magician returns, and the assistant is allowed to open one box that does not contain a coin. Next, the magician selects 4 boxes, which are simultaneously opened. The goal of the magician is to open both boxes that contain coins. Devise a method that will allow the magician and his assistant to always succesfully perform the trick.

The King gives the following task to his two wizards. The First Wizard should choose $7$ distinct positive integers with total sum $100$ and secretly submit them to the King. To the Second Wizard he should tell only the fourth largest number. The Second Wizard must figure out all the chosen numbers. Can the wizards succeed for sure? The wizards cannot discuss their strategy beforehand. (Mikhail Evdokimov)

$2019$ point grasshoppers sit on a line. At each move one of the grasshoppers jumps over another one and lands at the point the same distance away from it. Jumping only to the right, the grasshoppers are able to position themselves so that some two of them are exactly $1$ mm apart. Prove that the grasshoppers can achieve the same, jumping only to the left and starting from the initial position. (Sergey Dorichenko)

Two equal non-intersecting wooden disks, one gray and one black, are glued to a plane. A triangle with one gray side and one black side can be moved along the plane so that the disks remain outside the triangle, while the colored sides of the triangle are tangent to the disks of the same color (the tangency points are not the vertices). Prove that the line that contains the bisector of the angle between the gray and black sides always passes through some fixed point of the plane. (Egor Bakaev, Pavel Kozhevnikov, Vladimir Rastorguev) (Senior version here)

Each segment whose endpoints are the vertices of a given regular $100$-gon is colored red, if the number of vertices between its endpoints is even, and blue otherwise. (For example, all sides of the $100$-gon are red.) A number is placed in every vertex so that the sum of their squares is equal to $1$. On each segment the product of the numbers at its endpoints is written. The sum of the numbers on the blue segments is subtracted from the sum of the numbers on the red segments. What is the greatest possible result? (Ilya Bogdanov)

One needs to ffll the cells of an $n\times n$ table ($n > 1$) with distinct integers from $1$ to $n^2$ so that every two consecutive integers are placed in cells that share a side, while every two integers with the same remainder if divided by $n$ are placed in distinct rows and distinct columns. For which $n$ is this possible? (Alexandr Gribalko)

Given is a isosceles triangle ABC so that AB=BC. Point K is in ABC, so that CK=AB=BC and <KAC=30°.Find <AKB=?

There are $100$ piles of $400$ stones each. At every move, Pete chooses two piles, removes one stone from each of them, and is awarded the number of points, equal to the non- negative difference between the numbers of stones in two new piles. Pete has to remove all stones. What is the greatest total score Pete can get, if his initial score is $0$? (Maxim Didin)

The distances from a certain point inside a regular hexagon to three of its consecutive vertices are equal to $1, 1$ and $2$, respectively. Determine the length of this hexagon's side. (Mikhail Evdokimov)

Consider two positive integers $a$ and $b$ such that $a^{n+1} + b^{n+1}$ is divisible by $a^n + b^n$ for infinitely many positive integers $n$. Is it necessarily true that $a = b$? (Boris Frenkin)

Prove that any triangle can be cut into $2019$ quadrilaterals such that each quadrilateral is both inscribed and circumscribed. (Nairi Sedrakyan)

A magician and his assistant are performing the following trick. There is a row of $13$ empty closed boxes. The magician leaves the room, and a person from the audience hides a coin in each of two boxes of his choice, so that the assistant knows which boxes contain coins. The magician returns and the assistant is allowed to open one box that does not contain a coin. Next, the magician selects four boxes, which are then simultaneously opened. The goal of the magician is to open both boxes that contain coins. Devise a method that will allow the magician and his assistant to always successfully perform the trick. (Igor Zhizhilkin) junior version posted here

Consider a sequence of positive integers with total sum $2019$ such that no number and no sum of a set of consecutive num bers is equal to $40$. What is the greatest possible length of such a sequence? (Alexandr Shapovalov)

Two not necessarily equal non-intersecting wooden disks, one gray and one black, are glued to a plane. An infinite angle with one gray side and one black side can be moved along the plane so that the disks remain outside the angle, while the colored sides of the angle are tangent to the disks of the same color (the tangency points are not the vertices). Prove that it is possible to draw a ray in the angle, starting from the vertex of the angle and such that no matter how the angle is positioned, the ray passes through some fixed point of the plane. (Egor Bakaev, Ilya Bogdanov, Pavel Kozhevnikov, Vladimir Rastorguev) (Junior version here) noteThere was a mistake in the text of the problem 3, we publish here the correct version. The solutions were estimated according to the text published originally.

The orthogonal projection of a tetrahedron onto a plane containing one of its faces is a trapezoid of area $1$, which has only one pair of parallel sides. a) Is it possible that the orthogonal projection of this tetrahedron onto a plane containing another its face is a square of area $1$? b) The same question for a square of area $1/2019$. (Mikhail Evdokimov)

For each five distinct variables from the set $x_1,..., x_{10}$ there is a single card on which their product is written. Peter and Basil play the following game. At each move, each player chooses a card, starting with Peter. When all cards have been taken, Basil assigns values to the variables as he wants, so that $0 \le x_1 \le ... \le x_10$. Can Basil ensure that the sum of the products on his cards is greater than the sum of the products on Peter's cards? (Ilya Bogdanov)

On the grid plane all possible broken lines with the following properties are constructed: each of them starts at the point $(0, 0)$, has all its vertices at integer points, each linear segment goes either up or to the right along the grid lines. For each such broken line consider the corresponding worm, the subset of the plane consisting of all the cells that share at least one point with the broken line. Prove that the number of worms that can be divided into dominoes (rectangles $2\times 1$ and $1\times 2$) in exactly $n > 2$ different ways, is equal to the number of positive integers that are less than n and relatively prime to $n$. (Ilke Chanakchi, Ralf Schiffler)

The magician puts out hardly a deck of $52$ cards and announces that $51$ of them will be thrown out of the table, and there will remain three of clubs. The viewer at each step says which count from the edge the card should be thrown out, and the magician chooses to count from the left or right edge, and ejects the corresponding card. At what initial positions of the three of clubs can the success of the focus be guaranteed?

Let $\omega$ be a circle with the center $O$ and $A$ and $C$ be two different points on $\omega$. For any third point $P$ of the circle let $X$ and $Y$ be the midpoints of the segments $AP$ and $CP$. Finally, let $H$ be the orthocenter (the point of intersection of the altitudes) of the triangle $OXY$ . Prove that the position of the point H does not depend on the choice of $P$. (Artemiy Sokolov)

There is a row of $100$ cells each containing a token. For $1$ dollar it is allowed to interchange two neighbouring tokens. Also it is allowed to interchange with no charge any two tokens such that there are exactly $3$ tokens between them. What is the minimum price for arranging all the tokens in the reverse order? (Egor Bakaev)

There are given $1000$ integers $a_1,... , a_{1000}$. Their squares $a^2_1, . . . , a^2_{1000}$ are written in a circle. It so happened that the sum of any $41$ consecutive numbers on this circle is a multiple of $41^2$. Is it necessarily true that every integer $a_1,... , a_{1000}$ is a multiple of $41$? (Boris Frenkin)

Basil has an unrestricted supply of straight bricks $1 \times 1 \times 3$ and Γ-shape bricks made of three cubes $1\times 1\times 1$. Basil filled a whole box $m \times n \times k$ with these bricks, where $m, n$ and $k$ are integers greater than $1$. Prove that it was sufficient to use only Γ-shape bricks. (Mikhail Evdokimov)

Let us call the number of factors in the prime decomposition of an integer $n > 1$ the complexity of $n$. For example, complexity of numbers $4$ and $6$ is equal to $2$. Find all $n$ such that all integers between $n$ and $2n$ have complexity a) not greater than the complexity of $n$. b) less than the complexity of $n$. (Boris Frenkin)

Two acute triangles $ABC$ and $A_1B_1C_1$ are such that $B_1$ and $C_1$ lie on $BC$, and $A_1$ lies inside the triangle $ABC$. Let $S$ and $S_1$ be the areas of those triangles respectively. Prove that $\frac{S}{AB + AC}> \frac{S_1}{A_1B_1 + A_1C_1}$ (Nairi Sedrakyan, Ilya Bogdanov)

There are 100 visually identical coins of three types: golden, silver and copper. There is at least one coin of each type. Each golden coin weighs 3 grams, each silver coins weighs 2 grams and each copper coin weighs 1 gram. How to find the type of each coin performing no more than 101 measurements on a balance scale with no weights.

Let $OP$ and $OQ$ be the perpendiculars from the circumcenter $O$ of a triangle $ABC$ to the internal and external bisectors of the angle $B$. Prove that the line$ PQ$ divides the segment connecting midpoints of $CB$ and $AB$ into two equal parts. (Artemiy Sokolov)

Let us say that the pair $(m, n)$ of two positive different integers m and n is nice if $mn$ and $(m + 1)(n + 1)$ are perfect squares. Prove that for each positive integer m there exists at least one $n > m$ such that the pair $(m, n)$ is nice. (Yury Markelov)

Peter has several $100$ ruble notes and no other money. He starts buying books; each book costs a positive integer number of rubles, and he gets change in $1$ ruble coins. Whenever Peter is buying an expensive book for $100$ rubles or higher he uses only $100$ ruble notes in the minimum necessary number. Whenever he is buying a cheap one (for less than $100$ rubles) he uses his coins if he has enough, otherwise using a $100$ ruble note. When the $100$ ruble notes have come to the end, Peter has expended exactly a half of his money. Is it possible that he has expended $5000$ rubles or more? (Tatiana Kazitsina)

Peter has a wooden square stamp divided into a grid. He coated some $102$ cells of this grid with black ink. After that, he pressed this stamp $100$ times on a list of paper so that each time just those $102$ cells left a black imprint on the paper. Is it possible that after his actions the imprint on the list is a square $101 \times 101$ such that all the cells except one corner cell are black? (Alexsandr Gribalko)

Given a convex pentagon $ABCDE$ such that $AE$ is parallel to $CD$ and $AB=BC$. Angle bisectors of angles $A$ and $C$ intersect at $K$. Prove that $BK$ and $AE$ are parallel.

An integer $1$ is written on the blackboard. We are allowed to perform the following operations:to change the number $x$ to $3x+1$ of to $[\frac{x}{2}]$. Prove that we can get all positive integers using this operations.

A polygon is given in which any two adjacent sides are perpendicular. We call its two vertices non-friendly if the bisectors of the polygon emerging from these vertices are perpendicular. Prove that for any vertex the number of vertices that are not friends with it is even.

In each cell, a strip of length $100$ is worth a chip. You can change any $2$ neighboring chips and pay $1$ rouble, and you can also swap any $2$ chips for free, between which there are exactly $4$ chips. For what is the smallest amount of rubles you can rearrange chips in reverse order?

The polynomial P(x,y) is such that for every integer n >= 0 each of the polynomials P(x,n) and P(n,y) either is a constant zero or has a degree not greater than n. Is it possible that P(x,x) has an odd degree?

Let $ABC$ be an acute triangle. Suppose the points $A',B',C'$ lie on its sides $BC,AC,AB$ respectively and the segments $AA',BB',CC'$ intersect in a common point $P$ inside the triangle. For each of those segments let us consider the circle such that the segment is its diameter, and the chord of this circle that contains the point $P$ and is perpendicular to this diameter. All three these chords occurred to have the same length. Prove that $P$ is the orthocenter of the triangle $ABC$. (Grigory Galperin)

Consider the following sequence of positive real numbers $\dots<a_{-2}<a_{-1}<a_0<a_1<a_2<\dots$ infinite in both directions. For each positive integer $k$ let $b_k$ be the least integer such that the ratio between the sum of $k$ consecutive terms and the greatest of these $k$ terms is less than or equal to $b_k$(This fact occurs for any sequence of $k$ consecutive numbers). Prove that the sequence $b_1,b_2,b_3,...$ coincides with the sequence $1,2,3,...$ or is eventually constant.

The point $M$ inside a convex quadrilateral $ABCD$ is equidistant from the lines $AB$ and $CD$ and is equidistant from the lines $BC$ and $AD$. The area of $ABCD$ occurred to be equal to $MA\cdot MC +MB \cdot MD$. Prove that the quadrilateral $ABCD$ is a) tangential (circumscribed), b) cyclic (inscribed). (Nairi Sedrakyan)

A cube consisting of $(2N)^3$ unit cubes is pierced by several needles parallel to the edges of the cube (each needle pierces exactly $2N$ unit cubes). Each unit cube is pierced by at least one needle. Let us call any subset of these needles “regular” if there are no two needles in this subset that pierce the same unit cube. a) Prove that there exists a regular subset consisting of $2N^2$ needles such that all of them have either the same direction or two different directions. b) What is the maximum size of a regular subset that does exist for sure? (Nikita Gladkov, Alexandr Zimin)

We color some positive integers $(1,2,...,n)$ with color red, such that any triple of red numbers $(a,b,c)$(not necessarily distincts) if $a(b-c)$ is multiple of $n$ then $b=c$. Prove that the quantity of red numbers is less than or equal to $\varphi(n)$.