There is a closed polyline with $n$ edges on the plane. We build a new polyline which edges connect the midpoints of two adjacent edges of the previous polyline. Then we erase previous polyline and start over and over. Also we know that each polyline satisfy that all vertices are different and not all of them are collinear. For which $n$ we can get a polyline that is a сonvex polygon?

Let $n\geq 3$ be a positive integer. Consider an $n\times n$ square. In each cell of the square, one of the numbers from the set $M=\{1,2,\ldots,2n-1\}$ is to be written. One such filling is called [i]good[/i] if, for every index $1\leq i\leq n,$ row no. $i$ and column no. $i,$ together, contain all the elements of $M$. [list=a] [*]Prove that there exists $n\geq 3$ for which a good filling exists. [*]Prove that for $n=2017$ there is no good filling of the $n\times n$ square. [/list]

Suppose a grid with $2m$ rows and $2n$ columns is given, where $m$ and $n$ are positive integers. You may place one pawn on any square of this grid, except the bottom left one or the top right one. After placing the pawn, a snail wants to undertake a journey on the grid. Starting from the bottom left square, it wants to visit every square exactly once, except the one with the pawn on it, which the snail wants to avoid. Moreover, it wants to finish in the top right square. It can only move horizontally or vertically on the grid. On which squares can you put the pawn for the snail to be able to finish its journey?

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

Let $k\geq 1$ be an integer. In a group of $2k+1$ people, some are sincere (they always tell the truth) and the rest are unpredictable (sometimes they tell the truth and sometimes they lie). It is known that the unpredictable ones are at most $k$. Someone outside the group must determine who is sincere and who is unpredictable through a sequence of steps. In each step he chooses two people $A$ and $B$ from the group and asks $A$ is $B$ sincere? Show that after $3k$ steps the stranger will be able to classify with certainty the $2k+1$ people in the group. (Before asking each question, the answers to the previous questions are known.) Clarification: Each of the $2k+1$ people in the group knows which ones are sincere and which ones are unpredictable.

For what values of $k{}$ can a regular octagon with side-length $k{}$ be cut into $1 \times 2{}$ dominoes and rhombuses with side-length 1 and a $45^\circ{}$ angle?

There are $n \ge 7$ points in the plane, no $3$ of which are collinear. At least $7$ pairs of points are joined by line segments. For every aforementioned line segment $s$, let $t(s)$ be the number of triangles for which the segment $s$ is a side. Prove that there exist different line segments $s_1, s_2, s_3,$ and $s_4$ such that \[t(s_1) = t(s_2) = t(s_3) = t(s_4)\] holds. Proposed by [i]Viktor Simjanoski[/i]

[b]p1.[/b] Nicky is studying biology and has a tank of $17$ lizards. In one day, he can either remove $5$ lizards or add $2$ lizards to his tank. What is the minimum number of days necessary for Nicky to get rid of all of the lizards from his tank? [b]p2.[/b] What is the maximum number of spheres with radius $1$ that can fit into a sphere with radius $2$? [b]p3.[/b] A positive integer $x$ is sunny if $3x$ has more digits than $x$. If all sunny numbers are written in increasing order, what is the $50$th number written? [b]p4.[/b] Quadrilateral $ABCD$ satisfies $AB = 4$, $BC = 5$, $DA = 4$, $\angle DAB = 60^o$, and $\angle ABC = 150^o$. Find the area of $ABCD$. [b]p5. [/b]Totoro wants to cut a $3$ meter long bar of mixed metals into two parts with equal monetary value. The left meter is bronze, worth $10$ zoty per meter, the middle meter is silver, worth $25$ zoty per meter, and the right meter is gold, worth $40$ zoty per meter. How far, in meters, from the left should Totoro make the cut? [b]p6.[/b] If the numbers $x_1, x_2, x_3, x_4$, and $x5$ are a permutation of the numbers $1, 2, 3, 4$, and $5$, compute the maximum possible value of $$|x_1 - x_2| + |x_2 - x_3| + |x_3 - x_4| + |x_4 - x_5|.$$ [b]p7.[/b] In a $3 \times 4$ grid of $12$ squares, find the number of paths from the top left corner to the bottom right corner that satisfy the following two properties: $\bullet$ The path passes through each square exactly once. $\bullet$ Consecutive squares share a side. Two paths are considered distinct if and only if the order in which the twelve squares are visited is different. For instance, in the diagram below, the two paths drawn are considered the same. [img]https://cdn.artofproblemsolving.com/attachments/7/a/bb3471bbde1a8f58a61d9dd69c8527cfece05a.png[/img] [b]p8.[/b] Scott, Demi, and Alex are writing a computer program that is $25$ ines long. Since they are working together on one computer, only one person may type at a time. To encourage collaboration, no person can type two lines in a row, and everyone must type something. If Scott takes $10$ seconds to type one line, Demi takes $15$ seconds, and Alex takes $20$ seconds, at least how long, in seconds, will it take them to finish the program? [b]p9.[/b] A hand of four cards of the form $(c, c, c + 1, c + 1)$ is called a tractor. Vinjai has a deck consisting of four of each of the numbers $7$, $8$, $9$ and $10$. If Vinjai shuffles and draws four cards from his deck, compute the probability that they form a tractor. [b]p10. [/b]The parabola $y = 2x^2$ is the wall of a fortress. Totoro is located at $(0, 4)$ and fires a cannonball in a straight line at the closest point on the wall. Compute the y-coordinate of the point on the wall that the cannonball hits. [b]p11. [/b]How many ways are there to color the squares of a $10$ by $10$ grid with black and white such that in each row and each column there are exactly two black squares and between the two black squares in a given row or column there are exactly [b]4[/b] white squares? Two configurations that are the same under rotations or reflections are considered different. [b]p12.[/b] In rectangle $ABCD$, points $E$ and $F$ are on sides $AB$ and $CD$, respectively, such that $AE = CF > AD$ and $\angle CED = 90^o$. Lines $AF, BF, CE$ and $DE$ enclose a rectangle whose area is $24\%$ of the area of $ABCD$. Compute $\frac{BF}{CE}$ . [b]p13.[/b] Link cuts trees in order to complete a quest. He must cut $3$ Fenwick trees, $3$ Splay trees and $3$ KD trees. If he must also cut 3 trees of the same type in a row at some point during his quest, in how many ways can he cut the trees and complete the quest? (Trees of the same type are indistinguishable.) [b]p14.[/b] Find all ordered pairs (a, b) of positive integers such that $\sqrt{64a + b^2} + 8 = 8\sqrt{a} + b$. [b]p15.[/b] Let $ABCDE$ be a convex pentagon such that $\angle ABC = \angle BCD = 108^o$, $\angle CDE = 168^o$ and $AB =BC = CD = DE$. Find the measure of $\angle AEB$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $k$ be an integer in the interval $[1,99]$. A fair coin is to be flipped $100$ times. Let $$\varepsilon_j =\begin{cases} 1, \text{if the j-th flip is a head} \\ 2, \text{f the j-th flip is a tail}\end{cases}$$ Let $M_k$ denote the probability that there exists a number $i$ such that $k+\varepsilon_1 +...+\varepsilon_i = 100$. How to choose $k$ so as to maximize the probability $M_k$?

The vertices of a $33$-gon are labelled with the integers from $1$ to $33$. Each edge is then labelled with the sum of the labels of its two vertices. Is it possible for the edge labels to consist of $33$ consecutive numbers?

A participant is given a deck of thirteen cards numerated from 1 to 13, from which he chooses seven and gives them to the assistant. Then the assistant chooses three of these seven cards and the participant – one of the remaining six in his hand. The magician then takes the chosen four cards (arranged by the participant) and guesses which one is chosen from the participant. What should the magician and assistant do so that the magic trick always happens?

Let $k$ be a positive integer and $P$ a point in the plane. We wish to draw lines, none passing through $P$, in such a way that any ray starting from $P$ intersects at least $k$ of these lines. Determine the smallest number of lines needed.

A polygon $A$ that doesn't intersect itself and has perimeter $p$ is called [b]Rotund[/b] if for each two points $x,y$ on the sides of this polygon which their distance on the plane is less than $1$ their distance on the polygon is at most $\frac{p}{4}$. (Distance on the polygon is the length of smaller path between two points on the polygon) Now we shall prove that we can fit a circle with radius $\frac{1}{4}$ in any rotund polygon. The mathematicians of two planets earth and Tarator have two different approaches to prove the statement. In both approaches by "inner chord" we mean a segment with both endpoints on the polygon, and "diagonal" is an inner chord with vertices of the polygon as the endpoints. [b]Earth approach: Maximal Chord[/b] We know the fact that for every polygon, there exists an inner chord $xy$ with a length of at most 1 such that for any inner chord $x'y'$ with length of at most 1 the distance on the polygon of $x,y$ is more than the distance on the polygon of $x',y'$. This chord is called the [b]maximal chord[/b]. On the rotund polygon $A_0$ there's two different situations for maximal chord: (a) Prove that if the length of the maximal chord is exactly $1$, then a semicircle with diameter maximal chord fits completely inside $A_0$, so we can fit a circle with radius $\frac{1}{4}$ in $A_0$. (b) Prove that if the length of the maximal chord is less than one we still can fit a circle with radius $\frac{1}{4}$ in $A_0$. [b]Tarator approach: Triangulation[/b] Statement 1: For any polygon that the length of all sides is less than one and no circle with radius $\frac{1}{4}$ fits completely inside it, there exists a triangulation of it using diagonals such that no diagonal with length more than $1$ appears in the triangulation. Statement 2: For any polygon that no circle with radius $\frac{1}{4}$ fits completely inside it, can be divided into triangles that their sides are inner chords with length of at most 1. The mathematicians of planet Tarator proved that if the second statement is true, for each rotund polygon there exists a circle with radius $\frac{1}{4}$ that fits completely inside it. (c) Prove that if the second statement is true, then for each rotund polygon there exists a circle with radius $\frac{1}{4}$ that fits completely inside it. They found out that if the first statement is true then the second statement is also true, so they put a bounty of a doogh on proving the first statement. A young earth mathematician named J.N., found a counterexample for statement 1, thus receiving the bounty. (d) Find a 1392-gon that is counterexample for statement 1. But the Tarators are not disappointed and they are still trying to prove the second statement. (e) (Extra points) Prove or disprove the second statement. Time allowed for this problem was 150 minutes.

On a rectangular piece of paper there are (a) several marked points all on one straight line, (b) three marked points (not necessarily on a straight line). We are allowed to fold the paper several times along a straight line not containing marked points and then puncture the folded paper with a needle. Show that this can be done so that after the paper has been unfolded all the marked points are punctured and there are no extra holes. (A Shapovalov)

Five distinct numbers are drawn successively and at random from the set $\{1, \cdots , n\}$. Show that the probability of a draw in which the first three numbers as well as all five numbers can be arranged to form an arithmetic progression is greater than $\frac{6}{(n-2)^3}$

Prove that it is possible to find $2^{n+1}$ of $2^n$ digit numbers containing only "$1$" and "$2$" as digits, such that every two of them distinguish at least in $2^{n-1}$ digits.

Let $ X$ be a set of $ k$ vertexes on a plane such that no three of them are collinear. Let $ P$ be the family of all $ {k \choose 2}$ segments that connect each pair of points. Determine $ \tau(P)$.

Let $ ABC$ be an equilateral triangle with side length equal to $ N \in \mathbb{N}.$ Consider the set $ S$ of all points $ M$ inside the triangle $ ABC$ satisfying \[ \overrightarrow{AM} \equal{} \frac{1}{N} \cdot \left(n \cdot \overrightarrow{AB} \plus{} m \cdot \overrightarrow{AC} \right)\] with $ m, n$ integers, $ 0 \leq n \leq N,$ $ 0 \leq m \leq N$ and $ n \plus{} m \leq N.$ Every point of S is colored in one of the three colors blue, white, red such that [b](i) [/b]no point of $ S \cap [AB]$ is coloured blue [b](ii)[/b] no point of $ S \cap [AC]$ is coloured white [b](iii)[/b] no point of $ S \cap [BC]$ is coloured red Prove that there exists an equilateral triangle the following properties: [b](1)[/b] the three vertices of the triangle are points of $ S$ and coloured blue, white and red, respectively. [b](2)[/b] the length of the sides of the triangle is equal to 1. [i]Variant:[/i] Same problem but with a regular tetrahedron and four different colors used.

The $64$ cells of an $8 \times 8$ chessboard have $64$ different colours. A Knight stays in one cell. In each move, the Knight jumps from one cell to another cell (the $2$ cells on the diagonal of an $2 \times 3$ board) also the colours of the $2$ cells interchange. In the end, the Knight goes to a cell having common side with the cell it stays at first. Can it happen that: there are exactly $3$ cells having the colours different from the original colours?

In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn: [list] [*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller. [*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter. [/list] We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.

Let $ a_1,a_2,...,a_n$ is permutaion of $ 1,2,...,n$. For this permutaion call the pair $ (a_i,a_j)$ [i]wrong pair [/i]if $ i<j$ and $ a_i >a_j$.Let [i]number of inversion [/i] is number of [i]wrong pair [/i] of permutation $ a_1,a_2,a_3,..,a_n$. Let $ n \ge 2$ is positive integer. Find the number of permutation of $ 1,2,..,n$ such that its [i]number of inversion [/i]is divisible by $ n$.

Let $ABC$ be an equilateral triangle of side length $a$, and consider $D$, $E$ and $F$ the midpoints of the sides $(AB), (BC)$, and $(CA)$, respectively. Let $H$ be the the symmetrical of $D$ with respect to the line $BC$. Color the points $A, B, C, D, E, F, H$ with one of the two colors, red and blue. [list=1] [*] How many equilateral triangles with all the vertices in the set $\{A, B, C, D, E, F, H\}$ are there? [*] Prove that if points $B$ and $E$ are painted with the same color, then for any coloring of the remaining points there is an equilateral triangle with vertices in the set $\{A, B, C, D, E, F, H\}$ and having the same color. [*] Does the conclusion of the second part remain valid if $B$ is blue and $E$ is red? [/list]

There is a balance without weights and there are two piles of stones of unknown masses, 10 stones in each pile. One is allowed an unlimited number of weighing iterations, but only 9 stones at most fit on any plate of the balance. Is it always possible to determine which stone pile is heavier or establish that they are equal? Sergey Dorichenko

There are $2n$ distinct points on a circle. The numbers $1$ through $2n$ are randomly assigned to this one points distributed. Each point is connected to exactly one other point, so that no of the resulting connecting routes intersect. If a segment connects the numbers $a$ and $b$, so we assign the value $ |a - b|$ to the segment . Show that we can choose the routes such that the sum of these values ​​results $n^2$.

Let $n > 10$ be an integer, and let $A_1, A_2, \dots, A_n$ be distinct points in the plane such that the distances between the points are pairwise different. Define $f_{10}(j, k)$ to be the 10th smallest of the distances from $A_j$ to $A_1, A_2, \dots, A_k$, excluding $A_j$ if $k \geq j$. Suppose that for all $j$ and $k$ satisfying $11 \leq j \leq k \leq n$, we have $f_{10}(j, j - 1) \geq f_{10}(k, j - 1)$. Prove that $f_{10}(j, n) \geq \frac{1}{2} f_{10}(n, n)$ for all $j$ in the range $1 \leq j \leq n - 1$. [i]Proposed by Morteza Saghafian, Iran[/i]