Is it possible to divide a $7\times7$ table into a few $\text{connected}$ parts of cells with the same perimeter? ( A group of cells is called $\text{connected}$ if any cell in the group, can reach other cells by passing through the sides of cells.)

Let $d\geq 1$ and $n\geq 0$ be integers. Find the number of ways to write down a nonnegative integer in each square of a $d\times d$ grid such that the numbers in any set of $d$ squares, no two in the same row or column, sum to $n$.

In the cells of the table $ 100 \times100 $ are placed in pairs different numbers. Every minute each of the numbers changes to the largest of the numbers in the adjacent cells on the side. Can after $4$ hours all the numbers in the table be the same?

Positive integers are put into the following table. \begin{tabular}{|l|l|l|l|l|l|l|l|l|l|} \hline 1 & 3 & 6 & 10 & 15 & 21 & 28 & 36 & & \\ \hline 2 & 5 & 9 & 14 & 20 & 27 & 35 & 44 & & \\ \hline 4 & 8 & 13 & 19 & 26 & 34 & 43 & 53 & & \\ \hline 7 & 12 & 18 & 25 & 33 & 42 & & & & \\ \hline 11 & 17 & 24 & 32 & 41 & & & & & \\ \hline 16 & 23 & & & & & & & & \\ \hline ... & & & & & & & & & \\ \hline ... & & & & & & & & & \\ \hline \end{tabular} Find the number of the line and column where the number $2015$ stays.

There are some papers of the size $5\times 5$ with two sides which are divided into unit squares for both sides. One uses $n$ colors to paint each cell on the paper, one cell by one color, such that two cells on the same positions for two sides are painted by the same color. Two painted papers are consider as the same if the color of two corresponding cells are the same. Prove that there are no more than $$\frac{1}{8}\left( {{n}^{25}}+4{{n}^{15}}+{{n}^{13}}+2{{n}^{7}} \right)$$ pairwise distinct papers that painted by this way.

The entries of a $7 \times 5$ table are filled with numbers so that in each $2 \times 3$ rectangle (vertical or horizontal) the sum of numbers is $0$. For $100$ dollars Peter may choose any single entry and learn the number in it. What is the least amount of dollars he should spend in order to learn the total sum of numbers in the table for sure?

In table of dimensions $2n \times 2n$ there are positive integers not greater than $10$, such that numbers lying in unit squares with common vertex are coprime. Prove that there exist at least one number which occurs in table at least $\frac{2n^2}{3}$ times

A grid measuring $10 \times 11$ is given. How many "crosses" covering five unit squares can be placed on the grid? (pictured right) so that no two of them cover the same square? [img]https://cdn.artofproblemsolving.com/attachments/a/7/8a5944233785d960f6670e34ca7c90080f0bd6.png[/img]

On a $3 \times 3$ board the numbers from $1$ to $9$ are written in some order and without repeating. We say that the arrangement obtained is [i]Isthmian [/i] if the numbers in any two adjacent squares have different parity. Determine the number of different Isthmian arrangements. Note: Two arrangements are considered equal if one can be obtained from the other by rotating the board.

Pairwise distinct real numbers are arranged into an $m \times n$ rectangular array. In each row the entries are arranged increasingly from left to right. Each column is then rearranged in decreasing order from top to bottom. Prove that in the reorganized array, the rows remain arranged increasingly.

Numbers from $1$ to $49$ are randomly placed in a $35 \times 35$ table such that number $i$ is used exactly $i$ times. Some random cells of the table are removed so that table falls apart into several connected (by sides) polygons. Among them, the one with the largest area is chosen (if there are several of the same largest areas, a random one of them is chosen). What is the largest number of cells that can be removed that guarantees that in the chosen polygon there is a number which occurs at least $15$ times?

We may permute the rows and the columns of the table below. How may different tables can we generate? 1 2 3 4 5 6 7 7 1 2 3 4 5 6 6 7 1 2 3 4 5 5 6 7 1 2 3 4 4 5 6 7 1 2 3 3 4 5 6 7 1 2 2 3 4 5 6 7 1

For a positive integer $n$, consider a square cake which is divided into $n \times n$ pieces with at most one strawberry on each piece. We say that such a cake is [i]delicious[/i] if both diagonals are fully occupied, and each row and each column has an odd number of strawberries. Find all positive integers $n$ such that there is an $n \times n$ delicious cake with exactly $\left\lceil\frac{n^2}{2}\right\rceil$ strawberries on it.

A cricket wants to move across a $2n \times 2n$ board that is entirely covered by dominoes, with no overlap. He jumps along the vertical lines of the board, always going from the midpoint of the vertical segment of a $1 \times 1$ square to another midpoint of the vertical segment, according to the rules: $(i)$ When the domino is horizontal, the cricket jumps to the opposite vertical segment (such as from $P_2$ to $P_3$); $(ii)$ When the domino is vertical downwards in relation to its position, the cricket jumps diagonally downwards (such as from $P_1$ to $P_2$); $(iii)$ When the domino is vertically upwards relative to its position, the cricket jumps diagonally upwards (such as from $P_3$ to $P_4$). The image illustrates a possible covering and path on the $4 \times 4$ board. Considering that the starting point is on the first vertical line and the finishing point is on the last vertical line, prove that, regardless of the covering of the board and the height at which the cricket starts its path, the path ends at the same initial height.

Each of the $16$ squares in a $4 \times 4$ table contains a number. For any square, the sum of the numbers in the squares sharing a common side with the chosen square is equal to $1$. Determine the sum of all $16$ numbers in the table. (R Zhenodarov)

Find all pairs of natural numbers $(m,n)$, $m\leq n$, such that there exists a table with $m$ rows and $n$ columns filled with the numbers 1 and 0, satisfying the following property: If in a cell there's a 0 (respectively a 1), then the number of zeros (respectively ones) in the row of this cell is equal to the number of zeros (respectively ones) in the column of this cell.

We will call one of the cells of a rectangle 11 x 13 “[i]peculiar[/i]” , if after removing it the remaining figure can be cut into squares 2 x 2 and 3 x 3. How many of the 143 cells are “[i]peculiar[/i]”?

For any column and any row in a rectangular numerical table, the product of the sum of the numbers in a column by the sum of the numbers in a row is equal to the number at the intersection of the column and the row. Prove that either the sum of all the numbers in the table is equal to $1$ or all the numbers are equal to $0$.

A corner with arm $n$ is a figure made of $2n-1$ unit squares, such that 2 rectangles $1$ x $(n-1)$ are connected to two adjacent sides of a square $1$ x $1$, so that their unit sides coincide. The squares or a chessboard $100$ x $100$ are colored in 15 colors. We say that a corner with arm 8 is [i]“multicolored”[/i], if it contains each of the colors on the board. What’s the greatest number of corners with arm 8 which could be [i]“mutlticolored”[/i]?

In a table $n\times n$ some unit squares are coloured black and the other unit 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$?

Is it possible to color the cells of a table 19 x 19 in yellow, blue, red, and green so that each rectangle $a$ x $b$ ($a,b\geq 2$) in the table has at least 2 cells in different color?

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.

A checkered table consists of $2012$ rows and $k > 2$ columns. A marker is placed in a cell of the left-most column. Two players move the marker in turns. During each move, the player moves the marker by $1$ cell to the right, up or down to a cell that had never been occupied by the marker before. The game is over when any of the players moves the marker to the right-most column. However, whether this player is to win or to lose, the players are advised only when the marker reaches the second column from the right. Can any player secure his win?

Given positive numbers $a_1, a_2, ..., a_m, b_1, b_2, ..., b_n$. Is known that $$a_1+a_2+...+a_m=b_1+b_2+...+b_n.$$ Prove that you can fill an empty table with $m$ rows and $n$ columns with no more than $(m+n-1)$ positive number in such a way, that for all $i,j$ the sum of the numbers in the $i$-th row will equal to $a_i$, and the sum of the numbers in the $j$-th column -- to $b_j$.

King Arthur is placing $a + b + c$ knights around a table. $a$ knights are dressed in red, $b$ knights are dressed in brown, and $c$ knights are dressed in orange. Arthur wishes to arrange the knights so that no knight is seated next to someone dressed in the same colour as himself. Show that this is possible if, and only if, there exists a triangle whose sides have lengths $a +\frac12, b +\frac12$, and $c +\frac12$