Let $M$ be a set of $n \ge 4$ points in the plane, no three of which are collinear. Initially these points are connected with $n$ segments so that each point in $M$ is the endpoint of exactly two segments. Then, at each step, one may choose two segments $AB$ and $CD$ sharing a common interior point and replace them by the segments $AC$ and $BD$ if none of them is present at this moment. Prove that it is impossible to perform $n^3 /4$ or more such moves. [i]Proposed by Vladislav Volkov, Russia[/i]

Let $A$ be the product of all positive integers less than $1000$ whose ones or hundreds digit is $7$. Compute the remainder when $A/101$ is divided by $101$.

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

$n$ distinct integers are given, all of which are bigger than $-a$, where $a$ is a positive integer. It turned out that the amount of odd numbers among them is equal to the biggest even number, and the amount of even numbers is equal to the biggest odd numbers a) Find the least possible value of $n$ for all $a$ b) For each $a \geq 2$ find the maximum possible value of $n$

Given an $m \times n$ table consisting of $mn$ unit cells. Alice and Bob play the following game: Alice goes first and the one who moves colors one of the empty cells with one of the given three colors. Alice wins if there is a figure, such as the ones below, having three different colors. Otherwise Bob is the winner. Determine the winner for all cases of $m$ and $n$ where $m, n \ge 3$. Proposed by [i]Toghrul Abbasov, Azerbaijan[/i]

A square grid is composed of $ n^2\equiv 1\pmod 4 $ unit cells that contained each a locust that jumped the same amount of cells in the direccion of columns or lines, without leaving the grid. Prove that, as a result of this, at least two locusts landed on the same cell. [i]Marius Cavachi[/i]

Let $n$ be a natural number. Determine the minimal number of equilateral triangles of side $1$ to cover the surface of an equilateral triangle of side $n +\frac{1}{2n}$.

There are $11$ phrases written on $11$ pieces of paper (one per sheet): 1) To the left of this sheet there are no sheets with false statements. 2) Exactly one sheet to the left of this one contains a false statement. 3) Exactly $2$ sheets to the left of this one contain false statements ... 11) Exactly $10$ sheets to the left of this one contain false statements. The sheets of paper were laid out in some order in a row, going from left to right. After this, some of the written statements became true and some became false. What is the greatest possible number of true statements?

There are $2003$ pieces of candy on a table. Two players alternately make moves. A move consists of eating one candy or half of the candies on the table (the “lesser half” if there are an odd number of candies). At least one candy must be eaten at each move. The loser is the one who eats the last candy. Which player has a winning strategy?

Let $S=\{1, 2, 3, \dots 2021\}$ and $f:S \to S$ be a function such that $f^{(n)}(n)=n$ for each $n \in S$. Find all possible values for $f(2021)$. (Here, $f^{(n)}(n) = \underbrace{f(f(f\dots f(}_{n \text{ times} }n)))\dots))$.) [i]Authored by Viktor Simjanoski[/i]

Annie stands at one vertex of a regular hexagon. Every second, she moves independently to one of the two vertices adjacent to her, each with equal probability. Determine the probability that she is at her starting position after ten seconds.

Let $D$ be an infinite (in one direction) sequence of zeros and ones. For each $n\in\mathbb{N}$, let $a_n$ denote the number of distinct subsequences of consecutive symbols in $D$ of length $n$. Does there exist a sequence $D$ for which the inequality \[ \left|\frac{a_n}{n\log_2 n} - 1\right| < \frac{1}{100} \] is satisfied for every natural number $n > 10^{10000}$?

Each side face of a regular hexagonal prism is colored in one of three colors (for example, red, yellow, blue), and the adjacent prism faces have different colors. In how many different ways can the edges of the prism be colored (using all three colors is optional)?

Call a set of $n$ lines [i]good[/i] if no $3$ lines are concurrent. These $n$ lines divide the Euclidean plane into regions (possible unbounded). A [i]coloring[/i] is an assignment of two colors to each region, one from the set $\{A_1, A_2\}$ and the other from $\{B_1, B_2, B_3\}$, such that no two adjacent regions (adjacent meaning sharing an edge) have the same $A_i$ color or the same $B_i$ color, and there is a region colored $A_i, B_j$ for any combination of $A_i, B_j$. A number $n$ is [i]colourable[/i] if there is a coloring for any set of $n$ good lines. Find all colourable $n$.

In two neigbouring cells(dimensions $1\times 1$) of square table $10\times 10$ there is hidden treasure. John needs to guess these cells. In one $\textit{move}$ he can choose some cell of the table and can get information whether there is treasure in it or not. Determine minimal number of $\textit{move}$'s, with properly strategy, that always allows John to find cells in which is treasure hidden.

Let $X$ be a set with $n\ge 2$ elements. Define $\mathcal{P}(X)$ to be the set of all subsets of $X$. Find the number of functions $f:\mathcal{P}(X)\mapsto \mathcal{P}(X)$ such that $$|f(A)\cap f(B)|=|A\cap B|$$ whenever $A$ and $B$ are two distinct subsets of $X$. [i] (Sergiu Novac)[/i]

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$.

The integer lattice in the plane is colored with 3 colors. Find the least positive real $S$ with the property: for any such coloring it is possible to find a monochromatic lattice points $A,B,C$ with $S_{\triangle ABC}=S$. [i]Proposed by Nikolay Beluhov[/i] EDIT: It was the problem 3 (not 2), corrected the source title.

Of the $9$ people who reached the final stage of the competition, only $4$ should receive a prize. The candidates were renumbered and lined up in a circle. Then a certain number $m$ (possibly greater than $9$) and the direction of reference were determined. People began to be counted, starting from the first. Each one became a winner and was eliminated from the drawing, and counting, starting from the next, continued until four winners were identified. The first three prizes were awarded to three people who had numbers $2$, $7$ and $5$ in the original lineup (they were eliminated in that order). What number did the fourth winner of the competition have in the initial lineup?

Each square on a $ n \times n$ board, with $n \ge 3$, is colored with one of $ 8$ colors. For what values of $n$ it can be said that some of these figures included in the board, does it contain two squares of the same color. [img]https://cdn.artofproblemsolving.com/attachments/3/9/6af58460585772f39dd9e8ef1a2d9f37521317.png[/img]

Let $k\ge 1$ be an integer and $\mathsf S$ be a family of 2-element subsets of the index set $\{1,\ldots,2k\}$ with the following property: if $\mathsf M_1,\ldots,\mathsf M_{2k}$ are arbitrary sets such that \[\mathsf M_i\cap\mathsf M_j\neq\emptyset\quad\Leftrightarrow\quad\{i,j\}\in\mathsf S,\] then the union $\mathsf M_1\cup\ldots\cup\mathsf M_{2k}$ contains at least $k^2$ elements. Show that there is a suitable family $\mathsf S$ for any integer $k\ge1.$

A regular hexagon is split into $6$ congruent equilateral triangles by drawing in the $3$ main diagonals. Each triangle is colored $1$ of $4$ distinct colors. Rotations and reflections of the figure are considered nondistinct. Find the number of possible distinct colorings.

[b]p1.[/b] Find the number of zeroes at the end of $20^{17}$. [b]p2.[/b] Express $\frac{1}{\sqrt{20} +\sqrt{17}}$ in simplest radical form. [b]p3.[/b] John draws a square $ABCD$. On side $AB$ he draws point $P$ so that $\frac{BP}{PA}=\frac{1}{20}$ and on side $BC$ he draws point $Q$ such that $\frac{BQ}{QC}=\frac{1}{17}$ . What is the ratio of the area of $\vartriangle PBQ$ to the area of $ABCD$? [b]p4.[/b] Alfred, Bill, Clara, David, and Emily are sitting in a row of five seats at a movie theater. Alfred and Bill don’t want to sit next to each other, and David and Emily have to sit next to each other. How many arrangements can they sit in that satisfy these constraints? [b]p5.[/b] Alex is playing a game with an unfair coin which has a $\frac15$ chance of flipping heads and a $\frac45$ chance of flipping tails. He flips the coin three times and wins if he flipped at least one head and one tail. What is the probability that Alex wins? [b]p6.[/b] Positive two-digit number $\overline{ab}$ has $8$ divisors. Find the number of divisors of the four-digit number $\overline{abab}$. [b]p7.[/b] Call a positive integer $n$ diagonal if the number of diagonals of a convex $n$-gon is a multiple of the number of sides. Find the number of diagonal positive integers less than or equal to $2017$. [b]p8.[/b] There are $4$ houses on a street, with $2$ on each side, and each house can be colored one of 5 different colors. Find the number of ways that the houses can be painted such that no two houses on the same side of the street are the same color and not all the houses are different colors. [b]p9.[/b] Compute $$|2017 -|2016| -|2015-| ... |3-|2-1|| ...||||.$$ [b]p10.[/b] Given points $A,B$ in the coordinate plane, let $A \oplus B$ be the unique point $C$ such that $\overline{AC}$ is parallel to the $x$-axis and $\overline{BC}$ is parallel to the $y$-axis. Find the point $(x, y)$ such that $((x, y) \oplus (0, 1)) \oplus (1,0) = (2016,2017) \oplus (x, y)$. [b]p11.[/b] In the following subtraction problem, different letters represent different nonzero digits. $\begin{tabular}{ccccc} & M & A & T & H \\ - & & H & A & M \\ \hline & & L & M & T \\ \end{tabular}$ How many ways can the letters be assigned values to satisfy the subtraction problem? [b]p12.[/b] If $m$ and $n$ are integers such that $17n +20m = 2017$, then what is the minimum possible value of $|m-n|$? [b]p13. [/b]Let $f(x)=x^4-3x^3+2x^2+7x-9$. For some complex numbers $a,b,c,d$, it is true that $f (x) = (x^2+ax+b)(x^2+cx +d)$ for all complex numbers $x$. Find $\frac{a}{b}+ \frac{c}{d}$. [b]p14.[/b] A positive integer is called an imposter if it can be expressed in the form $2^a +2^b$ where $a,b$ are non-negative integers and $a \ne b$. How many almost positive integers less than $2017$ are imposters? [b]p15.[/b] Evaluate the infinite sum $$\sum^{\infty}_{n=1} \frac{n(n +1)}{2^{n+1}}=\frac12 +\frac34+\frac68+\frac{10}{16}+\frac{15}{32}+...$$ [b]p16.[/b] Each face of a regular tetrahedron is colored either red, green, or blue, each with probability $\frac13$ . What is the probability that the tetrahedron can be placed with one face down on a table such that each of the three visible faces are either all the same color or all different colors? [b]p17.[/b] Let $(k,\sqrt{k})$ be the point on the graph of $y=\sqrt{x}$ that is closest to the point $(2017,0)$. Find $k$. [b]p18.[/b] Alice is going to place $2016$ rooks on a $2016 \times 2016$ chessboard where both the rows and columns are labelled $1$ to $2016$; the rooks are placed so that no two rooks are in the same row or the same column. The value of a square is the sum of its row number and column number. The score of an arrangement of rooks is the sumof the values of all the occupied squares. Find the average score over all valid configurations. [b]p19.[/b] Let $f (n)$ be a function defined recursively across the natural numbers such that $f (1) = 1$ and $f (n) = n^{f (n-1)}$. Find the sum of all positive divisors less than or equal to $15$ of the number $f (7)-1$. [b]p20.[/b] Find the number of ordered pairs of positive integers $(m,n)$ that satisfy $$gcd \,(m,n)+ lcm \,(m,n) = 2017.$$ [b]p21.[/b] Let $\vartriangle ABC$ be a triangle. Let $M$ be the midpoint of $AB$ and let $P$ be the projection of $A$ onto $BC$. If $AB = 20$, and $BC = MC = 17$, compute $BP$. [b]p22.[/b] For positive integers $n$, define the odd parent function, denoted $op(n)$, to be the greatest positive odd divisor of $n$. For example, $op(4) = 1$, $op(5) = 5$, and $op(6) =3$. Find $\sum^{256}_{i=1}op(i).$ [b]p23.[/b] Suppose $\vartriangle ABC$ has sidelengths $AB = 20$ and $AC = 17$. Let $X$ be a point inside $\vartriangle ABC$ such that $BX \perp CX$ and $AX \perp BC$. If $|BX^4 -CX^4|= 2017$, the compute the length of side $BC$. [b]p24.[/b] How many ways can some squares be colored black in a $6 \times 6$ grid of squares such that each row and each column contain exactly two colored squares? Rotations and reflections of the same coloring are considered distinct. [b]p25.[/b] Let $ABCD$ be a convex quadrilateral with $AB = BC = 2$, $AD = 4$, and $\angle ABC = 120^o$. Let $M$ be the midpoint of $BD$. If $\angle AMC = 90^o$, find the length of segment $CD$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In certain country, the coins have the following values: $2^0, 2^1, 2^2,\dots 2^{10}$. A cash machine has $1000$ coins of each value and give the money using each coin(of each value) at most once. The customers order all the positive integers: $1,2,3,4,5,\dots$ (in this order) in coins. a) Determine the first integer, such that the cash machine cannot provide. b) In the moment that the first customer can not be attended, by the lack of coins, what are the coins which are not available in the cash machine?

Let $G$ be a graph on $n\geq 6$ vertices and every vertex is of degree at least 3. If $C_{1}, C_{2}, \dots, C_{k}$ are all the cycles in $G$, determine all possible values of $\gcd(|C_{1}|, |C_{2}|, \dots, |C_{k}|)$ where $|C|$ denotes the number of vertices in the cycle $C$.