A mink is standing in the center of a field shaped like a regular polygon. The field is surrounded by a fence, and the mink can only exit through the vertices of the polygon. A dog is standing on one of the vertices, and can move along the fence. The mink wants to escape the field, while the dog tries to prevent it. Each of them moves with constant velocity. For what ratio of velocities could the mink escape if: a. The field is a regular triangle? b. The field is a square?

A table consisting of $9$ rows and $2001$ columns is filfed with integers $1,2,..., 2001$ in such a way that each of these integers occurs in the table exactly $9$ times and the integers in any column differ by no more than $3$. Find the maximum possible value of the minimal column sum (sum of the numbers in one column).

Peter and Basil take turns drawing roads on a plane, Peter starts. The road is either horizontal or a vertical line along which one can drive in only one direction (that direction is determined when the road is drawn). Can Basil always act in such a way that after each of his moves one could drive according to the rules between any two constructed crossroads, regardless of Peter's actions? Alexandr Perepechko

Of six cities $S_1,S_2,...,S_6$ and two airlines $A$ and $B$ it is given that for every pair $(S_i,S_j)$ (where $i \ne j$) exactly one of the airlines has a connection from $S_i$ to $S_j$ and maintains back. (a) Prove that the air net of one of the companies contains a triangle. (b) Prove that in the two air nets there are even two triangles. [hide=]original wording]Van zes steden $S_1,S_2,...,S_6$ en twee luchtvaartmaatschappijen $A$ en $B$ is gegeven, dat voor ieder paar $(S_i,S_j)$ (waar $i \ne j$) precies één van de maatschappijen een verbinding van $S_i$ naar $S_j$ en terug onderhoudt, (a) Bewijs, dat het luchtnet van één van de maaschappijen een driehoek bevat; (b) Bewijs, dat er in de twee luchtnetten zelfs twee driehoeken zijn.[/hide]

Consider a point $O$ in the plane. Find all sets $S$ of at least two points in the plane such that if $A\in S$ ad $A\neq O$, then the circle with diameter $OA$ is in $S$. [i]Nikolai Nikolov, Slavomir Dinev[/i]

Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right. Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors. [i]Proposed by Gurgen Asatryan, Armenia[/i]

The geometric mean (G.M.) of $k$ positive integers $a_1$, $a_2$, $\dots$, $a_k$ is defined to be the (positive) $k$-th root of their product. For example, the G.M. of 3, 4, 18 is 6. Show that the G.M. of a set $S$ of $n$ positive numbers is equal to the G.M. of the G.M.'s of all non-empty subsets of $S$.

The teacher gave each of her $37$ students $36$ pencils in different colors. It turned out that each pair of students received exactly one pencil of the same color. Determine the smallest possible number of different colors of pencils distributed.

Let the decimal representations of numbers $A$ and $B$ be given as: $A = 0.a_1a_2\cdots a_k > 0$, $B = 0.b_1b_2\cdots b_k > 0$ (where $a_k, b_k$ can be 0), and let $S$ be the count of numbers $0.c_1c_2\cdots c_k$ such that $0.c_1c_2\cdots c_k < A$ and $0.c_kc_{k-1}\cdots c_1 < B$ ($c_k, c_1$ can also be 0). (Here, $0.c_1c_2\cdots c_r (c_r \neq 0)$ is considered the same as $0.c_1c_2\cdots c_r0\cdots0$). Prove: $\left| S - 10^k AB \right| \leq 9k.$

Ana plays a game on a $100\times 100$ chessboard. Initially, there is a white pawn on each square of the bottom row and a black pawn on each square of the top row, and no other pawns anywhere else.\\ Each white pawn moves toward the top row and each black pawn moves toward the bottom row in one of the following ways: [list] [*] it moves to the square directly in front of it if there is no other pawn on it; [*] it [b]captures[/b] a pawn on one of the diagonally adjacent squares in the row immediately in front of it if there is a pawn of the opposite color on it. [/list] (We say a pawn $P$ [b]captures[/b] a pawn $Q$ of the opposite color if we remove $Q$ from the board and move $P$ to the square that $Q$ was previously on.)\\ \\ Ana can move any pawn (not necessarily alternating between black and white) according to those rules. What is the smallest number of pawns that can remain on the board after no more moves can be made? [i]Proposed by José Alejandro Reyes González, Mexico[/i]

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

$4$ men stand at the entrance of a dark tunnel. Man $A$ needs $10$ minutes to pass through the tunnel, man $B$ needs $5$ minutes, man $C$ needs $2$ minutes and man $D$ needs $1$ minute. There is only one torch, that may be used from anyone that passes through the tunnel. Additionaly, at most $2$ men can pass through at the same time using the existing torch. Determine the smallest possible time the four men need to reach the exit of the tunnel.

Let $n$ be a positive integer divisible by $4$. Find the number of permutations $\sigma$ of $(1,2,3,\cdots,n)$ which satisfy the condition $\sigma(j)+\sigma^{-1}(j)=n+1$ for all $j \in \{1,2,3,\cdots,n\}$.

Patty is standing on a line of planks playing a game. Define a block to be a sequence of adjacent planks, such that both ends are not adjacent to any planks. Every minute, a plank chosen uniformly at random from the block that Patty is standing on disappears, and if Patty is standing on the plank, the game is over. Otherwise, Patty moves to a plank chosen uniformly at random within the block she is in; note that she could end up at the same plank from which she started. If the line of planks begins with $n$ planks, then for sufficiently large n, the expected number of minutes Patty lasts until the game ends (where the first plank disappears a minute after the game starts) can be written as $P(1/n)f(n) + Q(1/n)$, where $P,Q$ are polynomials and $f(n) =\sum^n_{i=1}\frac{1}{i}$ . Find $P(2023) + Q(2023)$.

The plane is divided into equilateral triangles of side length $1$. Consider a equilateral triangle of side length $n$ whose sides lie on the grid lines. On every grid point on the edge and inside of this triangle lies a stone. In a move, a unit triangle is selected, which has exactly $2$ corners with is covered with a stone. The two stones are removed, and the third corner is turned a new stone was laid. For which $n$ is it possible that after finitely many moves only one stone left?

A convicted person will be released when he reaches the top of a $100$-step staircase. But he cannot advance as he pleases, since he is obliged to go up one step each day of the odd-numbered months and go down one step each day of the even-numbered months. If it begins on January $ 1$, $2001$, what day will it be released?

Let $n>2$ be an integer. Anna, Edda and Magni play a game on a hexagonal board tiled with regular hexagons, with $n$ tiles on each side. The figure shows a board with 5 tiles on each side. The central tile is marked. [asy]unitsize(.25cm); real s3=1.73205081; pair[] points={(-4,4*s3),(-2,4*s3),(0,4*s3),(2,4*s3),(4,4*s3),(-5,3*s3), (-3,3*s3), (-1,3*s3), (1,3*s3), (3,3*s3), (5,3*s3), (-6,2*s3),(-4,2*s3), (-2,2*s3), (0,2*s3), (2,2*s3), (4,2*s3),(6,2*s3),(-7,s3), (-5,s3), (-3,s3), (-1,s3), (1,s3), (3,s3), (5,s3),(7,s3),(-8,0), (-6,0), (-4,0), (-2,0), (0,0), (2,0), (4,0), (6,0), (8,0),(-7,-s3),(-5,-s3), (-3,-s3), (-1,-s3), (1,-s3), (3,-s3), (5,-s3), (7,-s3), (-6,-2*s3), (-4,-2*s3), (-2,-2*s3), (0,-2*s3), (2,-2*s3), (4,-2*s3), (6,-2*s3), (-5,-3*s3), (-3,-3*s3), (-1,-3*s3), (1,-3*s3), (3,-3*s3), (5,-3*s3), (-4,-4*s3), (-2,-4*s3), (0,-4*s3), (2,-4*s3), (4,-4*s3)}; void draw_hexagon(pair p) { draw(shift(p)*scale(2/s3)*(dir(30)--dir(90)--dir(150)--dir(210)--dir(270)--dir(330)--dir(30))); } {for (int i=0;i<61;++i){draw_hexagon(points[i]);}} label((0,0), "\Large $*$"); [/asy] The game begins with a stone on a tile in one corner of the board. Edda and Magni are on the same team, playing against Anna, and they win if the stone is on the central tile at the end of any player's turn. Anna, Edda and Magni take turns moving the stone: Anna begins, then Edda, then Magni, then Anna, and so on. The rules for each player's turn are: [list] [*] Anna has to move the stone to an adjacent tile, in any direction. [*] Edda has to move the stone straight by two tiles in any of the $6$ possible directions. [*] Magni has a choice of passing his turn, or moving the stone straight by three tiles in any of the $6$ possible directions. [/list] Find all $n$ for which Edda and Magni have a winning strategy.

A Saudi company has two offices. One office is located in Riyadh and the other in Jeddah. To insure the connection between the two offices, the company has designated from each office a number of correspondents so that : (a) each pair of correspondents from the same office share exactly one common correspondent from the other office. (b) there are at least $10$ correspondents from Riyadh. (c) Zayd, one of the correspondents from Jeddah, is in contact with exactly $8$ correspondents from Riyadh. What is the minimum number of correspondents from Jeddah who are in contact with the correspondent Amr from Riyadh?

A board of $6\times 6$ is totally covered by $18$ dominoes (of $2\times 1$), that is, there are no overlaps, gaps, and the tiles do not come off the board. Prove that, regardless of the arrangement of the tiles, there is always a line that divides the board into two non-empty parts, and without cutting tiles.

A deck of $ 2n\plus{}1$ cards consists of a joker and, for each number between 1 and $ n$ inclusive, two cards marked with that number. The $ 2n\plus{}1$ cards are placed in a row, with the joker in the middle. For each $ k$ with $ 1 \leq k \leq n,$ the two cards numbered $ k$ have exactly $ k\minus{}1$ cards between them. Determine all the values of $ n$ not exceeding 10 for which this arrangement is possible. For which values of $ n$ is it impossible?

A ballot box contains the votes for the election of two candidates $A$ and $B$. It is known that candidate $A$ has $6$ votes and candidate $B$ has $9$. Find the probability that, when carrying out the scrutiny, candidate $B$ always goes first.

A school has $n$ students and some super classes are provided for them. Each student can participate in any number of classes that he/she wants. Every class has at least two students participating in it. We know that if two different classes have at least two common students, then the number of the students in the first of these two classes is different from the number of the students in the second one. Prove that the number of classes is not greater that $\left(n-1\right)^2$.

There are 6 squares in a row. Each one is labeled with the name of Ana or Beto and with a number from 1 to 6, using each number without repetition. Ana and Beto take turns painting each square according to the order of the numbers on the labels. Whoever paints the square will be the person whose name is on the label. When painting, the person can choose to paint the square either red or blue. Beto wins if at the end there are the same number of blue squares as red squares, and Ana wins otherwise. In how many of all the possible ways of labeling the squares can Beto ensure his victory? The following is an example of a labeling of the labels. [asy] size(12cm); draw((0,0)--(6,0)--(6,-1)--(0,-1)--cycle); for (int i=1; i<6; ++i) { draw((i,0)--(i,-1)); } for (int i=1; i<6; ++i) { draw((i,0)--(i,-1.25)); } draw((0,0)--(6,0)--(6,-1.25)--(0,-1.25)--cycle); for (int i=1; i<7; ++i) { draw((i-0.5,-1)--(i-0.5,-1.25)); } label("Ana", (0.25, -1.125)); label("Beto", (1.25, -1.125)); label("Ana", (2.25, -1.125)); label("Beto", (3.25, -1.125)); label("Ana", (4.25, -1.125)); label("Beto", (5.25, -1.125)); label("1", (0.75, -1.125)); label("3", (1.75, -1.125)); label("5", (2.75, -1.125)); label("2", (3.75, -1.125)); label("4", (4.75, -1.125)); label("6", (5.75, -1.125)); [/asy] First Ana paints the first square, then Beto paints the fourth square, then Beto paints the second square, and so on.

The sweeties shop called "Olympiad" sells boxes of $6,9$ or $20$ chocolates. Groups of students from a school that is near the shop collect money to buy a chocolate for each student; to make this they buy a box and than give to everybody a chocolate. Like this students can create groups of $15=6+9$ students, $38=2*9+20$ students, etc. The seller has promised to the students that he can satisfy any group of students, and if he will need to open a new box of chocolate for any group (like groups of $4,7$ or $10$ students) than he will give all the chocolates for free to this group. Can there be constructed the biggest group that profits free chocolates, and if so, how many students are there in this group?

[b]p1.[/b] A $10 \times 10$ array of squares is given. In each square, a student writes the product of the row number and the column number of the square (the upper left hand corner of this array is shown below). Determine the sum of the $100$ integers written in the array. [img]https://cdn.artofproblemsolving.com/attachments/5/9/527fdf90529221f6d06af169de1728da296538.png[/img] [b]p2.[/b] The equilateral triangle $DEF$ is inscribed in the equilateral triangle $ABC$ so that $ED$ is perpendicular to $BC$. If the area of $ABC$ equals one square unit, determine the area of $DEF$. [img]https://cdn.artofproblemsolving.com/attachments/c/0/6e1a303a45fa89576e26bc8fd30ce6564aaad1.png[/img] [b]p3.[/b] Consider a symmetric triangular set of points as shown (every point lies a distance of one unit from each of its neighbors). A collection of $m$ lines has the property that for every point in the arrangement, there is at least one line in the collection that passes through that point. Prove or disprove that $m \ge 10$. [img]https://cdn.artofproblemsolving.com/attachments/0/9/540f2781312f86672df1578bfe4f68b51d3b2c.png[/img] [b]p4.[/b] Let $P$ be a convex polygon drawn on graph paper (defined as the grid of all lines with equations $x = a$ and $y = b$, with $a$ and $b$ integers). We know that all the vertices of $P$ are at the intersections of grid lines and none of its sides is parallel to a grid line. Let $H$ be the sum of the lengths of the horizontal segments of the grid which are contained in the interior of $P$, and let $V$ be the sum of the lengths of the vertical segments of the grid in the interior of $P$. Prove that $H = V$ . [b]p5.[/b] Peter, Paul, and Mary play the following game. Given a fixed positive integer $k$ which is at most $2013$, they randomly choose a subset $A$ of $\{1, 2,..., 2013\}$ with $k$ elements. The winner is Peter, Paul, or Mary, respectively, if the sum of the numbers in $A$ leaves a remainder of $0$, $1$, or $2$ when divided by $3$. Determine the values of $k$ for which this game is fair (i.e., such that the three possible outcomes are equally likely). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].