Let $P =\{(a, b) / a, b \in \{1, 2, ..., n\}, n \in N\}$ be a set of point of the Cartesian plane and draw horizontal, vertical, or diagonal segments, of length $1$ or $\sqrt 2$, so that both ends of the segment are in $P$ and do not intersect each other. Furthermore, for each point $(a, b)$ it is true that i) if $a + b$ is a multiple of $3$, then it is an endpoint of exactly $3$ segments. ii) if $a + b$ is an even not multiple of $3$, then it is an endpoint of exactly $2$ segments. iii) if $a + b$ is an odd not multiple of $3$, then it is endpoint of exactly $1$ segment. a) Check that with $n = 6$ it is possible to satisfy all the conditions. b) Show that with $n = 2015$ it is not possible to satisfy all the conditions.

each cells in a $9\times 9 $ grid is painted either blue or red.two cells are called [i]diagonal neighbors[/i] if their intersection is exactly a point.show that some cell has exactly two red neighbors,or exactly two blue neighbors, or both.

In the cartesian plane consider rectangles with sides parallel to the coordinate axes. We say that one rectangle is [i]below[/i] another rectangle if there is a line $g$ parallel to the $x$-axis such that the first rectangle is below $g$, the second one above $g$ and both rectangles do not touch $g$. Similarly, we say that one rectangle is [i]to the right of[/i] another rectangle if there is a line $h$ parallel to the $y$-axis such that the first rectangle is to the right of $h$, the second one to the left of $h$ and both rectangles do not touch $h$. Show that any finite set of $n$ pairwise disjoint rectangles with sides parallel to the coordinate axes can be enumerated as a sequence $(R_1,\dots,R_n)$ so that for all indices $i,j$ with $1 \le i<j \le n$ the rectangle $R_i$ is to the right of or below the rectangle $R_j$

Let a regular polygon with $p$ vertices be given, where $p$ is an odd prime number. At every vertex there is one monkey. An owner of monkeys takes $p$ peanuts, goes along the perimeter of polygon clockwise and delivers to the monkeys by the following rule: Gives the first peanut for the leader, skips the two next vertices and gives the second peanut to the monkey at the next vertex; skip four next vertices gives the second peanut for the monkey at the next vertex ... after giving the $k$-th peanut, he skips the $2 \cdot k$ next vertices and gives $k+1$-th for the monkey at the next vertex. He does so until all $p$ peanuts are delivered. [b]I.[/b] How many monkeys are there which does not receive peanuts? [b]II.[/b] How many edges of polygon are there which satisfying condition: both two monkey at its vertex received peanut(s)?

A square of $3 \times 3$ is subdivided into 9 small squares of $1 \times 1$. It is desired to distribute the nine digits $1, 2, . . . , 9$ in each small square of $1 \times 1$, a number in each small square. Find the number of different distributions that can be formed in such a way that the difference of the digits in cells that share a side in common is less than or equal to three. Two distributions are distinct even if they differ by rotation and/or reflection.

An equilateral triangle of side $n$ is divided into $n^2$ equilateral triangles of side $1$. A path is drawn along the sides of the triangles which passes through each vertex just once. Prove that the path makes an acute angle at at least $n$ vertices.

Colour a $20000\times 20000$ square grid using 2000 different colours with 1 colour in each square. Two squares are neighbours if they share a vertex. A path is a sequence of squares so that 2 successive squares are neighbours. Mark $k$ of the squares. For each unmarked square $x$, there is exactly 1 marked square $y$ of the same colour so that $x$ and $y$ are connected by a path of squares of the same colour. For any 2 marked squares of the same colour, any path connecting them must pass through squares of all the colours. Find the maximum value of $k$.

Determine all natural numbers $n$ for which there is a partition of $\{1,2,...,3n\}$ in $n$ pairwise disjoint subsets of the form $\{a,b,c\}$, such that numbers $b-a$ and $c-b$ are different numbers from the set $\{n-1, n, n+1\}$.

Let $A$ be a non-empty subset of the set of all positive integers $N^*$. If any sufficient big positive integer can be expressed as the sum of $2$ elements in $A$(The two integers do not have to be different), then we call that $A$ is a divalent radical. For $x \geq 1$, let $A(x)$ be the set of all elements in $A$ that do not exceed $x$, prove that there exist a divalent radical $A$ and a constant number $C$ so that for every $x \geq 1$, there is always $\left| A(x) \right| \leq C \sqrt{x}$.

Twenty ants live on the faces of an icosahedron, one ant on each side, where the icosahedron have each side with length 1. Each ant moves in a counterclockwise direction on each face, along the side/edges. The speed of each ant must be no less than 1 always. Also, if two ants meet, they should meet at the vertex of the icosahedron. If five ants meet at the same time at a vertex, we call that a [i]collision[/i]. Can the ants move forever, in a way that no [i]collision[/i] occurs?

For a natural number $n$, let $$C_n=\frac{1}{n+1}\binom{2n}{n}=\frac{(2n)!}{n!(n+1)!}$$ be the $n$-th Catalan number. Prove that for any natural number $m$, $$\sum_{i+j+k=m} C_{i+j}C_{j+k}C_{k+i}=\frac{3}{2m+3}C_{2m+1}.$$ [i]Proposed by Bin Wang[/i]

Let $P_i(x_i,y_i)\ (i=1,2,\cdots,2023)$ be $2023$ distinct points on a plane equipped with rectangular coordinate system. For $i\neq j$, define $d(P_i,P_j) = |x_i - x_j| + |y_i - y_j|$. Define $$\lambda = \frac{\max_{i\neq j}d(P_i,P_j)}{\min_{i\neq j}d(P_i,P_j)}$$. Prove that $\lambda \geq 44$ and provide an example in which the equality holds.

Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold: (a) the union of any two white subsets is white; (b) the union of any two black subsets is black; (c) there are exactly $N$ white subsets.

A $ 20\times20\times20$ block is cut up into 8000 non-overlapping unit cubes and a number is assigned to each. It is known that in each column of 20 cubes parallel to any edge of the block, the sum of their numbers is equal to 1. The number assigned to one of the unit cubes is 10. Three $ 1\times20\times20$ slices parallel to the faces of the block contain this unit cube. Find the sume of all numbers of the cubes outside these slices.

[b]p1.[/b] One hundred hobbits sit in a circle. The hobbits realize that whenever a hobbit and his two neighbors add up their total rubles, the sum is always $2007$. Prove that each hobbit has $669$ rubles. [b]p2.[/b] There was a young lady named Chris, Who, when asked her age, answered this: "Two thirds of its square Is a cube, I declare." Now what was the age of the miss? (a) Find the smallest possible age for Chris. You must justify your answer. (Note: ages are positive integers; "cube" means the cube of a positive integer.) (b) Find the second smallest possible age for Chris. You must justify your answer. (Ignore the word "young.") [b]p3.[/b] Show that $$\sum_{n=1}^{2007}\frac{1}{n^3+3n^2+2n}<\frac14$$ [b]p4.[/b] (a) Show that a triangle $ABC$ is isosceles if and only if there are two distinct points $P_1$ and $P_2$ on side $BC$ such that the sum of the distances from $P_1$ to the sides $AB$ and $AC$ equals the sum of the distances from $P_2$ to the sides $AB$ and $AC$. (b) A convex quadrilateral is such that the sum of the distances of any interior point to its four sides is constant. Prove that the quadrilateral is a parallelogram. (Note: "distance to a side" means the shortest distance to the line obtained by extending the side.) [b]p5.[/b] Each point in the plane is colored either red or green. Let $ABC$ be a fixed triangle. Prove that there is a triangle $DEF$ in the plane such that $DEF$ is similar to $ABC$ and the vertices of $DEF$ all have the same color. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

In a $2\times n$ array we have positive reals s.t. the sum of the numbers in each of the $n$ columns is $1$. Show that we can select a number in each column s.t. the sum of the selected numbers in each row is at most $\frac{n+1}4$.

Eight problems were given to each of $30$ students. After the test was given, point values of the problems were determined as follows: a problem is worth $n$ points if it is not solved by exactly $n$ contestants (no partial credit is given, only zero marks or full marks). (a) Is it possible that the contestant having got more points that any other contestant had also solved less problems than any other contestant? (b) Is it possible that the contestant having got less points than any other contestant has solved more problems than any other contestant?

Ana, Beatriz, Carlos, Diego and Emilia play a chess tournament. Each player faces each of the other four only once. Each player gets $2$ points if he wins the match, $1$ point if he draws and $0$ point if he loses. At the end of the tournament, it turns out that the scores of the $5$ players are all different. Find the maximum number of ties there could be in the tournament and justify why there could not be a higher number of ties.

Let $f$ be an increasing mapping from the family of subsets of a given finite set $H$ into itself, i.e. such that for every $X \subseteq Y\subseteq H$ we have $f (X )\subseteq f (Y )\subseteq H .$ Prove that there exists a subset $H_{0}$ of $H$ such that $f (H_{0}) = H_{0}.$

In a $2\times 2$ Domino game, each tile is square and divided into four spaces, as shown in the figure. In each box there is a number of points that varies from $0$ points (empty) to $6$ points. Two $2\times 2$ Domino tiles are equal if it is possible to rotate one of the two tiles until the other is obtained. In a $2\times 2$ Domino pack, what is the maximum number of different tiles that can be such that on each tile at least two squares have the same number of points? [img]https://cdn.artofproblemsolving.com/attachments/5/3/87efeaa24efc78a75a78e94c53f296dd078f71.png[/img]

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

The closed line segment $I$ is covered by finitely many closed line segments. Show that one can choose a subfamily $S$ of the family of line segments having the properties: (1) the chosen line segments are disjoint, (2) the sum of the lengths of the line segments of S is more than half of the length of $I.$ Show that the claim does not hold any more if the line segment $I$ is replaced by a circle and other occurences of the compound word ''line segment" by the word ''circular arc".

A country with $n$ cities has some two-way roads connecting certain pairs of cities. Someone notices that if the country is split into two parts in any way, then there would be at most $kn$ roads between the two parts (where $k$ is a fixed positive integer). What is the largest integer $m$ (in terms of $n$ and $k$) such that there is guaranteed to be a set of $m$ cities, no two of which are directly connected by a road?

Agustín and Lucas, by turns, each time mark a box that has not yet been marked on a $101\times 101$ grid board. Augustine starts the game. You cannot check a box that already has two checked boxes in its row or column. The one who can't make his move loses. Decide which of the two players has a winning strategy.