Let $n$ be a positive integer. Each of the numbers $1,2,3,\ldots,100$ is painted with one of $n$ colors in such a way that two distinct numbers with a sum divisible by $4$ are painted with different colors. Determine the smallest value of $n$ for which such a situation is possible.

In preparation for a game of Fish, Carl must deal $48$ cards to $6$ players. For each card that he deals, he runs through the entirety of the following process: $1$. He gives a card to a random player. $2$. A player $Z$ is randomly chosen from the set of players who have at least as many cards as every other player (i.e. $Z$ has the most cards or is tied for having the most cards). $3$. A player $D$ is randomly chosen from the set of players other than $Z$ who have at most as many cards as every other player (i.e. $D$ has the fewest cards or is tied for having the fewest cards). $4$. $Z$ gives one card to $D$. He repeats steps $1-4$ for each card dealt, including the last card. After all the cards have been dealt, what is the probability that each player has exactly $8$ cards?

The dodo was a strange animal. As it has already become extinct, only conjectures can be made about its way of life. One of the most unique conjectures is linked to the way the dodo moved. It seems that an adult animal only moved by jumping, which could be of two types: type I: $1$ meter to the East and $3$ to the North; type II: $2$ meters to the West and $4$ to the South. a) Prove that it was possible for the diode to reach a point located $19$ meters to the East and $95$ to the North of it and determines the number of jumps for each type he needed to carry out. b) Prove that it was impossible for the diode to reach a point located $18$ meters to the East and $95$ meters to the North of it.

We choose a random permutation of $1,2,\ldots,n$ with uniform distribution. Prove that the expected value of the length of the longest increasing subsequence in the permutation is at least $\sqrt{n}.$

[b]p1.[/b] Solve the equation $x^2 - x - cos y+1.25 =0$. [b]p2.[/b] Solve the inequality: $\left| \frac{x - 2}{x - 3}\right| \le x$ [b]p3.[/b] Bilbo and Dwalin are seated at a round table of radius $R$. Bilbo places a coin of radius $r$ at the center of the table, then Dwalin places a second coin as near to the table’s center as possible without overlapping the first coin. The process continues with additional coins being placed as near as possible to the center of the table and in contact with as many coins as possible without overlap. The person who places the last coin entirely on the table (no overhang) wins the game. Assume that $R/r$ is an integer. (a) Who wins, Bilbo or Dawalin? Please justify your answer. (b) How many coins are on the table when the game ends? [b]p4.[/b] In the center of a square field is an orc. Four elf guards are on the vertices of that square. The orc can run in the field, the elves only along the sides of the square. Elves run $\$1.5$ times faster than the orc. The orc can kill one elf but cannot fight two of them at the same time. Prove that elves can keep the orc from escaping from the field. [b]p5.[/b] Nine straight roads cross the Mirkwood which is shaped like a square, with an area of $120$ square miles. Each road intersects two opposite sides of the square and divides the Mirkwood into two quadrilaterals of areas $40$ and $80$ square miles. Prove that there exists a point in the Mirkwood which is an intersection of at least three roads. PS. You should use hide for answers.

On the round necklace there are $n> 3$ beads, each painted in red or blue. If a bead has adjacent beads painted the same color, it can be repainted (from red to blue or from blue to red). For what $n$ for any initial coloring of beads it is possible to make a necklace in which all beads are painted equally?

There are $25$ students in Peter’s class (not counting him). Peter has observed that all $25$ have different numbers of friends in this class. How many friends does Peter have in this class? (Give all possible answers.) (S Toparev)

Given are $n$ different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points $A,B$.We consider $k$ distinct lines passing through $A$ and $m$ distinct lines passing through $B$.There is no line passing through both $A$ and $B$ and all the lines passing through $k$ intersect with all the lines passing through $B$.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.

The king have revised the chess-board $8\times 8$ having visited all the fields once only and returned to the starting point. When his trajectory was drawn (the centres of the squares were connected with the straight lines), a closed broken line without self-intersections appeared. a) Give an example that the king could make $28$ steps parallel the sides of the board only. b) Prove that he could not make less than $28$ such a steps. c) What is the maximal and minimal length of the broken line if the side of a field is $1$?

There is a row that consists of digits from $ 0$ to $ 9$ and Ukrainian letters (there are $ 33$ of them) with following properties: there aren’t two distinct digits or letters $ a_i$, $ a_j$ such that $ a_i > a_j$ and $ i < j$ (if $ a_i$, $ a_j$ are letters $ a_i > a_j$ means that $ a_i$ has greater then $ a_j$ position in alphabet) and there aren’t two equal consecutive symbols or two equal symbols having exactly one symbol between them. Find the greatest possible number of symbols in such row.

In a plane $5$ points are given such that all triangles having vertices at these points are of area not greater than $1$. Show that there exists a trapezoid which contains all point in the interior (or on the sides) and having the area not exceeding $3$.

A chord is drawn on a circle by choosing two points uniformly at random along its circumference. This is done two more times to obtain three total random chords. The circle is cut along these three lines, splitting it into pieces. The probability that one of the pieces is a triangle is $\frac{m}{n}$ , where $m$, $n$ are positive integers and gcd $(m,n) = 1$. Find $100m + n$.

An angle of size $n \times m$, where $m, n \ge 2$, is called a figure, resulting from a rectangle of size $n \times m$ cells by removing the rectangle size $(n - 1) \times (m - 1)$ cells. Two players take turns making moves consisting in painting in a corner an arbitrary non-zero number of cells forming a rectangle or square.

Let $n\ge5$ be an integer. A trapezoid with base lengths of $1$ and $r$ is tiled by $n$ (not necessarily congruent) equilateral triangles. In terms of $n$, find the maximum possible value of $r$. [i]Linus Tang[/i]

[u]Round 1[/u] [b]p1.[/b] Three two-digit numbers are written on a board. One starts with $5$, another with $6$, and the last one with $7$. Annie added the first and the second numbers; Benny added the second and the third numbers; Denny added the third and the first numbers. Could it be that one of these sums is equal to $148$, and the two other sums are three-digit numbers that both start with $12$? [b]p2.[/b] Three rocks, three seashells, and one pearl are placed in identical boxes on a circular plate in the order shown. The lids of the boxes are then closed, and the plate is secretly rotated. You can open one box at a time. What is the smallest number of boxes you need to open to know where the pearl is, no matter how the plate was rotated? [img]https://cdn.artofproblemsolving.com/attachments/0/2/6bb3a2a27f417a84ab9a64100b90b8768f7978.png[/img] [b]p3.[/b] Two detectives, Holmes and Watson, are hunting the thief Raffles in a library, which has the floorplan exactly as shown in the diagram. Holmes and Watson start from the center room marked $D$. Show that no matter where Raffles is or how he moves, Holmes and Watson can find him. Holmes and Watson do not need to stay together. A detective sees Raffles only if they are in the same room. A detective cannot stand in a doorway to see two rooms at the same time. [img]https://cdn.artofproblemsolving.com/attachments/c/1/6812f615e60a36aea922f145a1ffc470d0f1bc.png[/img] [b]p4.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken. [img]https://cdn.artofproblemsolving.com/attachments/4/6/bf0185e142cd3f653d4a9c0882d818c55c64e4.png[/img] [b]p5.[/b] The numbers $1–14$ are placed around a circle in some order. You can swap two neighbors if they differ by more than $1$. Is it always possible to rearrange the numbers using swaps so they are ordered clockwise from $1$ to $14$? [u]Round 2[/u] [b]p6.[/b] A triangulation of a regular polygon is a way of drawing line segments between its vertices so that no two segments cross, and the interior of the polygon is divided into triangles. A flip move erases a line segment between two triangles, creating a quadrilateral, and replaces it with the opposite diagonal through that quadrilateral. This results in a new triangulation. [img]https://cdn.artofproblemsolving.com/attachments/a/a/657a7cf2382bab4d03046075c6e128374c72d4.png[/img] Given any two triangulations of a polygon, is it always possible to find a sequence of flip moves that transforms the first one into the second one? [img]https://cdn.artofproblemsolving.com/attachments/0/9/d09a3be9a01610ffc85010d2ac2f5b93fab46a.png[/img] [b]p7.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9,..., 121)$ are in one column? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A cunning dragon guards a princess. To overcome the dragon and to win the princess you must solve the following task: The dragon has in some of the fields $i$ the columned hall (see figure) with the numbers $1-8$. Even in the rest of the fields you can place numbers $9-36$. The numbers $1-36$ must be arranged so that any turn that starts with one enters from either the south or the west, and ends up going out towards either the north or east, goes through at least one number from the $5$ table. (On the figure are north, south, east and west indicated by N, S, E and W). Georg wants to win the princess. Is it possible to be done? [img]https://cdn.artofproblemsolving.com/attachments/0/7/2ad1b7f944847ee6d3c614ea6c2656865808e7.png[/img]

Let $M$ denote the set of $m\times n$ matrices with entries in the set $\{0,1,2,3,4\}$ such that in each row and each column the sum of elements is divisible by $5$. Find the cardinality of set $M$.

There is convex $n-$gon. We color all its sides and also diagonals, that goes out from one vertex. So we have $2n-3$ colored segments. We write positive numbers on colored segments. In one move we can take quadrilateral $ABCD$ such, that $AC$ and all sides are colored, then remove $AC$ and color $BD$ with number $\frac{xz+yt}{w}$, where $x,y,z,t,w$ - numbers on $AB,BC,CD,DA,AC$. After some moves we found that all colored segments are same that was at beginning. Prove, that they have same number that was at beginning.

What is the minimum number of squares that is necessary to draw on a white sheet to obtain a square grid of side $n$?

Arutyun and Amayak show another effective trick. A spectator writes down on a board a sequence of $N$ (decimal) digits. Amayak closes two adjacent digits by a black disc. Then Arutyun comes and says both closed digits (and their order). For which minimal $N$ they may show such a trick? [i]K. Knop, O. Leontieva[/i]

For which $n \in N$ is it possible to arrange a tennis tournament for doubles with $n$ players such that each player has every other player as an opponent exactly once?

Along a circle-shaped path are $100$ boys and $100$ girls. The distance between two points on the path is defined as the length of the smaller arc through which it is possible to get from one point to the other. Prove that the sum of distances between pairs of the same gender is always less than or equal to the sum of distances between all pairs of a boy and a girl.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Let $ k\geq 1 $ and let $ I_{1},\dots, I_{k} $ be non-degenerate subintervals of the interval $ [0, 1] $. Prove that \[ \sum \frac{1}{\left | I_{i}\cup I_{j} \right |} \geq k^{2} \] where the summation is over all pairs $ (i, j) $ of indices such that $I_i\cap I_j\neq \emptyset$.

Let $n$ be a positive integer. Determine the size of the largest subset of $\{ -n, -n+1, \dots, n-1, n\}$ which does not contain three elements $a$, $b$, $c$ (not necessarily distinct) satisfying $a+b+c=0$.