There are eight congruent $1\times 2$ tiles formed of one blue square and one red square. In how many ways can we cover a $4\times 4$ area with these tiles so that each row and each column has two blue squares and two red squares?

Celia chooses a number $n$ and writes the list of natural numbers from $1$ to $n$: $1, 2, 3, 4, ..., n-1, n.$ At each step, it changes the list: it copies the first number to the end and deletes the first two. After $n-1$ steps a single number will be written. For example, for $n=6$ the five steps are: $$ 1,2,3,4,5,6 \to 3,4,5,6,1 \to 5,6,1,3 \to 1,3,5 \to 5,1 \to 5$$ and the number $5$ is written. Celia chose a number $n$ between $1000$ and $3000$ and after $n-1$ steps the number $1$ was written. Determine all the values of $n$ that Celia could have chosen. Justify why those values work, and the others do not.

Several black and white checkers (tokens?) are standing along the circumference. Two men remove checkers in turn. The first removes all the black ones that had at least one white neighbour, and the second -- all the white ones that had at least one black neighbour. They stop when all the checkers are of the same colour. a) Let there be $40$ checkers initially. Is it possible that after two moves of each man there will remain only one (checker)? b) Let there be $1000$ checkers initially. What is the minimal possible number of moves to reach the position when there will remain only one (checker)?

On the plane are given $ k\plus{}n$ distinct lines , where $ k>1$ is integer and $ n$ is integer as well.Any three of these lines do not pass through the same point . Among these lines exactly $ k$ are parallel and all the other $ n$ lines intersect each other.All $ k\plus{}n$ lines define on the plane a partition of triangular , polygonic or not bounded regions. Two regions are colled different, if the have not common points or if they have common points only on their boundary.A regions is called ''good'' if it contained in a zone between two parallel lines . If in a such given configuration the minimum number of ''good'' regionrs is $ 176$ and the maximum number of these regions is $ 221$, find $ k$ and $ n$. Babis

Let \(\mathbb{Z}^2\) denote the set of points in the Euclidean plane with integer coordinates. Find all functions \(f : \mathbb{Z}^2 \to [0,1]\) such that for any point \(P\), the value assigned to \(P\) is the average of all the values assigned to points in \(\mathbb{Z}^2\) whose Euclidean distance from \(P\) is exactly 2020.

Given a regular $n$-sided polygon with $n \ge 3$. Maria draws some of its diagonals in such a way that each diagonal intersects at most one of the other diagonals drawn in the interior of the polygon. Determine the maximum number of diagonals that Maria can draw in such a way. Note: Two diagonals can share a vertex of the polygon. Vertices are not part of the interior of the polygon.

The Proenc has a new $8\times 8$ chess board and requires composing it into rectangles that do not overlap, so that: (i) each rectangle has as many white squares as black ones; (ii) there are no two rectangles with the same number of squares. Determines the maximum value of $n$ for which such a decomposition is possible. For this value of $n$, determine all possible sets ${A_1,... ,A_n}$, where $A_i$ is the number of rectangle $i$ in squares, for which a decomposition of the board under the conditions intended actions is possible.

A triangular pie has the same shape as its box, except that they are mirror images of each other. We wish to cut the pie in two pieces which can t together in the box without turning either piece over. How can this be done if [list][b](a)[/b] one angle of the triangle is three times as big as another; [b](b)[/b] one angle of the triangle is obtuse and is twice as big as one of the acute angles?[/list]

Each square of the chessboard was painted in one of eight colors in such a way that the number of squares colored by all the colors are equal. Is it always possible to put $8$ rooks not threatening each other on multi-colored cells?

There are representants from $n$ different countries sit around a circular table ($n\geq2$), in such way that if two representants are from the same country, then, their neighbors to the right are not from the same country. Find, for every $n$, the maximal number of people that can be sit around the table.

Suppose $V= \mathbb{Z}_2^n$ and for a vector $x=(x_1,..x_n)$ in $V$ and permutation $\sigma$.We have $x_{\sigma}=(x_{\sigma(1)},...,x_{\sigma(n)})$ Suppose $ n=4k+2,4k+3$ and $f:V \to V$ is injective and if $x$ and $y$ differ in more than $n/2$ places then $f(x)$ and $f(y)$ differ in more than $n/2$ places. Prove there exist permutaion $\sigma$ and vector $v$ that $f(x)=x_{\sigma}+v$

求最小的 $n,$ 使得对任意有 ${1000}$ 个顶点且每个顶点度均为 ${4}$ 的简单图 $G,$ 都一定可以从中取掉 ${n}$ 条边$,$ 使 ${G}$ 变为二部图$.$

The numbers $1$ to $1024$ are written one per square on a $32 \times 32$ board, so that the first row is $1, 2, ... , 32$, the second row is $33, 34, ... , 64$ and so on. Then the board is divided into four $16 \times 16$ boards and the position of these boards is moved round clockwise, so that $AB$ goes to $DA$ $DC \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \, CB$ then each of the $16 \times 16 $ boards is divided into four equal $8 \times 8$ parts and each of these is moved around in the same way (within the $ 16 \times 16$ board). Then each of the $8 \times 8$ boards is divided into four $4 \times 4$ parts and these are moved around, then each $4 \times 4$ board is divided into $2 \times 2$ parts which are moved around, and finally the squares of each $2 \times 2$ part are moved around. What numbers end up on the main diagonal (from the top left to bottom right)?

On a circle there are 2009 nonnegative integers not greater than 100. If two numbers sit next to each other, we can increase both of them by 1. We can do this at most $ k$ times. What is the minimum $ k$ so that we can make all the numbers on the circle equal?

Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$; Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$. Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins. [i]Proposed by Hans Zantema, Netherlands[/i]

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.

Let $X$ be a finite set with $n\geqslant 3$ elements and let $A_1,A_2,\ldots, A_p$ be $3$-element subsets of $X$ satisfying $|A_i\cap A_j|\leqslant 1$ for all indices $i,j$. Show that there exists a subset $A{}$ of $X$ so that none of $A_1,A_2,\ldots, A_p$ is included in $A{}$ and $|A|\geqslant\lfloor\sqrt{2n}\rfloor$.

A deck of eight cards has cards numbered $1, 2, 3, 4, 5, 6, 7, 8$, in that order, and a deck of five cards has cards numbered $1, 2, 3, 4, 5$, in that order. The two decks are riffle-shuffled together to form a deck with $13$ cards with the cards from each deck in the same order as they were originally. Thus, numbers on the cards might end up in the order $1122334455678$ or $1234512345678$ but not $1223144553678$. Find the number of possible sequences of the $13$ numbers.

Vulcan and Neptune play a turn-based game on an infinite grid of unit squares. Before the game starts, Neptune chooses a finite number of cells to be [i]flooded[/i]. Vulcan is building a [i]levee[/i], which is a subset of unit edges of the grid (called [i]walls[/i]) forming a connected, non-self-intersecting path or loop*. The game then begins with Vulcan moving first. On each of Vulcan’s turns, he may add up to three new walls to the levee (maintaining the conditions for the levee). On each of Neptune’s turns, every cell which is adjacent to an already flooded cell and with no wall between them becomes flooded as well. Prove that Vulcan can always, in a finite number of turns, build the levee into a closed loop such that all flooded cells are contained in the interior of the loop, regardless of which cells Neptune initially floods. ----- [size=75]*More formally, there must exist lattice points $\mbox{\footnotesize \(A_0, A_1, \dotsc, A_k\)}$, pairwise distinct except possibly $\mbox{\footnotesize \(A_0 = A_k\)}$, such that the set of walls is exactly $\mbox{\footnotesize \(\{A_0A_1, A_1A_2, \dotsc , A_{k-1}A_k\}\)}$. Once a wall is built it cannot be destroyed; in particular, if the levee is a closed loop (i.e. $\mbox{\footnotesize \(A_0 = A_k\)}$) then Vulcan cannot add more walls. Since each wall has length $\mbox{\footnotesize \(1\)}$, the length of the levee is $\mbox{\footnotesize \(k\)}$.[/size]

There are $13$ stones each of which weighs an integer number of grams. It is known that any $12$ of them can be put on two pans of a balance scale, six on each pan, so that they are in equilibrium (i.e., each pan will carry an equal total weight). Prove that all stones weigh the same number of grams.

The eight points below are the vertices and the midpoints of the sides of a square. We would like to draw a number of circles through the points, in such a way that each pair of points lie on (at least) one of the circles. Determine the smallest number of circles needed to do this. [asy] unitsize(1 cm); dot((0,0)); dot((1,0)); dot((2,0)); dot((0,1)); dot((2,1)); dot((0,2)); dot((1,2)); dot((2,2)); [/asy]

There are $1978$ points in the flat plane. Each point has a circular disk with that point as its center and the radius is the distance to a fixed point. Prove that there are five of these circular disks, which together cover all $1978$ points (circular disk means: the circle and its inner area).

Jiiri and Mari both wish to tile an $n \times n$ chessboard with cards shown in the picture (each card covers exactly one square). Jiiri wants that for each two cards that have a common edge, the neighbouring parts are of different color, and Mari wants that the neighbouring parts are always of the same color. How many possibilities does Jiiri have to tile the chessboard and how many possibilities does Mari have? [img]https://cdn.artofproblemsolving.com/attachments/7/3/9c076eb17ba7ae7c000a2893c83288a94df384.png[/img]

There are two very strict laws in the country of Militaria. (i) Anyone who is shorter than $80\%$ (or more) of his “neighbours” (i.e. men living at distance less then $r$ from him) is freed from the military service. (ii) Anyone who is taller than $80\%$ (or more) of his “neighbours” (i.e. men living at distance less then $R$ from him) is allowed to serve in the police. A nice thing is that each man $X$ may choose his own (possibly different) positive numbers $r = r(X)$ and $R = R(X)$. Can it happen that $90\%$ (or more) of the men in Militaria are free from the army and, at the same time, $90\%$ (or more) of the men in Militaria are allowed to serve in the police? (The places of living of the men are fixed points in the plane.) (N Konstantinov)

Let $\mathcal{P}$ be a regular polygon, and let $\mathcal{V}$ be its set of vertices. Each point in $\mathcal{V}$ is colored red, white, or blue. A subset of $\mathcal{V}$ is [i]patriotic[/i] if it contains an equal number of points of each color, and a side of $\mathcal{P}$ is [i]dazzling[/i] if its endpoints are of different colors. Suppose that $\mathcal{V}$ is patriotic and the number of dazzling edges of $\mathcal{P}$ is even. Prove that there exists a line, not passing through any point in $\mathcal{V}$, dividing $\mathcal{V}$ into two nonempty patriotic subsets. [i]Ankan Bhattacharya[/i]