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 $N\times N$ square board where $N\geq 3$ is an odd integer. The caterpillar Carl sits at the center of the square; all other cells contain distinct positive integers. An integer $n$ weights $1\slash n$ kilograms. Carl wants to leave the board but can eat at most $2$ kilograms. Determine whether Carl can always find a way out when a) $N=2003.$ b) $N$ is an arbitrary odd integer.

Consider a table with $n$ rows and $2n$ columns. we put some blocks in some of the cells. After putting blocks in the table we put a robot on a cell and it starts moving in one of the directions right, left, down or up. It can change the direction only when it reaches a block or border. Find the smallest number $m$ such that we can put $m$ blocks on the table and choose a starting point for the robot so it can visit all of the unblocked cells. (the robot can't enter the blocked cells.) Proposed by Seyed Mohammad Seyedjavadi and Alireza Tavakoli

Petya and Vasya are playing a game on an initially empty \(100 \times 100\) grid, taking turns. Petya goes first. On his turn, a player writes an uppercase Russian letter in an empty cell (each cell can contain only one letter). When all cells are filled, Petya is declared the winner if there are four consecutive cells horizontally spelling the word ``ПЕТЯ'' (PETYA) from left to right, or four consecutive cells vertically spelling ``ПЕТЯ'' from top to bottom. Can Petya guarantee a win regardless of Vasya's moves?

Adel draws an $m \times n$ grid of dots on the coordinate plane, at the points of integer coordinates $(a,b)$ where $1 \le a \le m$ and $1 \le b \le n$. He proceeds to draw a closed path along $k$ of these dots, $(a_1, b_1)$,$(a_2,b_2)$,...,$(a_k,b_k)$, such that $(a_i,b_i)$ and $(a_{i+1}, b_{i+1})$ (where $(a_{k+1}, b_{k+1}) = (a_1, b_1)$) are $1$ unit apart for each $1 \le i \le k$. Adel makes sure his path does not cross itself, that is, the $k$ dots are distinct. Find, with proof, the maximum possible value of $k$ in terms of $m$ and $n$.

Each cell of a $3 $ × $3$ grid is labeled with a digit in the set {$1, 2, 3, 4, 5$} Then, the maximum entry in each row and each column is recorded. Compute the number of labelings for which every digit from $1$ to $5$ is recorded at least once.

Twenty-five people of different heights stand in a $5\times 5$ grid of squares, with one person in each square. We know that each row has a shortest person, suppose Ana is the tallest of these five people. Similarly, we know that each column has a tallest person, suppose Bev is the shortest of these five people. Assuming Ana and Bev are not the same person, who is taller: Ana or Bev? Prove that your answer is always correct.

A square of side $5$ is divided into $25$ unit squares. Let $A$ be the set of the $16$ interior points of the initial square which are vertices of the unit squares. What is the largest number of points of $A$ no three of which form an isosceles right triangle?

A board $ n \times n$ ($n \ge 3$) is divided into $n^2$ unit squares. Integers from $O$ to $n$ included, are written down: one integer in each unit square, in such a way that the sums of integers in each $2\times 2$ square of the board are different. Find all $n$ for which such boards exist.

Two player are playing in an $100 \times 100$ grid. Initially the whole board is black. On $A$'s move, he selects $4 \times 4$ subgrid and color it white. On $B$'s move, he selects a $3 \times 3$ subgrid and colors it black. $A$ wants to make the whole board white. Can he do it? [i]Proposed by S M A Nahian[/i]

Let $p$ be a given prime number. For positive integers $n,k\geq2$ let $S_1, S_2,\dots, S_n$ be unit square sets constructed by choosing exactly one unit square from each of the columns from $p\times k$ chess board. If $|S_i \cap S_j|=1$ for all $1\leq i < j \leq n$ and for any duo of unit squares which are located at different columns there exists $S_i$ such that both of these unit squares are in $S_i$ find all duos of $(n,k)$ in terms of $p$. Note: Here we denote the number of rows by $p$ and the number of columns by $k$.