Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

Ana and Beatriz take turns in a game that starts with a square of side $1$ drawn on an infinite grid. Each turn consists of drawing a square that does not overlap with the rectangle already drawn, in such a way that one of its sides is a (complete) side of the figure already drawn. A player wins if she completes a rectangle whose area is a multiple of $5$. If Ana goes first, does either player have a winning strategy?

We will call a pair of positive integers $(n, k)$ with $k > 1$ a $lovely$ $couple$ if there exists a table $nxn$ consisting of ones and zeros with following properties: • In every row there are exactly $k$ ones. • For each two rows there is exactly one column such that on both intersections of that column with the mentioned rows, number one is written. Solve the following subproblems: a) Let $d \neq 1$ be a divisor of $n$. Determine all remainders that $d$ can give when divided by $6$. b) Prove that there exist infinitely many lovely couples. Proposed by Miroslav Marinov, Daniel Atanasov

Let $n\ge 16$ be an integer, and consider the set of $n^2$ points in the plane: \[ G=\big\{(x,y)\mid x,y\in\{1,2,\ldots,n\}\big\}.\] Let $A$ be a subset of $G$ with at least $4n\sqrt{n}$ elements. Prove that there are at least $n^2$ convex quadrilaterals whose vertices are in $A$ and all of whose diagonals pass through a fixed point.

Let $n$ and $k$ be positive integers and let $$T = \{ (x,y,z) \in \mathbb{N}^3 \mid 1 \leq x,y,z \leq n \}$$ be the length $n$ lattice cube. Suppose that $3n^2 - 3n + 1 + k$ points of $T$ are colored red such that if $P$ and $Q$ are red points and $PQ$ is parallel to one of the coordinate axes, then the whole line segment $PQ$ consists of only red points. Prove that there exists at least $k$ unit cubes of length $1$, all of whose vertices are colored red.

Let $n \ge 2$ be an integer. Consider an $n \times n$ chessboard consisting of $n^2$ unit squares. A configuration of $n$ rooks on this board is [i]peaceful[/i] if every row and every column contains exactly one rook. Find the greatest positive integer $k$ such that, for each peaceful configuration of $n$ rooks, there is a $k \times k$ square which does not contain a rook on any of its $k^2$ unit squares.

Baron and Peter are playing a game. They are given a simple finite graph $G$ with $n\ge 3$ vertex and $k$ edges that connects the vertices. First Peter labels two vertices A and B, and places a counter at A. Baron starts first. A move for Baron is move the counter along an edge. Peter's move is to remove an edge from the graph. Baron wins if he reaches $B$, otherwise Peter wins. Given the value of $n$, what is the largest $k$ so that Peter can always win?

In Wonderland, the towns are connected by roads, and whenever there is a direct road between two towns there is also a route between these two towns that does not use that road. (There is at most one direct road between any two towns.) The Queen of Hearts ordered the Spades to provide a list of all ”even” subsystems of the system of roads, that is, systems formed by subsets of the set of roads, where each town is connected to an even number of roads (possibly none). For each such subsystem they should list its roads. If there are totally $n$ roads in Wonderland and $x$ subsystems on the Spades’ list, what is the number of roads on their list when each road is counted as many times as it is listed?

Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher. It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.

[b]p1.[/b] Compute the sum of sharp angles at all five nodes of the star below. ( [url=http://www.math.msu.edu/~mshapiro/NewOlympiad/Olymp2009/10_12_2009.pdf]figure missing[/url] ) [b]p2.[/b] Arrange the integers from $1$ to $15$ in a row so that the sum of any two consecutive numbers is a perfect square. In how many ways this can be done? [b]p3.[/b] Prove that if $p$ and $q$ are prime numbers which are greater than $3$ then $p^2 -q^2$ is divisible by $ 24$. [b]p4.[/b] A city in a country is called Large Northern if comparing to any other city of the country it is either larger or farther to the North (or both). Similarly, a city is called Small Southern. We know that in the country all cities are Large Northern city. Show that all the cities in this country are simultaneously Small Southern. [b]p5.[/b] You have four tall and thin glasses of cylindrical form. Place on the flat table these four glasses in such a way that all distances between any pair of centers of the glasses' bottoms are equal. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Adithya and Bill are playing a game on a connected graph with $n > 2$ vertices, two of which are labeled $A$ and $B$, so that $A$ and $B$ are distinct and non-adjacent and known to both players. Adithya starts on vertex $A$ and Bill starts on $B$. Each turn, both players move simultaneously: Bill moves to an adjacent vertex, while Adithya may either move to an adjacent vertex or stay at his current vertex. Adithya loses if he is on the same vertex as Bill, and wins if he reaches $B$ alone. Adithya cannot see where Bill is, but Bill can see where Adithya is. Given that Adithya has a winning strategy, what is the maximum possible number of edges the graph may have? (Your answer may be in terms of $n$.) [i]Proposed by Steven Liu[/i]

Assume that $ S\equal{}(a_1, a_2, \cdots, a_n)$ consists of $ 0$ and $ 1$ and is the longest sequence of number, which satisfies the following condition: Every two sections of successive $ 5$ terms in the sequence of numbers $ S$ are different, i.e., for arbitrary $ 1\le i<j\le n\minus{}4$, $ (a_i, a_{i\plus{}1}, a_{i\plus{}2}, a_{i\plus{}3}, a_{i\plus{}4})$ and $ (a_j, a_{j\plus{}1}, a_{j\plus{}2}, a_{j\plus{}3}, a_{j\plus{}4})$ are different. Prove that the first four terms and the last four terms in the sequence are the same.

Two runners start running along a circular track of unit length from the same starting point and int he same sense, with constant speeds $v_1$ and $v_2$ respectively, where $v_1$ and $v_2$ are two distinct relatively prime natural numbers. They continue running till they simultneously reach the starting point. Prove that (a) at any given time $t$, at least one of the runners is at a distance not more than $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units from the starting point. (b) there is a time $t$ such that both the runners are at least $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units away from the starting point. (All disstances are measured along the track). $[x]$ is the greatest integer function.

Given a set $A$ which contains $n$ elements. For any two distinct subsets $A_{1}$, $A_{2}$ of the given set $A$, we fix the number of elements of $A_1 \cap A_2$. Find the sum of all the numbers obtained in the described way.

In a village with at least one inhabitant, there are several associations. Each inhabitant is a member of at least $ k$ associations, and any two associations have at most one common member. Prove that at least $ k$ associations have the same number of members.

In the $n \times n$ table in every cell there is one child. Every child looks in neigbour cell. So every child sees ear or back of the head of neighbour. What is minimal number children, that see ear ?

Let $n\ge 3$ be an integer. Two players, Ana and Beto, play the following game. Ana tags the vertices of a regular $n$- gon with the numbers from $1$ to $n$, in any order she wants. Every vertex must be tagged with a different number. Then, we place a turkey in each of the $n$ vertices. These turkeys are trained for the following. If Beto whistles, each turkey moves to the adjacent vertex with greater tag. If Beto claps, each turkey moves to the adjacent vertex with lower tag. Beto wins if, after some number of whistles and claps, he gets to move all the turkeys to the same vertex. Ana wins if she can tag the vertices so that Beto can't do this. For each $n\ge 3$, determine which player has a winning strategy. [i]Proposed by Victor and Isaías de la Fuente[/i]

Eight students were asked to solve $8$ problems (the same set of problems for each of the students). (a) Each problem was solved by $5$ students. Prove that one canfind two students so that each of the problems was solved by at least one of them. (b) If each problem was solved by $4$ students, then it is possible that no such pair of students exists. Prove this. (S Tokarev)

There are five dots arranged in a line from left to right. Each of the dots is colored from one of five colors so that no $3$ consecutive dots are all the same color. How many ways are there to color the dots?

On the board, we write the integers $1, 2, 3, \dots, 2019$. At each minute, we pick two numbers on the board $a$ and $b$, delete them, and write down the number $s(a + b)$ instead, where $s(n)$ denotes the sum of the digits of the integer $n$. Let $N$ be the last number on the board at the end. [list=a] [*] Is it possible to get $N = 19$? [*] Is it possible to get $N = 15$? [/list]

Let $A_{n,k}$ denote the set of lattice paths in the coordinate plane of upsteps $u=[1,1]$, downsteps $d=[1,-1]$, and flatsteps $f=[1,0]$ that contain $n$ steps, $k$ of which are slanted ($u$ or $d$). A sharp turn is a consecutive pair of $ud$ or $du$. Let $B_{n,k}$ denote the set of paths in $A_{n,k}$ with no upsteps among the first $k-1$ steps, and let $C_{n,k}$ denote the set of paths in $A_{n,k}$ with no sharps anywhere. For example, $fdu$ is in $B_{3,2}$ but not in $C_{3,2}$, while $ufd$ is in $C_{3,2}$ but not $B_{3,2}$. For $1 \le k \le n$, prove that the sets $B_{n,k}$ and $C_{n,k}$ contains the same number of elements.

Let $N$ be a positive integer. A collection of $4N^2$ unit tiles with two segments drawn on them as shown is assembled into a $2N\times2N$ board. Tiles can be rotated. [asy]size(1.5cm);draw((0,0)--(1,0)--(1,1)--(0,1)--cycle);draw((0,0.5)--(0.5,0),red);draw((0.5,1)--(1,0.5),red);[/asy] The segments on the tiles define paths on the board. Determine the least possible number and the largest possible number of such paths. [i]For example, there are $9$ paths on the $4\times4$ board shown below.[/i] [asy]size(4cm);draw((0,0)--(4,0)--(4,4)--(0,4)--cycle);draw((0,1)--(4,1));draw((0,2)--(4,2));draw((0,3)--(4,3));draw((1,0)--(1,4));draw((2,0)--(2,4));draw((3,0)--(3,4));draw((0,3.5)--(0.5,4),red);draw((0,2.5)--(1.5,4),red);draw((3.5,0)--(4,0.5),red);draw((2.5,0)--(4,1.5),red);draw((0.5,0)--(0,0.5),red);draw((2.5,4)--(3,3.5)--(3.5,4),red);draw((4,3.5)--(3.5,3)--(4,2.5),red);draw((0,1.5)--(1,2.5)--(1.5,2)--(0.5,1)--(1.5,0),red);draw((1.5,3)--(2,3.5)--(3.5,2)--(2,0.5)--(1.5,1)--(2.5,2)--cycle,red);[/asy]

There are $100$ random, distinct real numbers corresponding to $100$ points on a circle. Prove that you can always choose $4$ consecutive points in such a way that the sum of the two numbers corresponding to the points on the outside is always greater than the sum of the two numbers corresponding to the two points on the inside.

A family wears clothes of three colors: red,blue and green,with a separate,identical laundry bin for each color. At the beginning of the first week,all bins are empty.Each week,the family generates a total of $10 kg $ of laundry(the proportion of each color is subject to variation).The laundry is sorted by color and placed in the bins.Next,the heaviest bin(only one of them,if there are several that are heaviest)is emptied and its content swashed.What is the minimal possible storing capacity required of the laundry bins in order for them never to overflow?

Prove that for any integer $n\ge 6$ we can divide an equilateral triangle completely into $n$ smaller equilateral triangles.