$a)$ Is it possible, on modified chessboard $20 \times 30$, to draw a line which cuts exactly $50$ cells where chessboard cells are squares $1 \times 1$ $b)$ What is the maximum number of cells which line can cut on chessboard $m \times n$, $m,n \in \mathbb{N}$

The integers $ 1,2,\dots,20$ are written on the blackboard. Consider the following operation as one step: [i]choose two integers $ a$ and $ b$ such that $ a\minus{}b \ge 2$ and replace them with $ a\minus{}1$ and $ b\plus{}1$[/i]. Please, determine the maximum number of steps that can be done. [i]Yudi Satria, Jakarta[/i]

A game is played on a $n \times n$ chessboard. In the beginning Bars the cat occupies any cell according to his choice. The $d$ sparrows land on certain cells according to their choice (several sparrows may land in the same cell). Bars and the sparrows play in turns. In each turn of Bars, he moves to a cell adjacent by a side or a vertex (like a king in chess). In each turn of the sparrows, precisely one of the sparrows flies from its current cell to any other cell of his choice. The goal of Bars is to get to a cell containing a sparrow. Can Bars achieve his goal a) if $d=\lfloor \frac{3\cdot n^2}{25}\rfloor$, assuming $n$ is large enough? b) if $d=\lfloor \frac{3\cdot n^2}{19}\rfloor$, assuming $n$ is large enough? c) if $d=\lfloor \frac{3\cdot n^2}{14}\rfloor$, assuming $n$ is large enough?

Sixteen chairs are arranged in a row. Eight people each select a chair in which to sit so that no person sits next to two other people. Let $N$ be the number of subsets of $16$ chairs that could be selected. Find the remainder when $N$ is divided by $1000$.

In a room, there are $100$ light switches, labeled with the positive integers ${1,2, . . . ,100}$. They’re all initially turned off. On the $i$ th day for $1 \le i \le 100$, Bob flips every light switch with label number $k$ divisible by $i$ a total of $\frac{k}{i}$ times. Find the sum of the labels of the light switches that are turned on at the end of the $100$th day.

Let $ n, k \in \mathbb{N}$ with $ 1 \leq k \leq \frac {n}{2} - 1.$ There are $ n$ points given on a circle. Arbitrarily we select $ nk + 1$ chords among the points on the circle. Prove that of these chords there are at least $ k + 1$ chords which pairwise do not have a point in common.

Find all possible arrangements of $4$ points on a plane, so that the distance between each pair of points is equal to either $a$ or $b$. For what ratios of $a : b$ are such arrangements possible?

A social club has $101$ members, each of whom is fluent in the same $50$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.

A research facility has $60$ rooms, numbered $1, 2, \dots 60$, arranged in a circle. The entrance is in room $1$ and the exit is in room $60$, and there are no other ways in and out of the facility. Each room, except for room $60$, has a teleporter equipped with an integer instruction $1 \leq i < 60$ such that it teleports a passenger exactly $i$ rooms clockwise. On Monday, a researcher generates a random permutation of $1, 2, \dots, 60$ such that $1$ is the first integer in the permutation and $60$ is the last. Then, she configures the teleporters in the facility such that the rooms will be visited in the order of the permutation. On Tuesday, however, a cyber criminal hacks into a randomly chosen teleporter, and he reconfigures its instruction by choosing a random integer $1 \leq j' < 60$ such that the hacked teleporter now teleports a passenger exactly $j'$ rooms clockwise (note that it is possible, albeit unlikely, that the hacked teleporter's instruction remains unchanged from Monday). This is a problem, since it is possible for the researcher, if she were to enter the facility, to be trapped in an endless \say{cycle} of rooms. The probability that the researcher will be unable to exit the facility after entering in room $1$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

A set of $1985$ points is distributed around the circumference of a circle and each of the points is marked with $1$ or $-1$. A point is called “good” if the partial sums that can be formed by starting at that point and proceeding around the circle for any distance in either direction are all strictly positive. Show that if the number of points marked with $-1$ is less than $662$, there must be at least one good point.

Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]

The numbers $1, 2, \ldots, n$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number remains. Prove that this number is at least $\frac{4}{9}n^3$. [i]Brian Hamrick.[/i]

There are $n$ bus stops placed around the circular lake. Each bus stop is connected by a road to the two adjacent stops (we call a [i]segment [/i] the entire road between two stops). Determine the number of bus routes that start and end in the fixed bus stop A, pass through each bus stop at least once and travel through exactly $n+1$ [i]segments[/i].

Let $p\ge5$ be a prime and let $r$ be the number of ways of placing $p$ checkers on a $p\times p$ checkerboard so that not all checkers are in the same row (but they may all be in the same column). Show that $r$ is divisible by $p^5$. Here, we assume that all the checkers are identical.

Let $\mathcal{F}$ be the set of all the functions $f : \mathcal{P}(S) \longrightarrow \mathbb{R}$ such that for all $X, Y \subseteq S$, we have $f(X \cap Y) = \min (f(X), f(Y))$, where $S$ is a finite set (and $\mathcal{P}(S)$ is the set of its subsets). Find \[\max_{f \in \mathcal{F}}| \textrm{Im}(f) |. \]

A [i]cross [/i] is the figure composed of $6$ unit squares shown below (and any figure made of it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/6/0/6d4e0579d2e4c4fa67fd1219837576189ec9cb.png[/img] Find the greatest number of crosses that can be cut from a $6 \times 11$ divided sheet of paper into unit squares (in such a way that each cross consists of six such squares).

In a sports meeting a total of $m$ medals were awarded over $n$ days. On the first day one medal and $\frac{1}{7}$ of the remaining medals were awarded. On the second day two medals and $\frac{1}{7}$ of the remaining medals were awarded, and so on. On the last day, the remaining $n$ medals were awarded. How many medals did the meeting last, and what was the total number of medals ?

Given an array of numbers $A = (672, 673, 674, ..., 2016)$ on table. Three arbitrary numbers $a,b,c \in A$ are step by step replaced by number $\frac13 min(a,b,c)$. After $672$ times, on the table there is only one number $m$, such that (A): $0 < m < 1$ (B): $m = 1$ (C): $1 < m < 2$ (D): $m = 2$ (E): None of the above.

There are 10 stones of different weights with distinct pairwise sums. We have a special two-tiered balance scale such that only two stones can be put on each cup and then we understand which cup is heavier. Prove that having this scale you can either find the heaviest or the lightest stone.

The points inside a circle \( \Gamma \) are painted with \( n \geq 1 \) colors. A color is said to be dense in a circle \( \Omega \) if every circle contained within \( \Omega \) has points of that color in its interior. Prove that there exists at least one color that is dense in some circle contained within \( \Gamma \).

Let $x_1, x_2 \ldots , x_5$ be real numbers. Find the least positive integer $n$ with the following property: if some $n$ distinct sums of the form $x_p+x_q+x_r$ (with $1\le p<q<r\le 5$) are equal to $0$, then $x_1=x_2=\cdots=x_5=0$.

On each vertex of a regular $ n\minus{}$gon there was a crow. Call this as initial configuration. At a signal, they all flew by and after a while, those $ n$ crows came back to the $ n\minus{}$gon, one crow for each vertex. Call this as final configuration. Determine all $ n$ such that: there are always three crows such that the triangle they formed in the initial configuration and the triangle they formed in the final configuration are both right-angled triangle.

Find the maximal number of edges a connected graph $G$ with $n$ vertices may have, so that after deleting an arbitrary cycle, $G$ is not connected anymore.

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

Let $n$ be an odd integer greater than 1 and let $c_1, c_2, \ldots, c_n$ be integers. For each permutation $a = (a_1, a_2, \ldots, a_n)$ of $\{1,2,\ldots,n\}$, define $S(a) = \sum_{i=1}^n c_i a_i$. Prove that there exist permutations $a \neq b$ of $\{1,2,\ldots,n\}$ such that $n!$ is a divisor of $S(a)-S(b)$.