There are 2016 points near a line such that the distance from each point to the line is less than 1 cm, and the distance between any two points is always greater than 2 cm. Prove that there exist two points whose distance is at least 17 meters.

A factory packs its products in cubic boxes. In one store, they put $512$ of these cubic boxes together to make a large $8\times 8 \times 8$ cube. When the temperature goes higher than a limit in the store, it is necessary to separate the $512$ set of boxes using horizontal and vertical plates so that each box has at least one face which is not touching other boxes. What is the least number of plates needed for this purpose?

Two ants are moving along the edges of a convex polyhedron. The route of every ant ends in its starting point, so that one ant does not pass through the same point twice along its way. On every face $F$ of the polyhedron are written the number of edges of $F$ belonging to the route of the first ant and the number of edges of $F$ belonging to the route of the second ant. Is there a polyhedron and a pair of routes described as above, such that only one face contains a pair of distinct numbers? [i]Proposed by Nikolai Beluhov[/i]

You have an $n \times n$ grid of empty squares. You place a cross in all the squares, one at a time. When you place a cross in an empty square, you receive $i+j$ points if there were $i$ crosses in the same row and $j$ crosses in the same column before you placed the new cross. Which are the possible total scores you can get?

You are at a point $(a,b)$ and you need to reach another point $(c,d)$. Both points are below the line $x = y$ and have integer coordinates. You can move in steps of length 1, either upwards of to the right, but you may not move to a point on the line $x = y$. How many different paths are there?

[b]p1.[/b] a) Given four points in the plane, no three of which lie on the same line, each subset of three points determines the vertices of a triangle. Can all these triangles have equal areas? If so, give an example of four points (in the plane) with this property, and then describe all arrangements of four joints (in the plane) which permit this. If no such arrangement exists, prove this. b) Repeat part a) with "five" replacing "four" throughout. [b]p2.[/b] Three people at the base of a long stairway begin a race up the stairs. Person A leaps five steps with each stride (landing on steps $5$, $10$, $15$, etc.). Person B leaps a little more slowly but covers six steps with each stride. Person C leaps seven steps with each stride. A picture taken near the end of the race shows all three landing simultaneously, with Person A twenty-one steps from the top, person B seven steps from the top, and Person C one step from the top. How many steps are there in the stairway? If you can find more than one answer, do so. Justify your answer. [b]p3. [/b]Let $S$ denote the sum of an infinite geometric series. Suppose the sum of the squares of the terms is $2S$, and that df the cubes is $64S/13$. Find the first three terms of the original series. [b]p4.[/b] $A$, $B$ and $C$ are three equally spaced points on a circular hoop. Prove that as the hoop rolls along the horizontal line $\ell$, the sum of the distances of the points $A, B$, and $C$ above line $\ell$ is constant. [img]https://cdn.artofproblemsolving.com/attachments/3/e/a1efd0975cf8ff3cf6acb1da56da1dce35d81e.png[/img] [b]p5.[/b] A set of $n$ numbers $x_1,x_2,x_3,...,x_n$ (where $n>1$) has the property that the $k^{th}$ number (that is, $x_k$ ) is removed from the set, the remaining $(n-1)$ numbers have a sum equal to $k$ (the subscript o $x_k$ ), and this is true for each $k = 1,2,3,...,n$. a) SoIve for these $n$ numbers b) Find whether at least one of these $n$ numbers can be an integer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Sabbir noticed one day that everyone in the city of BdMO has a distinct word of length $10$, where each letter is either $A$ or $B$. Sabbir saw that two citizens are friends if one of their words can be altered a few times using a special rule and transformed into the other ones word. The rule is, if somewhere in the word $ABB$ is located consecutively, then these letters can be changed to $BBA$ or if $BBA$ is located somewhere in the word consecutively, then these letters can be changed to $ABB$ (if wanted, the word can be kept as it is, without making this change.) For example $AABBA$ can be transformed into $AAABB$ (the opposite is also possible.) Now Sabbir made a team of $N$ citizens where no one is friends with anyone. What is the highest value of $N.$

Three $n\times n$ squares form the figure $\Phi$ on the checkered plane as shown on the picture. (Neighboring squares are tpuching along the segment of length $n-1$.) Find all $n > 1$ for which the figure $\Phi$ can be covered with tiles $1\times 3$ and $3\times 1$ without overlapping.[img]https://pp.userapi.com/c850332/v850332712/115884/DKxvALE-sAc.jpg[/img]

All cells of the checkered plane are painted in $5$ colors so that in any figure of the species [img]https://cdn.artofproblemsolving.com/attachments/f/f/49b8d6db20a7e9cca7420e4b51112656e37e81.png[/img] all colors are different. Prove that in any figure of the species $ \begin{tabular}{ | l | c| c | c | r| } \hline & & & &\\ \hline \end{tabular}$, all colors are different..

For each finite set $ U$ of nonzero vectors in the plane we define $ l(U)$ to be the length of the vector that is the sum of all vectors in $ U.$ Given a finite set $ V$ of nonzero vectors in the plane, a subset $ B$ of $ V$ is said to be maximal if $ l(B)$ is greater than or equal to $ l(A)$ for each nonempty subset $ A$ of $ V.$ (a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively. (b) Show that, for any set $ V$ consisting of $ n \geq 1$ vectors the number of maximal subsets is less than or equal to $ 2n.$

What is the number of ways you can choose two distinct integers $a$ and $b$ (unordered i.e. choosing $(a, b)$ is same as choosing $(b, a)$ from the set $\{1, 2, \cdots , 100\}$ such that difference between them is atmost 10, i.e. $|a-b|\leq 10$ [list=1] [*] ${{100}\choose{2}} -{{90}\choose{2}}$ [*] ${{100}\choose{2}} -90$ [*] ${{100}\choose{2}} -{{90}\choose{2}}-100$ [*] None of the above [/list]

[b]Problem 1. [/b]In the cells of square table are written the numbers $1$, $0$ or $-1$ so that in every line there is exactly one $1$, amd exactly one $-1$. Each turn we change the places of two columns or two rows. Is it possible, from any such table, after finite number of turns to obtain its opposite table (two tables are opposite if the sum of the numbers written in any two corresponding squares is zero)? [i] Emil Kolev[/i]

On a $100 \times 100$ chessboard, the plan is to place several $1 \times 3$ boards and $3 \times 1$ board, so that [list] [*] Each tile of the initial chessboard is covered by at most one small board. [*] The boards cover the entire chessboard tile, except for one tile. [*] The sides of the board are placed parallel to the chessboard. [/list] Suppose that to carry out the instructions above, it takes $H$ number of $1 \times 3$ boards and $V$ number of $3 \times 1$ boards. Determine all possible pairs of $(H,V)$. [i]Proposed by Muhammad Afifurrahman, Indonesia[/i]

Do there exist 2018 positive irreducible fractions, each with a different denominator, so that the denominator of the difference of any two (after reducing the fraction) is less than the denominator of any of the initial 2018 fractions? (6 points) Maxim Didin

Find the maximum number of parts into which the $Oxy$-plane can be divided by $100$ graphs of different quadratic functions of the form $y = ax^2 + bx + c$. (N.B. Vasiliev, Moscow)

Let $a_1, a_2, ..., a_n$ be positive integers, not necessarily distinct but with at least five distinct values. Suppose that for any $1 \le i < j \le n$, there exist $k,\ell$, both different from $i$ and $j$ such that $a_i + a_j = a_k + a_{\ell}$. What is the smallest possible value of $n$?

We have $2012$ sticks with integer length, and sum of length is $n$. We need to have sticks with lengths $1,2,....,2012$. For it we can break some sticks ( for example from stick with length $6$ we can get $1$ and $4$). For what minimal $n$ it is always possible?

Ryan Murphy is playing poker. He is dealt a hand of $5$ cards. Given that the probability that he has a straight hand (the ranks are all consecutive; e.g. $3,4,5,6,7$ or $9,10,J,Q,K$) or $3$ of a kind (at least $3$ cards of the same rank; e.g. $5, 5, 5, 7, 7$ or $5, 5, 5, 7,K$) is $m/n$ , where $m$ and $n$ are relatively prime positive integers, find $m +n$. [i]Proposed by Aditya Rao[/i]

Let a set $X$ be given which consists of $2 \cdot n$ distinct real numbers ($n \geq 3$). Consider a set $K$ consisting of some pairs $(x, y)$ of distinct numbers $x, y \in X$, satisfying the two conditions: [b]I.[/b] If $(x, y) \in K$ then $(y, x) \not \in K$. [b]II.[/b] Every number $x \in X$ belongs to at most 19 pairs of $K$. Show that we can divide the set $X$ into 5 non-empty disjoint sets $X_1, X_2, X_3, X_4, X_5$ in such a way that for each $i = 1, 2, 3, 4, 5$ the number of pairs $(x, y) \in K$ where $x, y$ both belong to $X_i$ is not greater than $3 \cdot n$.

Does there exist two unfair dices such that probability of their sum being $j$ be a number in $\left(\frac2{33},\frac4{33}\right)$ for each $2\leq j\leq 12$?

Let $x_1$ and $x_2$ be positive integers. On a straight line, $y_1$ white segments and $y_2$ black segments are given, with $y_1 \ge x_1$ and $y_2 \ge x_2$. Suppose that no two segments of the same colour intersect (and do not have common ends). Moreover, suppose that for any choice of $x_1$ white segments and $x_2$ black segments, some pair of selected segments will intersect. Prove that $(y_1-x_1)(y_2-x_2)<x_1x_2$. [i]Proposed by G. Chelnokov[/i]

Players $A$ and $B$ play the following game on the coordinate plane. Player $A$ hides a nut at one of the points with integer coordinates, and player $B$ tries to find this hidden nut. In one move $B$ can choose three different points with integer coordinates, then $A$ tells whether these three points together with the nut's point lie on the same circle or not. Can $B$ be guaranteed to find the nut in a finite number of moves?

Vaysha has a board with $999$ consecutive numbers written and $999$ labels of the form [i]"This number is [b]not [/b]divisible by $i$"[/i], for $i \in \{ 2,3, \dots ,1000 \} $. She places each label next to a number on the board, so that each number has exactly one label. For each true statement on the stickers, Vaysha gets a piece of candy. How many pieces of candy can Vaysha guarantee to win, regardless of the numbers written on the board, if she plays optimally?

Prove that all subsets of a finite set can be arranged in a sequence in which every two successive subsets differ in exactly one element.

Let $A$ be a nonempty set with $n$ elements. Find the number of ways of choosing a pair of subsets $(B,C)$ of $A$ such that $B$ is a nonempty subset of $C$.