Found problems: 1488
2003 Federal Competition For Advanced Students, Part 2, 2
We are given sufficiently many stones of the forms of a rectangle $2\times 1$ and square $1\times 1$. Let $n > 3$ be a natural number. In how many ways can one tile a rectangle $3 \times n$ using these stones, so that no two $2 \times 1$ rectangles have a common point, and each of them has the longer side parallel to the shorter side of the big rectangle?
2010 Korea - Final Round, 3
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$.
For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$.
Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible).
Sorry for my bad English.
2001 Hong kong National Olympiad, 4
There are $212$ points inside or on a given unit circle. Prove that there are at least $2001$ pairs of points having distances at most $1$.
2003 Tournament Of Towns, 4
There are $N$ points on the plane; no three of them belong to the same straight line. Every pair of points is connected by a segment. Some of these segments are colored in red and the rest of them in blue. The red segments form a closed broken line without self-intersections(each red segment having only common endpoints with its two neighbors and no other common points with the other segments), and so do the blue segments. Find all possible values of $N$ for which such a disposition of $N$ points and such a choice of red and blue segments are possible.
2000 Poland - Second Round, 3
On fields of $n \times n$ chessboard $n^2$ different integers have been arranged, one in each field. In each column, field with biggest number was colored in red. Set of $n$ fields of chessboard name [i]admissible[/i], if no two of that fields aren't in the same row and aren't in the same column. From all admissible sets, set with biggest sum of numbers in it's fields has been chosen. Prove that red field is in this set.
2006 German National Olympiad, 3
For which positive integer n can you color the numbers 1,2...2n with n colors, such that every color is used twice and the numbers 1,2,3...n occur as difference of two numbers of the same color exatly once.
2005 IberoAmerican, 6
Let $n$ be a fixed positive integer. The points $A_1$, $A_2$, $\ldots$, $A_{2n}$ are on a straight line. Color each point blue or red according to the following procedure: draw $n$ pairwise disjoint circumferences, each with diameter $A_iA_j$ for some $i \neq j$ and such that every point $A_k$ belongs to exactly one circumference. Points in the same circumference must be of the same color.
Determine the number of ways of coloring these $2n$ points when we vary the $n$ circumferences and the distribution of the colors.
2009 Turkey Team Selection Test, 3
Within a group of $ 2009$ people, every two people has exactly one common friend. Find the least value of the difference between the person with maximum number of friends and the person with minimum number of friends.
1988 China National Olympiad, 3
Given a finite sequence of real numbers $a_1,a_2,\dots ,a_n$ ($\ast$), we call a segment $a_k,\dots ,a_{k+l-1}$ of the sequence ($\ast$) a “[i]long[/i]”(Chinese dragon) and $a_k$ “[i]head[/i]” of the “[i]long[/i]” if the arithmetic mean of $a_k,\dots ,a_{k+l-1}$ is greater than $1988$. (especially if a single item $a_m>1988$, we still regard $a_m$ as a “[i]long[/i]”). Suppose that there is at least one “[i]long[/i]” among the sequence ($\ast$), show that the arithmetic mean of all those items of sequence ($\ast$) that could be “[i]head[/i]” of a certain “[i]long[/i]” individually is greater than $1988$.
2004 Rioplatense Mathematical Olympiad, Level 3, 3
Consider a partition of $\{1,2,\ldots,900\}$ into $30$ subsets $S_1,S_2,\ldots,S_{30}$ each with $30$ elements. In each $S_k$, we paint the fifth largest number blue. Is it possible that, for $k=1,2,\ldots,30$, the sum of the elements of $S_k$ exceeds the sum of the blue numbers?
1970 IMO Longlists, 23
Let $E$ be a finite set, $P_E$ the family of its subsets, and $f$ a mapping from $P_E$ to the set of non-negative reals, such that for any two disjoint subsets $A,B$ of $E$, $f(A\cup B)=f(A)+f(B)$. Prove that there exists a subset $F$ of $E$ such that if with each $A \subset E$, we associate a subset $A'$ consisting of elements of $A$ that are not in $F$, then $f(A)=f(A')$ and $f(A)$ is zero if and only if $A$ is a subset of $F$.
2002 India IMO Training Camp, 6
Determine the number of $n$-tuples of integers $(x_1,x_2,\cdots ,x_n)$ such that $|x_i| \le 10$ for each $1\le i \le n$ and $|x_i-x_j| \le 10$ for $1 \le i,j \le n$.
2010 Vietnam National Olympiad, 5
Let a positive integer $n$.Consider square table $3*3$.One use $n$
colors to color all cell of table such that
each cell is colored by exactly one color.
Two colored table is same if we can receive them from other by a rotation
through center of $3*3$ table
How many way to color this square table satifies above conditions.
1998 Polish MO Finals, 3
$S$ is a board containing all unit squares in the $xy$ plane whose vertices have integer coordinates and which lie entirely inside the circle $x^2 + y^2 = 1998^2$. In each square of $S$ is written $+1$. An allowed move is to change the sign of every square in $S$ in a given row, column or diagonal. Can we end up with exactly one $-1$ and $+1$ on the rest squares by a sequence of allowed moves?
2010 Bulgaria National Olympiad, 1
A table $2 \times 2010$ is divided to unit cells. Ivan and Peter are playing the following game. Ivan starts, and puts horizontal $2 \times 1$ domino that covers exactly two unit table cells. Then Peter puts vertical $1 \times 2$ domino that covers exactly two unit table cells. Then Ivan puts horizontal domino. Then Peter puts vertical domino, etc. The person who cannot put his domino will lose the game. Find who have winning strategy.
2003 Baltic Way, 10
A [i]lattice point[/i] in the plane is a point with integral coordinates. The[i] centroid[/i] of four points $(x_i,y_i )$, $i = 1, 2, 3, 4$, is the point $\left(\frac{x_1 +x_2 +x_3 +x_4}{4},\frac{y_1 +y_2 +y_3 +y_4 }{4}\right)$.
Let $n$ be the largest natural number for which there are $n$ distinct lattice points in the plane such that the centroid of any four of them is not a lattice point. Prove that $n = 12$.
2003 China Team Selection Test, 3
Let $A= \{a_1,a_2, \cdots, a_n \}$ and $B=\{b_1,b_2 \cdots, b_n \}$ be two positive integer sets and $|A \cap B|=1$. $C= \{ \text{all the 2-element subsets of A} \} \cup \{ \text{all the 2-element subsets of B} \}$. Function $f: A \cup B \to \{ 0, 1, 2, \cdots 2 C_n^2 \}$ is injective. For any $\{x,y\} \in C$, denote $|f(x)-f(y)|$ as the $\textsl{mark}$ of $\{x,y\}$. If $n \geq 6$, prove that at least two elements in $C$ have the same $\textsl{mark}$.
1988 IMO Longlists, 72
Consider $h+1$ chess boards. Number the squares of each board from 1 to 64 in such a way that when the perimeters of any two boards of the collection are brought into coincidence in any possible manner, no two squares in the same position have the same number. What is the maximum value of $h?$
2014 South East Mathematical Olympiad, 8
Define a figure which is constructed by unit squares "cross star" if it satisfies the following conditions:
$(1)$Square bar $AB$ is bisected by square bar $CD$
$(2)$At least one square of $AB$ lay on both sides of $CD$
$(3)$At least one square of $CD$ lay on both sides of $AB$
There is a rectangular grid sheet composed of $38\times 53=2014$ squares,find the number of such cross star in this rectangle sheet
1986 Kurschak Competition, 3
A and B plays the following game: they choose randomly $k$ integers from $\{1,2,\dots,100\}$; if their sum is even, A wins, else B wins. For what values of $k$ does A and B have the same chance of winning?
2014 International Zhautykov Olympiad, 2
Let $U=\{1, 2,\ldots, 2014\}$. For positive integers $a$, $b$, $c$ we denote by $f(a, b, c)$ the number of ordered 6-tuples of sets $(X_1,X_2,X_3,Y_1,Y_2,Y_3)$ satisfying the following conditions:
(i) $Y_1 \subseteq X_1 \subseteq U$ and $|X_1|=a$;
(ii) $Y_2 \subseteq X_2 \subseteq U\setminus Y_1$ and $|X_2|=b$;
(iii) $Y_3 \subseteq X_3 \subseteq U\setminus (Y_1\cup Y_2)$ and $|X_3|=c$.
Prove that $f(a,b,c)$ does not change when $a$, $b$, $c$ are rearranged.
[i]Proposed by Damir A. Yeliussizov, Kazakhstan[/i]
2007 Balkan MO Shortlist, C1
For a given positive integer $n >2$, let $C_{1},C_{2},C_{3}$ be the boundaries of three convex $n-$ gons in the plane , such that
$C_{1}\cap C_{2}, C_{2}\cap C_{3},C_{1}\cap C_{3}$ are finite. Find the maximum number of points of the sets $C_{1}\cap C_{2}\cap C_{3}$.
1980 Canada National Olympiad, 4
A gambling student tosses a fair coin. She gains $1$ point for each head that turns up, and gains $2$ points for each tail that turns up. Prove that the probability of the student scoring [i]exactly[/i] $n$ points is $\frac{1}{3}\cdot\left(2+\left(-\frac{1}{2}\right)^{n}\right)$.
2011 Croatia Team Selection Test, 2
There are lamps in every field of $n\times n$ table. At start all the lamps are off. A move consists of chosing $m$ consecutive fields in a row or a column and changing the status of that $m$ lamps. Prove that you can reach a state in which all the lamps are on only if $m$ divides $n.$
2004 All-Russian Olympiad, 3
On a table there are 2004 boxes, and in each box a ball lies. I know that some the balls are white and that the number of white balls is even. In each case I may point to two arbitrary boxes and ask whether in the box contains at least a white ball lies. After which minimum number of questions I can indicate two boxes for sure, in which white balls lie?