Found problems: 1800
2009 Portugal MO, 3
Two players play the following game on a circular board with 2009 houses. The two plays put, alternatively, on an empty house, one of three pieces, called [i]explorer (E)[/i], [i]trap (T)[/i] or [i]stone (S)[/i]. A treasure is a sequence of three consecutive filled houses such that the first one (on any direction) has an explorer and the middle one doesn't have a trap. For example, [i]STE[/i] is not a treasure, while [i]TEE[/i] is a treasure. The first player forming a treasure wins. Can any of the players guarantee the victory? And, in affirmative case, who?
2011 Cono Sur Olympiad, 6
Let $Q$ be a $(2n+1) \times (2n+1)$ board. Some of its cells are colored black in such a way that every $2 \times 2$ board of $Q$ has at most $2$ black cells. Find the maximum amount of black cells that the board may have.
2004 ITAMO, 4
Antonio and Bernardo play the following game. They are given two piles of chips, one with $m$ and the other with $n$ chips. Antonio starts, and thereafter they make in turn one of the following moves:
(i) take a chip from one pile;
(ii) take a chip from each of the piles;
(ii) remove a chip from one of the piles and put it onto the other.
Who cannot make any more moves, loses. Decide, as a function of $m$ and $n$ if one of the players has a winning strategy, and in the case of the affirmative answer describe that strategy.
2016 Vietnam National Olympiad, 4
Let $m$ and $n$ be positive integers. A people planted two kind of different trees on a plot tabular grid size $ m \times n $ (each square plant one tree.) A plant called [i]inpressive[/i] if two conditions following conditions are met simultaneously:
i) The number of trees in each of kind is equal;
ii) In each row the number of tree of each kind is diffrenent not less than a half of number of cells on that row and In each colum the number of tree of each kind is diffrenent not less than a half of number of cells on that colum.
a) Find an inpressive plant when $m=n=2016$;
b) Prove that if there at least a inpressive plant then $4|m$ and $4|n$.
1996 Brazil National Olympiad, 5
There are $n$ boys $B_1, B_2, ... , B_n$ and $n$ girls $G_1, G_2, ... , G_n$. Each boy ranks the girls in order of preference, and each girl ranks the boys in order of preference. Show that we can arrange the boys and girls into n pairs so that we cannot find a boy and a girl who prefer each other to their partners.
For example if $(B_1, G_3)$ and $(B_4, G_7)$ are two of the pairs, then it must not be the case that $B_4$ prefers $G_3$ to $G_7$ and $G_3$ prefers $B_4$ to $B_1$.
2011 Pre - Vietnam Mathematical Olympiad, 3
There are $n$ students. Denoted the number of the selections to select two students (with their weights are $a$ and $b$) such that $\left| {a - b} \right| \le 1$ (kg) and $\left| {a - b} \right| \le 2$ (kg) by $A_1$ and $A_2$, respectively. Prove that $A_2<3A_1+n$.
2002 Iran Team Selection Test, 5
A school has $n$ students and $k$ classes. Every two students in the same class are friends. For each two different classes, there are two people from these classes that are not friends. Prove that we can divide students into $n-k+1$ parts taht students in each part are not friends.
2014 Dutch IMO TST, 5
On each of the $2014^2$ squares of a $2014 \times 2014$-board a light bulb is put. Light bulbs can be either on or off. In the starting situation a number of the light bulbs is on. A move consists of choosing a row or column in which at least $1007$ light bulbs are on and changing the state of all $2014$ light bulbs in this row or column (from on to off or from off to on). Find the smallest non-negative integer $k$ such that from each starting situation there is a finite sequence of moves to a situation in which at most $k$ light bulbs are on.
2012 ITAMO, 6
Determine all pairs $\{a, b\}$ of positive integers with the property that, in whatever manner you color the positive integers with two colors $A$ and $B$, there always exist two positive integers of color $A$ having their difference equal to $a$ [b]or[/b] of color $B$ having their difference equal to $b$.
1974 IMO Longlists, 10
A regular octagon $P$ is given whose incircle $k$ has diameter $1$. About $k$ is circumscribed a regular $16$-gon, which is also inscribed in $P$, cutting from $P$ eight isosceles triangles. To the octagon $P$, three of these triangles are added so that exactly two of them are adjacent and no two of them are opposite to each other. Every $11$-gon so obtained is said to be $P'$. Prove the following statement: Given a finite set $M$ of points lying in $P$ such that every two points of this set have a distance not exceeding $1$, one of the $11$-gons $P'$ contains all of $M$.
2007 IberoAmerican Olympiad For University Students, 4
Consider an infinite sequence $a_1,a_2,\cdots$ whose terms all belong to $\left\{1,2\right\}$. A positive integer with $n$ digits is said to be [i]good[/i] if its decimal representation has the form $a_ra_{r+1}\cdots a_{r+(n-1)}$, for some positive integer $r$. Suppose that there are at least $2008$ [i]good[/i] numbers with a million digits. Prove that there are at least $2008$ [i]good[/i] numbers with $2007$ digits.
2010 Korea National Olympiad, 4
There are $ n ( \ge 4 ) $ people and some people shaked hands each other. Two people can shake hands at most 1 time. For arbitrary four people $ A, B, C, D$ such that $ (A,B), (B,C), (C,D) $ shaked hands, then one of $ (A,C), (A,D), (B,D) $ shaked hand each other. Prove the following statements.
(a) Prove that $ n $ people can be divided into two groups, $ X, Y ( \ne \emptyset )$ , such that for all $ (x,y) $ where $ x \in X $ and $ y \in Y $, $ x $ and $ y $ shaked hands or $ x $ and $ y $ didn't shake hands.
(b) There exist two people $ A , B $ such that the set of people who are not $ A $ and $ B $ that shaked hands with $ A $ is same wiith the set of people who are not $ A $ and $ B $ that shaked hands with $ B $.
2006 Romania National Olympiad, 4
Let $\displaystyle n \in \mathbb N$, $\displaystyle n \geq 2$. Determine $\displaystyle n$ sets $\displaystyle A_i$, $\displaystyle 1 \leq i \leq n$, from the plane, pairwise disjoint, such that:
(a) for every circle $\displaystyle \mathcal C$ from the plane and for every $\displaystyle i \in \left\{ 1,2,\ldots,n \right\}$ we have $\displaystyle A_i \cap \textrm{Int} \left( \mathcal C \right) \neq \phi$;
(b) for all lines $\displaystyle d$ from the plane and every $\displaystyle i \in \left\{ 1,2,\ldots,n \right\}$, the projection of $\displaystyle A_i$ on $\displaystyle d$ is not $\displaystyle d$.
1995 Baltic Way, 15
A polygon with $2n+1$ vertices is given. Show that it is possible to assign numbers $1,2,\ldots ,4n+2$ to the vertices and midpoints of the sides of the polygon so that for each side the sum of the three numbers assigned to it is the same.
2010 Danube Mathematical Olympiad, 3
All sides and diagonals of a convex $n$-gon, $n\ge 3$, are coloured one of two colours. Show that there exist $\left[\frac{n+1}{3}\right]$ pairwise disjoint monochromatic segments.
[i](Two segments are disjoint if they do not share an endpoint or an interior point).[/i]
2009 Indonesia TST, 3
In how many ways we can choose 3 non empty and non intersecting subsets from $ (1,2,\ldots,2008)$.
1995 All-Russian Olympiad Regional Round, 11.4
there are some identical squares with sides parallel, in a plane. Among any $k+1$ of them, there are two with a point in common. Prove they can be divided into $2k-1$ sets, such that all the squares in one set aint pairwise disjoint.
2011 Brazil Team Selection Test, 4
Let $n$ be a fixed positive odd integer. Take $m+2$ [b]distinct[/b] points $P_0,P_1,\ldots ,P_{m+1}$ (where $m$ is a non-negative integer) on the coordinate plane in such a way that the following three conditions are satisfied:
1) $P_0=(0,1),P_{m+1}=(n+1,n)$, and for each integer $i,1\le i\le m$, both $x$- and $y$- coordinates of $P_i$ are integers lying in between $1$ and $n$ ($1$ and $n$ inclusive).
2) For each integer $i,0\le i\le m$, $P_iP_{i+1}$ is parallel to the $x$-axis if $i$ is even, and is parallel to the $y$-axis if $i$ is odd.
3) For each pair $i,j$ with $0\le i<j\le m$, line segments $P_iP_{i+1}$ and $P_jP_{j+1}$ share at most $1$ point.
Determine the maximum possible value that $m$ can take.
1999 Italy TST, 4
Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that
i) $|A_i|=3$ for each $i=1,\ldots ,m$.
ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$.
Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.
2010 Indonesia TST, 2
Given an equilateral triangle, all points on its sides are colored in one of two given colors. Prove that the is a right-angled triangle such that its three vertices are in the same color and on the sides of the equilateral triangle.
[i]Alhaji Akbar, Jakarta[/i]
2006 Vietnam National Olympiad, 3
Let $m$, $n$ be two positive integers greater than 3. Consider the table of size $m\times n$ ($m$ rows and $n$ columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions:
$-$ each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click [url=http://www.mathlinks.ro/Forum/download.php?id=4425]here[/url] to view the pictures).
In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same?
a) $m=2004$, $n=2006$;
b) $m=2005$, $n=2006$.
1990 Romania Team Selection Test, 3
Prove that for any positive integer $n$, the least common multiple of the numbers $1,2,\ldots,n$ and the least common multiple of the numbers: \[\binom{n}{1},\binom{n}{2},\ldots,\binom{n}{n}\] are equal if and only if $n+1$ is a prime number.
[i]Laurentiu Panaitopol[/i]
2002 Tournament Of Towns, 4
There's a large pile of cards. On each card a number from $1,2,\ldots n$ is written. It is known that sum of all numbers on all of the cards is equal to $k\cdot n!$ for some $k$. Prove that it is possible to arrange cards into $k$ stacks so that sum of numbers written on the cards in each stack is equal to $n!$.
2012 Middle European Mathematical Olympiad, 4
Let $ p>2 $ be a prime number. For any permutation $ \pi = ( \pi(1) , \pi(2) , \cdots , \pi(p) ) $ of the set $ S = \{ 1, 2, \cdots , p \} $, let $ f( \pi ) $ denote the number of multiples of $ p $ among the following $ p $ numbers:
\[ \pi(1) , \pi(1) + \pi(2) , \cdots , \pi(1) + \pi(2) + \cdots + \pi(p) \]
Determine the average value of $ f( \pi) $ taken over all permutations $ \pi $ of $ S $.
1992 Baltic Way, 14
There is a finite number of towns in a country. They are connected by one direction roads. It is known that, for any two towns, one of them can be reached from another one. Prove that there is a town such that all remaining towns can be reached from it.