Let $n$ be a positive with $n\geq 3$. Consider a board of $n \times n$ boxes. In each step taken the colors of the $5$ boxes that make up the figure bellow change color (black boxes change to white and white boxes change to black) The figure can be rotated $90°, 180°$ or $270°$. Firstly, all the boxes are white.Determine for what values of $n$ it can be achieved, through a series of steps, that all the squares on the board are black.

Let $ H(n)$ be the number of simply connected subsets with $ n$ hexagons in an infinite hexagonal network. Also let $ P(n)$ be the number of paths starting from a fixed vertex (that do not connect itself) with lentgh $ n$ in this hexagonal network. a) Prove that the limits \[ \alpha: \equal{}\lim_{n\rightarrow\infty}H(n)^{\frac1n}, \beta: \equal{}\lim_{n\rightarrow\infty}P(n)^{\frac1n}\]exist. b) Prove the following inequalities: $ \sqrt2\leq\beta\leq2$ $ \alpha\leq 12.5$ $ \alpha\geq3.5$ $ \alpha\leq\beta^4$

A [i]discrete hexagon with center \((a,b,c)\) \emph{(where \(a\), \(b\), \(c\) are integers)[/i] and radius \(r\) [i](a nonnegative integer)[/i]} is the set of lattice points \((x,y,z)\) such that \(x+y+z=a+b+c\) and \(\max(|x-a|,|y-b|,|z-c|)\le r\). Let \(n\) be a nonnegative integer and \(S\) be the set of triples \((x,y,z)\) of nonnegative integers such that \(x+y+z=n\). If \(S\) is partitioned into discrete hexagons, show that at least \(n+1\) hexagons are needed. [i]Proposed by Linus Tang[/i]

There are $n\ge 2$ line segments in the plane such that every two segments cross and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it facing the other endpoint. Then he will clap his hands $n-1$ times. Every time he claps,each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time. (a) Prove that Geoff can always fulfill his wish if $n$ is odd. (b) Prove that Geoff can never fulfill his wish if $n$ is even.

From the set of all permutations $f$ of $\{1, 2, ... , n\}$ that satisfy the condition: $f(i) \geq i-1$ $i=1,...,n$ one is chosen uniformly at random. Let $p_n$ be the probability that the chosen permutation $f$ satisfies $f(i) \leq i+1$ $i=1,...,n$ Find all natural numbers $n$ such that $p_n > \frac{1}{3}$.

There are $2008$ blue, $2009$ red and $2010$ yellow chips on a table. At each step, one chooses two chips of different colors, and recolor both of them using the third color. Can all the chips be of the same color after some steps? Prove your answer.

The positive integers $1,2,...,121$ are arranged in the squares of a $11 \times 11$ table. Dima found the product of numbers in each row and Sasha found the product of the numbers in each column. Could they get the same set of $11$ numbers? [i]Proposed by S. Berlov[/i]

The set $X$ of $N$ four-digit numbers formed from the digits $1,2,3,4,5,6,7,8$ satisfies the following condition: [i]for any two different digits from $1,2,3,4,,6,7,8$ there exists a number in $X$ which contains both of them. [/i]\\ Determine the smallest possible value of $N$.

A set of $n$ lines are said to be in [i]standard form[/i] if no two are parallel and no three are concurrent. Does there exist a value of $k$ such that given any $n$ lines in [i]standard form[/i], it is possible to colour the regions bounded by the $n$ lines using $k$ colours in such a way that no two regions of the same colour share a common intersection point of the $n$ lines?

Nicu plays the Next game on the computer. Initially the number $S$ in the computer has the value $S = 0$. At each step Nicu chooses a certain number $a$ ($0 <a <1$) and enters it in computer. The computer arbitrarily either adds this number $a$ to the number $S$ or it subtracts from $S$ and displays on the screen the new result for $S$. After that Nicu does Next step. It is known that among any $100$ consecutive operations the computer the at least once apply the assembly. Give an arbitrary number $M> 0$. Show that there is a strategy for Nicu that will always allow him after a finite number of steps to get a result $S> M$. [hide=original wording]Nicu joacă la calculator următorul joc. Iniţial numărul S din calculator are valoarea S = 0. La fiecare pas Nicu alege un număr oarecare a (0 < a < 1) şi îl introduce în calculator. Calculatorul, în mod arbitrar, sau adună acest număr a la numărul S sau îl scade din S şi afişează pe ecran rezultatul nou pentru S. După aceasta Nicu face următorul pas. Se ştie că printre oricare 100 de operaţii consecutive calculatorul cel puţin o dată aplică adunarea. Fie dat un număr arbitrar M > 0. Să se arate că există o strategie pentru Nicu care oricând îi va permite lui după un număr finit de paşi să obţină un rezulat S > M.[/hide]

Let $A$ be a set containing $4k$ consecutive positive integers, where $k \geq 1$ is an integer. Find the smallest $k$ for which the set A can be partitioned into two subsets having the same number of elements, the same sum of elements, the same sum of the squares of elements, and the same sum of the cubes of elements.

Let $E$ be the set of $1983^3$ points of the space $\mathbb R^3$ all three of whose coordinates are integers between $0$ and $1982$ (including $0$ and $1982$). A coloring of $E$ is a map from $E$ to the set {red, blue}. How many colorings of $E$ are there satisfying the following property: The number of red vertices among the $8$ vertices of any right-angled parallelepiped is a multiple of $4$ ?

Let $A=\{-2562,-2561,...,2561,2562\}$. Prove that for any bijection (1-1, onto function) $f:A\to A$, $$\sum_{k=1}^{2562}\left\lvert f(k)-f(-k)\right\rvert\text{ is maximized if and only if } f(k)f(-k)<0\text{ for any } k=1,2,...,2562.$$

A knight is modified so that it moves $p$ fields horizontally or vertically and $q$ fields in the perpendicular direction. It is placed on an infinite chessboard. If the knight returns to the initial field after $n$ moves, show that $n$ must be even.

There are three sticks, each of which has an integer length which is at least $n$; the sum of their lengths is $n(n + 1)/2$. Prove that it is possible to break the sticks (possibly several times) so that the resulting sticks have length $1, 2,\dots, n$. [i]Note: a stick of length $a + b$ can be broken into sticks of lengths $a$ and $b$.[/i]

$ a)$ Two players play a cooperative game. They can discuss a strategy prior to the game, however, they cannot communicate and have no information about the other player during the game. The game master chooses one of the players in each round. The player on turn has to guess the number of the current round. Players keep note of the number of rounds they were chosen, however, they have no information about the other player's rounds. If the player's guess is correct, the players are awarded a point. Player's are not notified whether they've scored or not. The players win the game upon collecting 100 points. Does there exist a strategy with which they can surely win the game in a finite number of rounds? $b)$ How does this game change, if in each round the player on turn has two guesses instead of one, and they are awarded a point if one of the guesses is correct (while keeping all the other rules of the game the same)? [i]Proposed by Gábor Szűcs, Budapest[/i]

An infinite sequence of digits $1$ and $2$ is determined by the following two properties: i) The sequence is built by writing, in some order, blocks $12$ and blocks $112.$ ii) If each block $12$ is replaced by $1$ and each block $112$ by $2$, the same sequence is again obtained. In which position is the hundredth digit $1$? What is the thousandth digit of the sequence?

$100$ numbers $1$, $1/2$, $1/3$, $...$, $1/100$ are written on the blackboard. One may delete two arbitrary numbers $a$ and $b$ among them and replace them by the number $a + b + ab$. After $99$ such operations only one number is left. What is this final number? (D. Fomin, Leningrad)

There are seven cards in a hat, and on the card $k$ there is a number $2^{k-1}$, $k=1,2,...,7$. Solarin picks the cards up at random from the hat, one card at a time, until the sum of the numbers on cards in his hand exceeds $124$. What is the most probable sum he can get?

Let $A_1 A_2…A_{66}$ be a convex 66-gon. What’s the greatest number of pentagons $A_i A_{i+1} A_{i+2} A_{i+3} A_{i+4},1\leq i\leq 66,$ which have an inscribed circle? ($A_{66+i}\equiv A_i$).

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers, and let $b_1, b_2, \ldots, b_m$ be $m$ positive integers such that $a_1 a_2 \cdots a_n = b_1 b_2 \cdots b_m$. Prove that a rectangular table with $n$ rows and $m$ columns can be filled with positive integer entries in such a way that * the product of the entries in the $i$-th row is $a_i$ (for each $i \in \left\{1,2,\ldots,n\right\}$); * the product of the entries in the $j$-th row is $b_j$ (for each $i \in \left\{1,2,\ldots,m\right\}$).

Let \( n \) be a positive integer. A function \( f : \{0, 1, \dots, n\} \to \{0, 1, \dots, n\} \) is called \( n \)-Bolivian if it satisfies the following conditions: • \( f(0) = 0 \); • \( f(t) \in \{ t-1, f(t-1), f(f(t-1)), \dots \} \) for all \( t = 1, 2, \dots, n \). For example, if \( n = 3 \), then the function defined by \( f(0) = f(1) = 0 \), \( f(2) = f(3) = 1 \) is 3-Bolivian, but the function defined by \( f(0) = f(1) = f(2) = 0 \), \( f(3) = 1 \) is not 3-Bolivian. For a fixed positive integer \( n \), Gollum selects an \( n \)-Bolivian function. Smeagol, knowing that \( f \) is \( n \)-Bolivian, tries to figure out which function was chosen by asking questions of the type: \[ \text{How many integers } a \text{ are there such that } f(a) = b? \] given a \( b \) of his choice. Show that if Gollum always answers correctly, Smeagol can determine \( f \) and find the minimum number of questions he needs to ask, considering all possible choices of \( f \).

Given $ n$ points in a line so that any distance occurs at most twice, show that the number of distance occurring exactly once is at least $ \lfloor n/2 \rfloor$. [i]V. T. Sos, L. Szekely[/i]

A set $A$ contains exactly $n$ integers, each of which is greater than $1$ and every of their prime factors is less than $10$. Determine the smallest $n$ such that $A$ must contain at least two distinct elements $a$ and $b$ such that $ab$ is the square of an integer.

Misha has a $100$x$100$ chessboard and a bag with $199$ rooks. In one move he can either put one rook from the bag on the lower left cell of the grid, or remove two rooks which are on the same cell, put one of them on the adjacent square which is above it or right to it, and put the other in the bag. Misha wants to place exactly $100$ rooks on the board, which don't beat each other. Will he be able to achieve such arrangement?