Found problems: 124
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]
Prove that the rectangle $m\times n$ table can be filled with exact squares so, that the sums in the rows and the sums in the columns will be exact squares also.
In each cell of the table $ 3 \times 3 $ there is one of the numbers $1, 2$ and $3$. Dima counted the sum of the numbers in each row and in each column. What is the greatest number of different sums he could get?
The cells of a $8 \times 8$ table are initially white. Alice and Bob play a game. First Alice paints $n$ of the fields in red. Then Bob chooses $4$ rows and $4$ columns from the table and paints all fields in them in black. Alice wins if there is at least one red field left. Find the least value of $n$ such that Alice can win the game no matter how Bob plays.
What is the greatest amount of rooks that can be placed on an $n\times n$ board, such that each rooks beats an even number of rooks? A rook is considered to beat another rook, if they lie on one vertical or one horizontal line and no rooks are between them.
[I]Proposed by D. Karpov[/i]
Consider a table of cyclic permutations ($n\ge2$)
\[
\begin{matrix}
1, & 2, & \ldots, & n-1, & n \\
2, & 3, & \ldots, & n, & 1, \\
\vdots & \vdots & \ddots & \vdots & \vdots \\
n, & 1, & \ldots, & n-2, & n-1.
\end{matrix}
\]
Then multiply each number of the first row by that number of the $k$-th row that is in the same column. Sum all these products and denote $s_k$ the result (e.g. $s_2=1\cdot2+2\cdot3+\cdots+(n-1)\cdot n+n\cdot1$).
a) Find a recursive relation for $s_k$ in terms of $s_{k-1}$ and determine the explicit formula for $s_k$.
b) Determine both an index $k$ and the value of $s_k$ such that the sum $s_k$ is minimal.
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?
An $m \times n$ rectangle is divided into mn unit squares by lines parallel to its sides. A gnomon is the figure of three unit squares formed by deleting one unit square from a $2 \times 2$ square. For what $m, n$ can we divide the rectangle into gnomons so that no two gnomons form a rectangle and no vertex is in four gnomons?
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]”?
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.
The cells of a table [b]m x n[/b], $m \geq 5$, $n \geq 5$ are colored in 3 colors where:
(i) Each cell has an equal number of adjacent (by side) cells from the other two colors;
(ii) Each of the cells in the 4 corners of the table doesn’t have an adjacent cell in the same color.
Find all possible values for $m$ and $n$.
Half the cells of a $2m \times n$ board are colored black and the other half are colored white. The cells at the opposite ends of the main diagonal are different colors. The center of each black cell is connected to the center of every other black cell by a straight line segment, and similarly for the white cells. Show that we can place an arrow on each segment so that it becomes a vector and the vectors sum to zero.
Given the square table $n\times n$ with $(n-1)$ marked fields. Prove that it is possible to move all the marked fields below the diagonal by moving rows and columns.
Find all integers $n$ for which there exists a table with $n$ rows, $2022$ columns, and integer entries, such that subtracting any two rows entry-wise leaves every remainder modulo $2022$.
[i]Proposed by Tony Wang[/i]
The integers from 1 to 49 are written in a $7\times 7$ table, such that for any $k\in\{1,2,\ldots,7\}$ the product of the numbers in the $k$-th row equals the product of the numbers in the $(8-k)$-th row.
[list=a]
[*]Prove that there exists a row such that the sum of the numbers written on it is a prime number.
[*]Give an example of such a table.
[/list]
[i]Cristi Săvescu[/i]
Each $1 \times 1$ square of an $n \times n$ table contains a different number. The smallest number in each row is marked, and these marked numbers are in different columns. Then the smallest number in each column is marked, and these marked numbers are in different rows. Prove that the two sets of marked numbers are identical.
(V Klepcyn)
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.
A square is divided into 169 identical small squares and in every small square is written 0 or 1. It isn’t allowed in one row or column to have the following arrangements of adjacent digits in this order: 101, 111 or 1001. What is the the biggest possible number of 1’s in the table?
Find all positive integers $n$ for which a square[b][i] n x n[/i][/b] can be covered with rectangles [b][i]k x 1[/i][/b] and one square [b][i]1 x 1[/i][/b] when:
a) $k = 4$ b) $k = 8$
Is it possible to fill a $40 \times 41$ table with integers so that each integer equals the number of adjacent (by an edge) cells with the same integer?
Alexandr Gribalko
An infinite squared sheet is given, with squares of side length $1$. The “distance” between two squares is defined as the length of the shortest path from one of these squares to the other if moving between them like a chess rook (measured along the trajectory of the centre of the rook). Determine the minimum number of colours with which it is possible to colour the sheet (each square being given a single colour) in such a way that each pair of squares with distance between them equal to $6$ units is given different colours. Give an example of such a colouring and prove that using a smaller number of colours we cannot achieve this goal.
(AG Pechkovskiy, IV Itenberg)
Let $n$ be a positive integer. In how many ways can an $n \times n$ table be filled with integers from $0$ to $5$ such that
a) the sum of each row is divisible by $2$ and the sum of each column is divisible by $3$
b) the sum of each row is divisible by $2$, the sum of each column is divisible by $3$ and the sum of each of the two diagonals is divisible by $6$?
An $h \times k$ minor of an $n \times n$ table is the $hk$ cells which lie in $h$ rows and $k$ columns. The semiperimeter of the minor is $h + k$. A number of minors each with semiperimeter at least $n$ together include all the cells on the main diagonal. Show that they include at least half the cells in the table.
An $n$ by $n$ table has an integer in each cell, such that no two cells within a row share the same number. Prove that it is possible to permute the elements within each row to obtain a table that has $n$ distinct numbers in each column.
Take a $n \times n$ chess page.Determine the $n$ such that we can put the numbers $1,2,3, \ldots ,n$ in the squares of the page such that we know the following two conditions are true:
a) for each row we know all the numbers $1,2,3, \ldots ,n$ have appeared on it and the numbers that are in the black squares of that row have the same sum as the sum of the numbers in the white squares of that row.
b) for each column we know all the numbers $1,2,3, \ldots ,n$ have appeared on it and the numbers that are in the black squares in that column have the same sum as the sum of the numbers in the white squares of that column.