Found problems: 1488
1988 Romania Team Selection Test, 16
The finite sets $A_1$, $A_2$, $\ldots$, $A_n$ are given and we denote by $d(n)$ the number of elements which appear exactly in an odd number of sets chosen from $A_1$, $A_2$, $\ldots$, $A_n$. Prove that for any $k$, $1\leq k\leq n$ the number \[{ d(n) - \sum\limits^n_{i=1} |A_i| + 2\sum\limits_{ i<j} |A_i \cap A_j | - \cdots + (-1)^k2^{k-1} \sum\limits_{i_1 <i_2 <\cdots < i_k} | A_{i_1} \cap A_{i_2} \cap \cdots \cap A_{i_k}}| \] is divisible by $2^k$.
[i]Ioan Tomescu, Dragos Popescu[/i]
2006 Estonia National Olympiad, 5
A pawn is placed on a square of a $ n \times n$ board. There are two types of legal
moves: (a) the pawn can be moved to a neighbouring square, which shares a common side with the current square; or (b) the pawn can be moved to a neighbouring square, which shares a common vertex, but not a common side with the current square. Any two consecutive moves must be of different type. Find all integers $ n \ge 2$, for which it is possible to choose an initial square and a sequence of moves such that the pawn visits each square exactly once (it is not required that the pawn returns to the initial square).
2011 South africa National Olympiad, 4
An airline company is planning to introduce a network of connections between the ten different airports of Sawubonia. The airports are ranked by priority from first to last (with no ties). We call such a network [i]feasible[/i] if it satisfies the following conditions:
[list]
[*] All connections operate in both directions
[*] If there is a direct connection between two airports A and B, and C has higher priority than B, then there must also be a direct connection between A and C.[/list]
Some of the airports may not be served, and even the empty network (no connections at all) is allowed. How many feasible networks are there?
2001 IberoAmerican, 1
Find the maximum number of increasing arithmetic progressions that can have a finite sequence of real numbers $a_1<a_2<\cdots<a_n$ of $n\ge 3$ real numbers.
2004 South East Mathematical Olympiad, 4
Given a positive integer $n (n>2004)$, we put 1, 2, 3, …,$n^2$ into squares of an $n\times n$ chessboard with one number in a square. A square is called a “good square” if the square satisfies following conditions:
1) There are at least 2004 squares that are in the same row with the square such that any number within these 2004 squares is less than the number within the square.
2) There are at least 2004 squares that are in the same column with the square such that any number within these 2004 squares is less than the number within the square.
Find the maximum value of the number of the “good square”.
2013 Kurschak Competition, 3
Is it true that for integer $n\ge 2$, and given any non-negative reals $\ell_{ij}$, $1\le i<j\le n$, we can find a sequence $0\le a_1,a_2,\ldots,a_n$ such that for all $1\le i<j\le n$ to have $|a_i-a_j|\ge \ell_{ij}$, yet still $\sum_{i=1}^n a_i\le \sum_{1\le i<j\le n}\ell_{ij}$?
2012 Vietnam Team Selection Test, 2
Consider a $m\times n$ rectangular grid with $m$ rows and $n$ columns. There are water fountains on some of the squares. A water fountain can spray water onto any of it's adjacent squares, or a square in the same column such that there is exactly one square between them. Find the minimum number of fountains such that each square can be sprayed in the case that
a) $m=4$;
b) $m=3$.
2011 Turkey MO (2nd round), 1
$n\geq2$ and $E=\left \{ 1,2,...,n \right \}. A_1,A_2,...,A_k$ are subsets of $E$, such that for all $1\leq{i}<{j}\leq{k}$ Exactly one of $A_i\cap{A_j},A_i'\cap{A_j},A_i\cap{A_j'},A_i'\cap{A_j'}$ is empty set. What is the maximum possible $k$?
1999 All-Russian Olympiad, 5
An equilateral triangle of side $n$ is divided into equilateral triangles of side $1$. Find the greatest possible number of unit segments with endpoints at vertices of the small triangles that can be chosen so that no three of them are sides of a single triangle.
1988 IMO Longlists, 46
$A_1, A_2, \ldots, A_{29}$ are $29$ different sequences of positive integers. For $1 \leq i < j \leq 29$ and any natural number $x,$ we define $N_i(x) =$ number of elements of the sequence $A_i$ which are less or equal to $x,$ and $N_{ij}(x) =$ number of elements of the intersection $A_i \cap A_j$ which are less than or equal to $x.$ It is given for all $1 \leq i \leq 29$ and every natural number $x,$ \[ N_i(x) \geq \frac{x}{e}, \] where $e = 2.71828 \ldots$ Prove that there exist at least one pair $i,j$ ($1 \leq i < j \leq 29$) such that \[ N_{ij}(1988) > 200. \]
2011 Korea National Olympiad, 4
Let $k,n$ be positive integers. There are $kn$ points $P_1, P_2, \cdots, P_{kn}$ on a circle. We can color each points with one of color $ c_1, c_2, \cdots , c_k $. In how many ways we can color the points satisfying the following conditions?
(a) Each color is used $ n $ times.
(b) $ \forall i \not = j $, if $ P_a $ and $ P_b $ is colored with color $ c_i $ , and $ P_c $ and $ P_d $ is colored with color $ c_j $, then the segment $ P_a P_b $ and segment $ P_c P_d $ doesn't meet together.
2009 Hong Kong TST, 4
In a school there are 2008 students. Students are members of certain committees. A committee has at most 1004 members and every two students join a common committee.
(a) Determine the smallest possible number of committees in the school.
(b) If it is further required that the union of any two committees consists of at most 1800 students, will your answer in (a) still hold?
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}$.
2009 India Regional Mathematical Olympiad, 4
Find the sum of all 3-digit natural numbers which contain at least one odd digit and at least one even digit.
2012 South East Mathematical Olympiad, 4
Let positive integers $m,n$ satisfy $n=2^m-1$. $P_n =\{1,2,\cdots ,n\}$ is a set that contains $n$ points on an axis. A grasshopper on the axis can leap from one point to another adjacent point. Find the maximal value of $m$ satisfying following conditions:
(a) $x, y$ are two arbitrary points in $P_n$;
(b) starting at point $x$, the grasshopper leaps $2012$ times and finishes at point $y$; (the grasshopper is allowed to travel $x$ and $y$ more than once)
(c) there are even number ways for the grasshopper to do (b).
2006 China Northern MO, 7
Can we put positive integers $1,2,3, \cdots 64$ into $8 \times 8$ grids such that the sum of the numbers in any $4$ grids that have the form like $T$ ( $3$ on top and $1$ under the middle one on the top, this can be rotate to any direction) can be divided by $5$?
2005 China Team Selection Test, 3
We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions:
(1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal.
(2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal.
Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.
2014 Iran MO (2nd Round), 1
A basket is called "[i]Stuff Basket[/i]" if it includes $10$ kilograms of rice and $30$ number of eggs. A market is to distribute $100$ Stuff Baskets. We know that there is totally $1000$ kilograms of rice and $3000$ number of eggs in the baskets, but some of market's baskets include either more or less amount of rice or eggs. In each step, market workers can select two baskets and move an arbitrary amount of rice or eggs between selected baskets. Starting from an arbitrary situation, what's the minimum number of steps that workers provide $100$ Stuff Baskets?
1990 IMO Longlists, 32
Using following five figures, can a parallelepiped be constructed, whose side lengths are all integers larger than $1$ and has volume $1990$ ? (In the figure, every square represents a unit cube.)
\[\text{Squares are the same and all are } \Huge{1 \times 1}\]
[asy]
import graph; size(400); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen xdxdff = rgb(0.49,0.49,1);
draw((2,4)--(0,4),linewidth(2pt)); draw((0,4)--(0,0),linewidth(2pt)); draw((0,0)--(2,0),linewidth(2pt)); draw((2,0)--(2,1),linewidth(2pt)); draw((2,1)--(0,1),linewidth(2pt)); draw((1,0)--(1,4),linewidth(2pt)); draw((2,4)--(2,3),linewidth(2pt)); draw((2,3)--(0,3),linewidth(2pt)); draw((0,2)--(1,2),linewidth(2pt));
label("(1)", (0.56,-1.54), SE*lsf); draw((4,2)--(4,1),linewidth(2pt)); draw((7,2)--(7,1),linewidth(2pt)); draw((4,2)--(7,2),linewidth(2pt)); draw((4,1)--(7,1),linewidth(2pt)); draw((6,0)--(6,3),linewidth(2pt)); draw((5,3)--(5,0),linewidth(2pt)); draw((5,0)--(6,0),linewidth(2pt)); draw((5,3)--(6,3),linewidth(2pt)); label("(2)", (5.13,-1.46), SE*lsf); draw((9,0)--(9,3),linewidth(2pt)); draw((10,3)--(10,0),linewidth(2pt)); draw((12,3)--(12,0),linewidth(2pt)); draw((11,0)--(11,3),linewidth(2pt)); draw((9,2)--(12,2),linewidth(2pt)); draw((12,1)--(9,1),linewidth(2pt)); draw((9,3)--(10,3),linewidth(2pt)); draw((11,3)--(12,3),linewidth(2pt)); draw((12,0)--(11,0),linewidth(2pt)); draw((9,0)--(10,0),linewidth(2pt)); label("(3)", (10.08,-1.48), SE*lsf); draw((14,1)--(17,1),linewidth(2pt)); draw((15,2)--(17,2),linewidth(2pt)); draw((15,2)--(15,0),linewidth(2pt)); draw((15,0)--(14,0)); draw((14,1)--(14,0),linewidth(2pt)); draw((16,2)--(16,0),linewidth(2pt)); label("(4)", (15.22,-1.5), SE*lsf); draw((14,0)--(16,0),linewidth(2pt)); draw((17,2)--(17,1),linewidth(2pt)); draw((19,3)--(19,0),linewidth(2pt)); draw((20,3)--(20,0),linewidth(2pt)); draw((20,3)--(19,3),linewidth(2pt)); draw((19,2)--(20,2),linewidth(2pt)); draw((19,1)--(20,1),linewidth(2pt)); draw((20,0)--(19,0),linewidth(2pt)); label("(5)", (19.11,-1.5), SE*lsf); dot((0,0),ds); dot((0,1),ds); dot((0,2),ds); dot((0,3),ds); dot((0,4),ds); dot((1,4),ds); dot((2,4),ds); dot((2,3),ds); dot((1,3),ds); dot((1,2),ds); dot((1,1),ds); dot((2,1),ds); dot((2,0),ds); dot((1,0),ds); dot((5,0),ds); dot((6,0),ds); dot((5,1),ds); dot((6,1),ds); dot((5,2),ds); dot((6,2),ds); dot((5,3),ds); dot((6,3),ds); dot((7,2),ds); dot((7,1),ds); dot((4,1),ds); dot((4,2),ds); dot((9,0),ds); dot((9,1),ds); dot((9,2),ds); dot((9,3),ds); dot((10,0),ds); dot((11,0),ds); dot((12,0),ds); dot((10,1),ds); dot((10,2),ds); dot((10,3),ds); dot((11,1),ds); dot((11,2),ds); dot((11,3),ds); dot((12,1),ds); dot((12,2),ds); dot((12,3),ds); dot((14,0),ds); dot((15,0),ds); dot((16,0),ds); dot((15,1),ds); dot((14,1),ds); dot((16,1),ds); dot((15,2),ds); dot((16,2),ds); dot((17,2),ds); dot((17,1),ds); dot((19,0),ds); dot((20,0),ds); dot((19,1),ds); dot((20,1),ds); dot((19,2),ds); dot((20,2),ds); dot((19,3),ds); dot((20,3),ds); clip((-0.41,-10.15)--(-0.41,8.08)--(21.25,8.08)--(21.25,-10.15)--cycle);
[/asy]
2000 APMO, 2
Find all permutations $a_1, a_2, \ldots, a_9$ of $1, 2, \ldots, 9$ such that \[ a_1+a_2+a_3+a_4=a_4+a_5+a_6+a_7= a_7+a_8+a_9+a_1 \]
and
\[ a_1^2+a_2^2+a_3^2+a_4^2=a_4^2+a_5^2+a_6^2+a_7^2= a_7^2+a_8^2+a_9^2+a_1^2 \]
1997 Hungary-Israel Binational, 3
Can a closed disk can be decomposed into a union of two congruent parts having no common point?
2005 All-Russian Olympiad, 4
Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?
2006 Bulgaria Team Selection Test, 3
[b]Problem 6.[/b] Let $p>2$ be prime. Find the number of the subsets $B$ of the set $A=\{1,2,\ldots,p-1\}$ such that, the sum of the elements of $B$ is divisible by $p.$
[i] Ivan Landgev[/i]
2007 Tournament Of Towns, 3
Michael is at the centre of a circle of radius $100$ metres. Each minute, he will announce the direction in which he will be moving. Catherine can leave it as is, or change it to the opposite direction. Then Michael moves exactly $1$ metre in the direction determined by Catherine. Does Michael have a strategy which guarantees that he can get out of the circle, even though Catherine will try to stop him?
2007 Croatia Team Selection Test, 4
Given a finite string $S$ of symbols $X$ and $O$, we write $@(S)$ for the number of $X$'s in $S$ minus the number of $O$'s. (For example, $@(XOOXOOX) =-1$.) We call a string $S$ [b]balanced[/b] if every substring $T$ of (consecutive symbols) $S$ has the property $-2 \leq @(T) \leq 2$. (Thus $XOOXOOX$ is not balanced since it contains the sub-string $OOXOO$ whose $@$-value is $-3$.) Find, with proof, the number of balanced strings of length $n$.