Hernan wants to paint a $8\times 8$ board such that every square is painted with blue or red. Also wants to every $3\times 3$ subsquare have exactly $a$ blue squares and every $2\times 4$ or $4\times 2$ rectangle have exactly $b$ blue squares. Find all couples $(a,b)$ such that Hernan can do the required.

A game consists of pieces of the shape of a regular tetrahedron of side $1$. Each face of each piece is painted in one of $n$ colors, and by this, the faces of one piece are not necessarily painted in different colors. Determine the maximum possible number of pieces, no two of which are identical.

All edges of a polyhedron are painted with red or yellow. For an angle of a facet, if the edges determining it are of different colors, then the angle is called [i]excentric[/i]. The[i] excentricity [/i]of a vertex $A$, namely $S_A$, is defined as the number of excentric angles it has. Prove that there exist two vertices $B$ and $C$ such that $S_B + S_C \leq 4$.

In Lineland there are $n\geq1$ towns, arranged along a road running from left to right. Each town has a [i]left bulldozer[/i] (put to the left of the town and facing left) and a [i]right bulldozer[/i] (put to the right of the town and facing right). The sizes of the $2n$ bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes. Let $A$ and $B$ be two towns, with $B$ to the right of $A$. We say that town $A$ can [i]sweep[/i] town $B$ [i]away[/i] if the right bulldozer of $A$ can move over to $B$ pushing off all bulldozers it meets. Similarly town $B$ can sweep town $A$ away if the left bulldozer of $B$ can move over to $A$ pushing off all bulldozers of all towns on its way. Prove that there is exactly one town that cannot be swept away by any other one.

How many positive integers smaller than $1000$ and not divisible by $5$ and by $7$ are there?

All positive divisors of a positive integer $N$ are written on a blackboard. Two players $A$ and $B$ play the following game taking alternate moves. In the firt move, the player $A$ erases $N$. If the last erased number is $d$, then the next player erases either a divisor of $d$ or a multiple of $d$. The player who cannot make a move loses. Determine all numbers $N$ for which $A$ can win independently of the moves of $B$. [i](4th Middle European Mathematical Olympiad, Individual Competition, Problem 2)[/i]

There's a tape with $n^2$ cells labeled by $1,2,\ldots,n^2$. Suppose that $x,y$ are two distinct positive integers less than or equal to $n$. We want to color the cells of the tape such that any two cells with label difference of $x$ or $y$ have different colors. Find the minimum number of colors needed to do so.

Let $a,b$ be positive even integers. A rectangle with side lengths $a$ and $b$ is split into $a \cdot b$ unit squares. Anja and Bernd take turns and in each turn they color a square that is made of those unit squares. The person that can't color anymore, loses. Anja starts. Find all pairs $(a,b)$, such that she can win for sure. [b]Extension:[/b] Solve the problem for positive integers $a,b$ that don't necessarily have to be even. [b]Note:[/b] The [i]extension[/i] actually was proposed at first. But since this is a homework competition that goes over three months and some cases were weird, the problem was changed to even integers.

In duck language, only letters $q$, $a$, and $k$ are used. There is no word with two consonants after each other, because the ducks cannot pronounce them. However, all other four-letter words are meaningful in duck language. How many such words are there? In duck language, too, the letter $a$ is a vowel, while $q$ and $k$ are consonants.

We call a coloring $f$ of the elements in the set $M = \{(x, y) | x = 0, 1, \dots , kn - 1; y = 0, 1, \dots , ln - 1\}$ with $n$ colors allowable if every color appears exactly $k$ and $ l$ times in each row and column and there are no rectangles with sides parallel to the coordinate axes such that all the vertices in $M$ have the same color. Prove that every allowable coloring $f$ satisfies $kl \leq n(n + 1).$

Two people play a game on a graph with $2022$ points. Initially, there are no edges in the graph. They take turns and connect two non-neighbouring vertices with an edge. Whoever makes the graph connected loses. Which player has a winning strategy? [i]ST, danny2915[/i]

Let $n$ be a positive integer and let $t$ be an integer. $n$ distinct integers are written on a table. Bob, sitting in a room nearby, wants to know whether there exist some of these numbers such that their sum is equal to $t$. Alice is standing in front of the table and she wants to help him. At the beginning, she tells him only the initial sum of all numbers on the table. After that, in every move he says one of the $4$ sentences: $i.$ Is there a number on the table equal to $k$? $ii.$ If a number $k$ exists on the table, erase him. $iii.$ If a number $k$ does not exist on the table, add him. $iv.$ Do the numbers written on the table can be arranged in two sets with equal sum of elements? On these questions Alice answers yes or no, and the operations he says to her she does (if it is possible) and does not tell him did she do it. Prove that in less than $3n$ moves, Bob can find out whether there exist numbers initially written on the board such that their sum is equal to $t$

A [i]fortress[/i] is a finite collection of cells in an infinite square grid with the property that one can pass from any cell of the fortress to any other by a sequence of moves to a cell with a common boundary line (but it can have "holes"). The [i]walls[/i] of a fortress are the unit segments between cells belonging to the fortress and cells not belonging to the fortress. The [i]area[/i] $A$ of a fortress is the number of cells it consists of. The [i]perimeter[/i] $P$ is the total length of its walls. Each cell of the fortress can contain a [i]guard[/i] which can oversee the cells to the top, the bottom, the right and the left of this cell, up until the next wall (it also oversees its own cell). (a) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of perimeter $P \le 2024$. (b) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of area $A \le 2024$.

Let $n \geq 3$ be an integer. A labelling of the $n$ vertices, the $n$ sides and the interior of a regular $n$-gon by $2n + 1$ distinct integers is called [i]memorable[/i] if the following conditions hold: (a) Each side has a label that is the arithmetic mean of the labels of its endpoints. (b) The interior of the $n$-gon has a label that is the arithmetic mean of the labels of all the vertices. Determine all integers $n \geq 3$ for which there exists a memorable labelling of a regular $n$-gon consisting of $2n + 1$ consecutive integers.

How many ways can you arrange $3$ Alice’s, $1$ Bob, $3$ Chad’s, and $1$ David in a line if the Alice’s are all indistinguishable, the Chad’s are all indistinguishable, and Bob and David want to be adjacent to each other? (In other words, how many ways can you arrange $3$ A’s, $1$ B, $3$ C’s, and $1$ D in a row where the B and D are adjacent?)

Let $ x_1$, $ x_2$, $ \ldots$, $ x_n$ be real numbers satisfying the conditions: \[ \left\{\begin{array}{cccc} |x_1 \plus{} x_2 \plus{} \cdots \plus{} x_n | & \equal{} & 1 & \ \\ |x_i| & \leq & \displaystyle \frac {n \plus{} 1}{2} & \ \textrm{ for }i \equal{} 1, 2, \ldots , n. \end{array} \right. \] Show that there exists a permutation $ y_1$, $ y_2$, $ \ldots$, $ y_n$ of $ x_1$, $ x_2$, $ \ldots$, $ x_n$ such that \[ | y_1 \plus{} 2 y_2 \plus{} \cdots \plus{} n y_n | \leq \frac {n \plus{} 1}{2}. \]

$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.

A $9\times 9$ board has a number written on each square: all squares in the first row have $1$, all squares in the second row have $2$, $\ldots$, all squares in the ninth row have $9$. We will call [i]special [/i] rectangle any rectangle of $2\times 3$ or $3\times 2$ or $4\times 5$ or $5\times 4$ on the board. The permitted operations are: $\bullet$ Simultaneously add $1$ to all the numbers located in a special rectangle. $\bullet$ Simultaneously subtract $1$ from all numbers located in a special rectangle. Demonstrate that it is possible to achieve, through a succession of permitted operations, that $80$ squares to have $0$ (zero). What number is left in the remaining box?

A [i]chaisri[/i] figure is a triangle which the three vertices are vertices of a regular $2019$-gon. Two different chaisri figure may be formed by different regular $2019$-gon. A [i]thubkaew[/i] figure is a convex polygon which can be dissected into multiple chaisri figure where each vertex of a dissected chaisri figure does not necessarily lie on the border of the convex polygon. Determine the maximum number of vertices that a thubkaew figure may have.

There are $n$ pawns on $n$ distinct squares of a $19\times 19$ chessboard. In each move, all the pawns are simultaneously moved to a neighboring square (horizontally or vertically) so that no two are moved onto the same square. No pawn can be moved along the same line in two successive moves. What is largest number of pawns can a player place on the board (being able to arrange them freely) so as to be able to continue the game indefinitely?

16 NHL teams in the first playoff round divided in pairs and to play series until 4 wins (thus the series could finish with score 4-0, 4-1, 4-2, or 4-3). After that 8 winners of the series play the second playoff round divided into 4 pairs to play series until 4 wins, and so on. After all the final round is over, it happens that $k$ teams have non-negative balance of wins (for example, the team that won in the first round with a score of 4-2 and lost in the second with a score of 4-3 fits the condition: it has $4+3=7$ wins and $2+4=6$ losses). Find the least possible $k$.

Alex, Bob, Charlie, Daniel, and Ethan are five classmates. Some pairs of them are friends. How many possible ways are there for them to be friends such that everyone has at least one friend, and such that there is exactly one loop of friends among the five classmates? Note: friendship is two-way, so if person x is friends with person y then person y is friends with person $x$.

A game of Jai Alai has eight players and starts with players $P_1$ and $P_2$ on court and the other players $P_3, P_4, P_5, P_6, P_7, P_8$ waiting in a queue. After each point is played, the loser goes to the end of the queue; the winner adds $1$ point to his score and stays on the court; and the player at the head of the queue comes on to contest the next point. Play continues until someone has scored $7$ points. At that moment, we observe that a total of $37$ points have been scored by all eight players. Determine who has won and justify your answer.

A game is played on a board with an infinite row of holes labelled $0, 1, 2, \dots$. Initially, $2009$ pebbles are put into hole $1$; the other holes are left empty. Now steps are performed according to the following scheme: (i) At each step, two pebbles are removed from one of the holes (if possible), and one pebble is put into each of the neighbouring holes. (ii) No pebbles are ever removed from hole $0$. (iii) The game ends if there is no hole with a positive label that contains at least two pebbles. Show that the game always terminates, and that the number of pebbles in hole $0$ at the end of the game is independent of the specific sequence of steps. Determine this number.

Paint the maximum number of vertices of the cube red so that you cannot select three of the red vertices that form an equilateral triangle.