Olympiad problems

2020 Dürer Math Competition (First Round), P5

We call a table of size $n \times n$ self-describing if each cell of the table contains the total number of even numbers in its row and column other than itself. How many self-describing tables of size a) $3 \times 3$ exist? b) $4 \times 4$ exist? c) $5 \times 5$ exist? Two tables are different if they differ in at least one cell.

2007 Peru Iberoamerican Team Selection Test, P4

Tags: combinatorics , Tables , board

Each of the squares on a $15$×$15$ board has a zero. At every step you choose a row or a column, we delete all the numbers from it and then we write the numbers from $1$ to $15$ in the empty cells, in an arbitrary order. find the sum possible maximum of the numbers on the board that can be achieved after a number finite number of steps.

2000 Saint Petersburg Mathematical Olympiad, 11.6

Tags: combinatorics , chess , grids , Coloring , Rooks , tabels , Tables

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]

2020 Dürer Math Competition (First Round), P2

Tags: combinatorics , Tables

Initially we have a $2 \times 2$ table with at least one grain of wheat on each cell. In each step we may perform one of the following two kinds of moves: $i.$ If there is at least one grain on every cell of a row, we can take away one grain from each cell in that row. $ii.$ We can double the number of grains on each cell of an arbitrary column. a) Show that it is possible to reach the empty table using the above moves, starting from the position down below. b) Show that it is possible to reach the empty table from any starting position. c) Prove that the same is true for the $8 \times 8$ tables as well.

2014 IFYM, Sozopol, 6

Tags: combinatorics , covering , Tables

We have 19 triminos (2 x 2 squares without one unit square) and infinite amount of 2 x 2 squares. Find the greatest odd number $n$ for which a square $n$ x $n$ can be covered with the given figures.

2009 Peru Iberoamerican Team Selection Test, P2

Tags: combinatorics , Magician , Tables

A magician and his assistant perform in front of an audience of many people. On the stage there is an $8$×$8$ board, the magician blindfolds himself, and then the assistant goes inviting people from the public to write down the numbers $1, 2, 3, 4, . . . , 64$ in the boxes they want (one number per box) until completing the $64$ numbers. After the assistant covers two adyacent boxes, at her choice. Finally, the magician removes his blindfold and has to $“guess”$ what number is in each square that the assistant. Explain how they put together this trick. $Clarification:$ Two squares are adjacent if they have a common side

2013 Portugal MO, 5

Tags: combinatorics , Coloring , Tables

Liliana wants to paint a $m\times n$ board. Liliana divides each unit square by one of its diagonals and paint one of the halves of the square with black and the other half with white in such a way that triangles that have a common side haven't the same colour. How many possibilities has Liliana to paint the board?