There are $m$ identical two-pan weighting scales. One of them is broken and it shows any outcome, at random. The other scales always show the correct outcome. Moreover, the weight of the broken scale differs from those of the other scales, which are all equal. At a move, we may choose a scale and place some of the other scales on its pans. Determine the greatest value of $m$ for which we may find the broken scale with no more than three moves. [i]Proposed by A. Gribalko and O. Manzhina[/i]

Let $n$ be a positive integer. A Steiner tree associated with a finite set $S$ of points in the Euclidean $n$-space is a finite collection $T$ of straight-line segments in that space such that any two points in $S$ are joined by a unique path in $T$ , and its length is the sum of the segment lengths. Show that there exists a Steiner tree of length $1+(2^{n-1}-1)\sqrt{3}$ associated with the vertex set of a unit $n$-cube.

Let $n$ be a natural number. Find the least natural number $k$ for which there exist $k$ sequences of $0$ and $1$ of length $2n+2$ with the following property: any sequence of $0$ and $1$ of length $2n+2$ coincides with some of these $k$ sequences in at least $n+2$ positions.

Numbers in an $n$ by $n$ table may be changed by adding $1$ to each number on an arbitrary closed non-selfintersecting “rook path” (a broken line with segments parallel to the borders of the table). Originally $1$’s stand on one of the diagonals, and $0S’s in the other cells of the table. Can one get (after several transformations) a table in which all numbers are equal to each other? (A “rook path” contains all cells through which it passes.) (AA Egorov)

The figure shows a figure of $5$ unit squares, a Greek cross. What is the largest number of Greek crosses that can be placed on a grid of dimensions $8 \times 8$ without any overlaps, with each unit square covering just one square in a grid?

Determine the smallest number N, multiple of 83, such that N^2 has 63 positive divisors.

State consists of $2021$ cities, between some of them there are direct flights. Each pair of cities has not more than one flight, every flight belongs to one of $2021$ companies. Call a group of cities [i]incomplete[/i], if at least one company doesn't have any flights between cities of the group. Find the maximum positive integer $m$, so that one can always find an incomplete group of $m$ cities.

Two players A and B play the following game. Initially, there are $ m$ equal positive integers $ n$ written on a blackboard. A begins and the players move alternately. The player to move chooses one of the non-zero numbers on the board. If this number k is the smallest among all positive integers on the board, the player replaces it with $ k\minus{}1$; if not, the player replaces it with the smallest positive number on the board. The player who first turns all the numbers into zeroes, wins. Who wins if both players use their best strategies?

Let $k$ be a positive integer. Determine the least positive integer $n$, with $n\geq k+1$, for which the game below can be played indefinitely: Consider $n$ boxes, labelled $b_1,b_2,...,b_n$. For each index $i$, box $b_i$ contains exactly $i$ coins. At each step, the following three substeps are performed in order: [b](1)[/b] Choose $k+1$ boxes; [b](2)[/b] Of these $k+1$ boxes, choose $k$ and remove at least half of the coins from each, and add to the remaining box, if labelled $b_i$, a number of $i$ coins. [b](3)[/b] If one of the boxes is left empty, the game ends; otherwise, go to the next step. [i]Proposed by Demetres Christofides, Cyprus[/i]

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

The city of Neverreturn has $N$ bus stops numbered $1, 2, \cdots , N.$ Each bus route is one-way and has only two stops, the beginning and the end. The route network is such that departing from any stop one cannot return to it using city buses. When the mayor notices a route going from a stop with a greater number to a stop with a lesser number, he orders to exchange the number plates of its beginning and its end. Can the plate changing go on infinitely? [i](K. Ivanov )[/i]

Three travel companies provide transportation between $n$ cities, such that each connection between a pair of cities is covered by one company only. Prove that, for $n \geq 11$, there must exist a round-trip through some four cities, using the services of a same company, while for $n < 11$ this is not anymore necessarily true. [i]Dan Schwarz[/i]

There are 2018 cards numbered from 1 to 2018. The numbers of the cards are visible at all times. Tito and Pepe play a game. Starting with Tito, they take turns picking cards until they're finished. Then each player sums the numbers on his cards and whoever has an even sum wins. Determine which player has a winning strategy and describe it. P.S. Proposed by yours truly :-D

[b]p1.[/b] Lisa is playing the piano at a tempo of $80$ beats per minute. If four beats make one measure of her rhythm, how many seconds are in one measure? [b]p2.[/b] Compute the smallest integer $n > 1$ whose base-$2$ and base-$3$ representations both do not contain the digit $0$. [b]p3.[/b] In a room of $24$ people, $5/6$ of the people are old, and $5/8$ of the people are male. At least how many people are both old and male? [b]p4.[/b] Juan chooses a random even integer from $1$ to $15$ inclusive, and Gina chooses a random odd integer from $1$ to $15$ inclusive. What is the probability that Juan’s number is larger than Gina’s number? (They choose all possible integers with equal probability.) [b]p5.[/b] Set $S$ consists of all positive integers less than or equal to $ 2016$. Let $A$ be the subset of $S$ consisting of all multiples of $6$. Let $B$ be the subset of $S$ consisting of all multiples of $7$. Compute the ratio of the number of positive integers in $A$ but not $B$ to the number of integers in $B$ but not $A$. [b]p6.[/b] Three peas form a unit equilateral triangle on a flat table. Sebastian moves one of the peas a distance $d$ along the table to form a right triangle. Determine the minimum possible value of $d$. [b]p7.[/b] Oumar is four times as old as Marta. In $m$ years, Oumar will be three times as old as Marta will be. In another $n$ years after that, Oumar will be twice as old as Marta will be. Compute the ratio $m/n$. [b]p8.[/b] Compute the area of the smallest square in which one can inscribe two non-overlapping equilateral triangles with side length $ 1$. [b]p9.[/b] Teemu, Marcus, and Sander are signing documents. If they all work together, they would finish in $6$ hours. If only Teemu and Sander work together, the work would be finished in 8 hours. If only Marcus and Sander work together, the work would be finished in $10$ hours. How many hours would Sander take to finish signing if he worked alone? [b]p10.[/b]Triangle $ABC$ has a right angle at $B$. A circle centered at $B$ with radius $BA$ intersects side $AC$ at a point $D$ different from $A$. Given that $AD = 20$ and $DC = 16$, find the length of $BA$. [b]p11.[/b] A regular hexagon $H$ with side length $20$ is divided completely into equilateral triangles with side length $ 1$. How many regular hexagons with sides parallel to the sides of $H$ are formed by lines in the grid? [b]p12[/b]. In convex pentagon $PEARL$, quadrilateral $PERL$ is a trapezoid with side $PL$ parallel to side $ER$. The areas of triangle $ERA$, triangle $LAP$, and trapezoid $PERL$ are all equal. Compute the ratio $\frac{PL}{ER}$. [b]p13.[/b] Let $m$ and $n$ be positive integers with $m < n$. The first two digits after the decimal point in the decimal representation of the fraction $m/n$ are $74$. What is the smallest possible value of $n$? [b]p14.[/b] Define functions $f(x, y) = \frac{x + y}{2} - \sqrt{xy}$ and $g(x, y) = \frac{x + y}{2} + \sqrt{xy}$. Compute $g (g (f (1, 3), f (5, 7)), g (f (3, 5), f (7, 9)))$. [b]p15.[/b] Natalia plants two gardens in a $5 \times 5$ grid of points. Each garden is the interior of a rectangle with vertices on grid points and sides parallel to the sides of the grid. How many unordered pairs of two non-overlapping rectangles can Nataliia choose as gardens? (The two rectangles may share an edge or part of an edge but should not share an interior point.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$120$ bags with $100$ coins are placed on the floor. One bag has coins that weigh $9$ grams, the other bags have coins that weigh $10$ grams. One may place some coins (not necessarily from the same bag) on a weighing scale, but it will only properly display the weight if it is less than $1000$ grams. Determine the minimum number of times that the weighing scale may be used in order to identify the bag that has the $9$-gram coins.

[b]8.1 [/b] Construct a quadrilateral using side lengths and distances between the midpoints of the diagonals. [b]8.2[/b] It is known that $a,b$ and $\sqrt{a}+\sqrt{b} $ are rational numbers. Prove that then $\sqrt{a}$, $\sqrt{b} $ are rational. [b]8.3 / 9.2[/b] Solve equation $x^3 - [x]=3$ [b]8.4[/b] Prove that if in a triangle the angle bisector of the vertex, bisects the angle between the median and the altitude, then the triangle either isosceles or right. . [b]8.5[/b] Given $n$ numbers $x_1, x_2, . . . , x_n$, each of which is equal to $+1$ or $-1$. At the same time $$x_1x_2 + x_2x_3 + . . . + x_{n-1}x_n + x_nx_1 = 0 .$$ Prove that $n$ is divisible by $4$. [b]8.6[/b] There are $n$ points marked on the circle, and it is known that for of any two, one of the arcs connecting them has a measure less than $120^0$.Prove that all points lie on an arc of size $120^0$. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983442_1961_leningrad_math_olympiad]here[/url].

Find all ordered pairs of positive integers $(m,n)$ for which there exists a set $C=\{c_1,\ldots,c_k\}$ ($k\ge1$) of colors and an assignment of colors to each of the $mn$ unit squares of a $m\times n$ grid such that for every color $c_i\in C$ and unit square $S$ of color $c_i$, exactly two direct (non-diagonal) neighbors of $S$ have color $c_i$. [i]David Yang.[/i]

You have an unlimited supply of square tiles with side length $ 1$ and equilateral triangle tiles with side length $ 1$. For which n can you use these tiles to create a convex $n$-sided polygon? The tiles must fit together without gaps and may not overlap.

Let $m\ge 2$ be an integer, $A$ a finite set of integers (not necessarily positive) and $B_1,B_2,...,B_m$ subsets of $A$. Suppose that, for every $k=1,2,...,m$, the sum of the elements of $B_k$ is $m^k$. Prove that $A$ contains at least $\dfrac{m}{2}$ elements.

Dagan has a wooden cube. He paints each of the six faces a different color. He then cuts up the cube to get eight identically-sized smaller cubes, each of which now has three painted faces and three unpainted faces. He then puts the smaller cubes back together into one larger cube such that no unpainted face is visible. Compute the number of different cubes that Dagan can make this way. Two cubes are considered the same if one can be rotated to obtain the other. You may express your answer either as an integer or as a product of prime numbers.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]

For 31 years, n (>6) tennis players have records of wins. It turns out that for every two players, there is a third player who has won over them before. Prove that for every integer $k,l$ such that $2^{2^k+1}-1>n, 1<l<2k+1$, there exist $l$ players ($A_1, A_2, ... , A_l$) such that every player $A_{i+1}$ won over $A_i$. ($A_{l+1}$ is same as $A_1$)

Two 10-digit integers are called neighbours if they differ in exactly one digit (for example, integers $1234567890$ and $1234507890$ are neighbours). Find the maximal number of elements in the set of 10-digit integers with no two integers being neighbours.

It is known that the merchant’s $n$ clients live in locations laid along the ring road. Of these, $k$ customers have debts to the merchant for $a_1,a_2,...,a_k$ rubles, and the merchant owes the remaining $n-k$ clients, whose debts are $b_1,b_2,...,b_{n-k}$ rubles, moreover, $a_1+a_2+...+a_k=b_1+b_2+...+b_{n-k}$. Prove that a merchant who has no money can pay all his debts and have paid all the customer debts, by starting a customer walk along the road from one of points and not missing any of their customers.

Find all pairs of positive integers (m, n) for which it is possible to paint each unit square of an m*n chessboard either black or white in such way that, for any unit square of the board, the number of unit squares which are painted the same color as that square and which have at least one common vertex with it (including the square itself) is even.