Nine points form a grid of size $3\times 3$. How many triangles are there with $3$ vertices at these points?

A board of size $2015 \times 2015$ is covered with sub-boards of size $2 \times 2$, each of which is painted like chessboard. Each sub-board covers exactly $4$ squares of the board and each square of the board is covered with at least one square of a sub-board (the painted of the sub-boards can be of any shape). Prove that there is a way to cover the board in such a way that there are exactly $2015$ black squares visible. What is the maximum number of visible black squares?

Petya and Vasya live in neighboring houses (see the plan in the figure). Vasya lives in the fourth entrance. It is known that Petya runs to Vasya by the shortest route (it is not necessary walking along the sides of the cells) and it does not matter from which side he runs around his house. Determine in which entrance he lives Petya . [img]https://cdn.artofproblemsolving.com/attachments/b/1/741120341a54527b179e95680aaf1c4b98ff84.png[/img]

$N$ cells chosen on a rectangular grid. Let $a_i$ is number of chosen cells in $i$-th row, $b_j$ is number of chosen cells in $j$-th column. Prove that $$ \prod_{i} a_i! \cdot \prod_{j} b_j! \leq N! $$

In a 2025 by 2025 grid, every cell initially contains a `1'. Every minute, we simultaneously replace the number in each cell with the sum of numbers in the cells that share an edge with it. (For example, after the first minute, the number 2 is written in each of the four corner cells.) After 2025 minutes, we colour the board in checkerboard fashion, such that the top left corner is black. Find the difference between the sum of numbers in black cells and the sum of numbers in white cells. [i]Proposed by chorn[/i]

Davi and George are taking a city tour through Fortaleza, with Davi initially leading. Fortaleza is organized like an $n \times n$ grid. They start in one of the grid's squares and can move from one square to another adjacent square via a street (for each pair of neighboring squares on the grid, there is a street connecting them). Some streets are dangerous. If Davi or George pass through a dangerous street, they get scared and swap who is leading the city tour. Their goal is to pass through every block of Fortaleza exactly once. However, if the city tour ends with George in command, the entire world becomes unemployed and everyone starves to death. Given that there is at least one street that is not dangerous, prove that Davi and George can achieve their goal without everyone dying of hunger.

Let $n$ be a positive integer. A [i]Nordic[/i] square is an $n \times n$ board containing all the integers from $1$ to $n^2$ so that each cell contains exactly one number. Two different cells are considered adjacent if they share a common side. Every cell that is adjacent only to cells containing larger numbers is called a [i]valley[/i]. An [i]uphill path[/i] is a sequence of one or more cells such that: (i) the first cell in the sequence is a valley, (ii) each subsequent cell in the sequence is adjacent to the previous cell, and (iii) the numbers written in the cells in the sequence are in increasing order. Find, as a function of $n$, the smallest possible total number of uphill paths in a Nordic square. Author: Nikola Petrović

Chris and Michael play a game on a board which is a rhombus of side length $n$ (a positive integer) consisting of two equilateral triangles, each of which has been divided into equilateral triangles of side length $ 1$. Each has a single token, initially on the leftmost and rightmost squares of the board, called the “home” squares (the illustration shows the case $n = 4$). [img]https://cdn.artofproblemsolving.com/attachments/e/b/8135203c22ce77c03c144850099ad1c575edb8.png[/img] A move consists of moving your token to an adjacent triangle (two triangles are adjacent only if they share a side). To win the game, you must either capture your opponent’s token (by moving to the triangle it occupies), or move on to your opponent’s home square. Supposing that Chris moves first, which, if any, player has a winning strategy?

Initially, all the squares of an $8\times 8$ grid are white. You start by choosing one of the squares and coloring it gray. After that, you may color additional squares gray one at a time, but you may only color a square gray if it has exactly $1$ or $3$ gray neighbors at that moment (where a neighbor is a square sharing an edge). For example, the configuration below (of a smaller $3\times 4$ grid) shows a situation where six squares have been colored gray so far. The squares that can be colored at the next step are marked with a dot. Is it possible to color all the squares gray? Justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/1/c/d50ab269f481e4e516dace06a991e6b37f2a85.png[/img]

Let there be a $n\times n$ board. Write down $0$ or $1$ in all $n^2$ squares. For $1 \le k \le n$, let $A_k$ be the product of all numbers in the $k$th row. How many ways are there to write down the numbers so that $A_1 + A_2 + ... + A_n$ is even?

A plane is divided into unit squares by two collections of parallel lines. For any $n\times n$ square with sides on the division lines, we define its frame as the set of those unit squares which internally touch the boundary of the $n\times n$ square. Prove that there exists only one way of covering a given $100\times 100$ square whose sides are on the division lines with frames of $50$ squares (not necessarily contained in the $100\times 100$ square). (A. Perlin)

For which positive integers $n$ can be covered a ladder like that of the figure (but with $n$ steps instead of $4$) with $n$ squares of integer sides, not necessarily the same size, without these squares overlapping and without standing out from the edge of the figure ?

In an $N \times N$ table consisting of small unit squares, some squares are coloured black and the other squares are coloured white. For each pair of columns and each pair of rows, the four squares on the intersections of these rows and columns must not all be of the same colour. What is the largest possible value of $N$?

In a $3n \times 3n$ grid, each square is either black or red. Each red square not on the edge of the grid has exactly five black squares among its eight neighbor squares.. On every black square that not at the edge of the grid, there are exactly four reds in the adjacent squares box. How many black and how many red squares are in the grid?

A number is placed in each cell of an $n \times n$ board so that the following holds: (A) the cells on the boundary all contain 0; (B) other cells on the main diagonal are each1 greater than the mean of the numbers to the left and right; (C) other cells are the mean of the numbers to the left and right. Show that (B) and (C) remain true if ''left and right'' is replaced by ''above and below''.

A non self-intersecting polygon is given in a Cartesian coordinate system such that its perimeter contains no lattice points, and its vertices have no integer coordinates. A point is called semi-integer if exactly one of its coordinates is an integer. Let $P_1, P_2,\ldots, P_k$ denote the semi-integer points on the perimeter of the polygon. Let ni denote the floor of the non-integer coordinate of $P_i$. Prove that integers $n_1,n_2,\ldots ,n_k$ can be divided into two groups with the same sum. [i]Proposed by Áron Bán-Szabó, Budapest[/i]

A frog is located on a unit square of an infinite grid oriented according to the cardinal directions. The frog makes moves consisting of jumping either one or two squares in the direction it is facing, and then turning according to the following rules: i) If the frog jumps one square, it then turns $90^\circ$ to the right; ii) If the frog jumps two squares, it then turns $90^\circ$ to the left. Is it possible for the frog to reach the square exactly $2024$ squares north of the initial square after some finite number of moves if it is initially facing: a) North; b) East?

Positive integers $m, n$ are such that $mn$ is divisible by $9$ but not divisible by $27$. Rectangle $m \times n$ is cut into corners, each consisting of three cells. There are four types of such corners, depending on their orientation; you can see them on the figure below. Could it happen that the number of corners of each type was the exact square of some positive integer? [i]Proposed by Oleksiy Masalitin[/i] [img]https://i.ibb.co/Y8QSHyf/Kyiv-MO-2023-10-4.png[/img]

In each unit square of an infinite square grid a natural number is written. The polygons of area $n$ with sides going along the gridlines are called [i]admissible[/i], where $n > 2$ is a given natural number. The [i]value [/i] of an admissible polygon is defined as the sum of the numbers inside it. Prove that if the values of any two congruent admissible polygons are equal, then all the numbers written in the unit squares of the grid are equal. (We recall that a symmetric image of polygon $P$ is congruent to $P$.)

In an $m \times n$ grid, each square is either filled or not filled. For each square, its [i]value[/i] is defined as $0$ if it is filled and is defined as the number of neighbouring filled cells if it is not filled. Here, two squares are neighbouring if they share a common vertex or side. Let $f(m,n)$ be the largest total value of squares in the grid. Determine the minimal real constant $C$ such that $$\frac{f(m,n)}{mn} \le C$$holds for any positive integers $m,n$ [i]CSJL[/i]

Consider a $10 \times 10$ grid. On every move, we colour $4$ unit squares that lie in the intersection of some two rows and two columns. A move is allowed if at least one of the $4$ squares is previously uncoloured. What is the largest possible number of moves that can be taken to colour the whole grid?

Determine the number of paths from $A$ to $B$ on the picture that go along gridlines only, do not pass through any point twice, and never go upwards? [img]https://cdn.artofproblemsolving.com/attachments/0/2/87868e24a48a2e130fb5039daeb85af42f4b9d.png[/img]

Consider a $3k \times 3k$ square grid (where $k$ is a positive integer), the cells in the grid are coordinated in terms of columns and rows: Cell $(i, j)$ is at the $i^{\text{th}}$ column from left to right and the $j^{\text{th}}$ row from bottom up. We want to place $4k$ marbles in the cells of the grid, with each cell containing at most one marble, such that - Each row and each column has at least one marble - For each marble, there is another marble placed on the same row or column with that marble. a) Assume $k=1$. Determine the number of ways to place the marbles to satisfy the above conditions (Two ways to place marbles are different if there is a cell $(i, j)$ having a marble placed in one way but not in the other way). b) Assume $k \geq 1$. Find the largest positive integer $N$ such that if we mark any $N$ cells on the board, there is always a way to place $4k$ marbles satisfying the above conditions such that none of the marbles are placed on any of the marked cells.

Consider a $8\times 8$ chessboard where all $64$ unit squares are at the start white. Prove that, if any $12$ of the $64$ unit square get painted black, then we can find $4$ lines and $4$ rows that have all these $12$ unit squares.

Find the greatest number of depicted pieces composed of $4$ unit squares that can be placed without overlapping on an $n \times n$ grid (where n is a positive integer) in such a way that it is possible to move from some corner to the opposite corner via uncovered squares (moving between squares requires a common edge). The shapes can be rotated and reflected. [img]https://cdn.artofproblemsolving.com/attachments/b/d/f2978a24fdd737edfafa5927a8d2129eb586ee.png[/img]