Found problems: 1800
2010 Poland - Second Round, 3
The $n$-element set of real numbers is given, where $n \geq 6$. Prove that there exist at least $n-1$ two-element subsets of this set, in which the arithmetic mean of elements is not less than the arithmetic mean of elements in the whole set.
2008 Kyiv Mathematical Festival, 5
Some $ m$ squares on the chessboard are marked. If among four squares at the intersection of some two rows and two columns three squares are marked then it is allowed to mark the fourth square. Find the smallest $ m$ for which it is possible to mark all squares after several such operations.
2010 Abels Math Contest (Norwegian MO) Final, 3
$ a)$
There are $ 25$ participants in a mathematics contest having four problems. Each problem is considered solved or not solved (that is, partial solutions are not possible). Show that either there are four contestants having solved the same problems (or not having solved any of them), or two contestants, one of which has solved exactly the problems that the other did not solve.
$ b)$
There are $ k$ sport clubs for the students of a secondary school. The school has $ 100$ students, and for any selection of three of them, there exists a club having at least one of them, but not all, as a member. What is the least possible value of $ k$?
2006 Moldova MO 11-12, 3
On each of the 2006 cards a natural number is written. Cards are placed arbitrarily in a row. 2 players take in turns a card from any end of the row until all the cards are taken. After that each player calculates sum of the numbers written of his cards. If the sum of the first player is not less then the sum of the second one then the first player wins. Show that there's a winning strategy for the first player.
2009 Baltic Way, 19
In a party of eight people, each pair of people either know each other or do not know each other. Each person knows exactly three of the others. Determine whether the following two conditions can be satisfied simultaneously:
[list]
– for any three people, at least two do not know each other;
– for any four people there are at least two who know each other.
[/list]
2010 ELMO Shortlist, 5
Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence.
[list]
[*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence.
[*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list]
[i]Mitchell Lee and Benjamin Gunby.[/i]
2009 Cuba MO, 2
In Hidro planet were living $2008^2$ hydras some time ago. One of them had 1 tentacle, other 2 and so on to the last with $2008^2$ tentacles. Let $t(H)$ be the number of tentacles of hydra $H$. The pairing of $H_1$ and $H_2$ (where $t(H_1) < t(H_2)$) is a new hydra with $t(H_2)-t(H_1)+8$ tentacles, in case of $t(H_1)=t(H_2)$ they die. An expedition found in Hidro the last hydra with 23 tentacles. That could be true ?
2015 China Team Selection Test, 3
Fix positive integers $k,n$. A candy vending machine has many different colours of candy, where there are $2n$ candies of each colour. A couple of kids each buys from the vending machine $2$ candies of different colours. Given that for any $k+1$ kids there are two kids who have at least one colour of candy in common, find the maximum number of kids.
2006 Canada National Olympiad, 3
In a rectangular array of nonnegative reals with $m$ rows and $n$ columns, each row and each column contains at least one positive element. Moreover, if a row and a column intersect in a positive element, then the sums of their elements are the same. Prove that $m=n$.
2014 Contests, 1
Suppose a class contains $100$ students. Let, for $1\le i\le 100$, the $i^{\text{th}}$ student have $a_i$ many friends. For $0\le j\le 99$ let us define $c_j$ to be the number of students who have strictly more than $j$ friends. Show that \begin{align*} & \sum_{i=1}^{100}a_i=\sum_{j=0}^{99}c_j \end{align*}
2012 Iran MO (3rd Round), 2
Consider a set of $n$ points in plane. Prove that the number of isosceles triangles having their vertices among these $n$ points is $\mathcal O (n^{\frac{7}{3}})$. Find a configuration of $n$ points in plane such that the number of equilateral triangles with vertices among these $n$ points is $\Omega (n^2)$.
2000 Hungary-Israel Binational, 1
Let $A$ and $B$ be two subsets of $S = \{1, 2, . . . , 2000\}$ with $|A| \cdot |B| \geq 3999$. For a set $X$ , let $X-X$ denotes the set $\{s-t | s, t \in X, s \not = t\}$. Prove that $(A-A) \cap (B-B)$ is nonempty.
2002 Balkan MO, 1
Consider $n$ points $A_1,A_2,A_3,\ldots, A_n$ ($n\geq 4$) in the plane, such that any three are not collinear. Some pairs of distinct points among $A_1,A_2,A_3,\ldots, A_n$ are connected by segments, such that every point is connected with at least three different points. Prove that there exists $k>1$ and the distinct points $X_1,X_2,\ldots, X_{2k}$ in the set $\{A_1,A_2,A_3,\ldots, A_n\}$, such that for every $i\in \overline{1,2k-1}$ the point $X_i$ is connected with $X_{i+1}$, and $X_{2k}$ is connected with $X_1$.
2007 Baltic Way, 6
Freddy writes down numbers $1, 2,\ldots ,n$ in some order. Then he makes a list of all pairs $(i, j)$ such that $1\le i<j\le n$ and the $i$-th number is bigger than the $j$-th number in his permutation. After that, Freddy repeats the following action while possible: choose a pair $(i, j)$ from the current list, interchange the $i$-th and the $j$-th number in the current permutation, and delete $(i, j)$ from the list. Prove that Freddy can choose pairs in such an order that, after the process finishes, the numbers in the permutation are in ascending order.
2008 Junior Balkan Team Selection Tests - Moldova, 4
The square table $ 10\times 10$ is divided in squares $ 1\times1$. In each square $ 1\times1$ is written one of the numers $ \{1,2,3,...,9,10\}$. Numbers from any two adjacent or diagonally adjacent squares are reciprocal prime. Prove, that there exists a number, which is written in this table at least 17 times.
2010 Turkey MO (2nd round), 3
Let $K$ be the set of all sides and diagonals of a convex $2010-gon$ in the plane. For a subset $A$ of $K,$ if every pair of line segments belonging to $A$ intersect, then we call $A$ as an [i]intersecting set.[/i] Find the maximum possible number of elements of union of two [i]intersecting sets.[/i]
1988 Romania Team Selection Test, 5
The cells of a $11\times 11$ chess-board are colored in 3 colors. Prove that there exists on the board a $m\times n$ rectangle such that the four cells interior to the rectangle and containing the four vertices of the rectangle have the same color.
[i]Ioan Tomescu[/i]
2010 Switzerland - Final Round, 10
Let $ n\geqslant 3$ and $ P$ a convex $ n$-gon. Show that $ P$ can be, by $ n \minus{} 3$ non-intersecting diagonals, partitioned in triangles such that the circumcircle of each triangle contains the whole area of $ P$. Under which conditions is there exactly one such triangulation?
1997 Baltic Way, 19
In a forest each of $n$ animals ($n\ge 3$) lives in its own cave, and there is exactly one separate path between any two of these caves. Before the election for King of the Forest some of the animals make an election campaign. Each campaign-making animal visits each of the other caves exactly once, uses only the paths for moving from cave to cave, never turns from one path to another between the caves and returns to its own cave in the end of its campaign. It is also known that no path between two caves is used by more than one campaign-making animal.
a) Prove that for any prime $n$, the maximum possible number of campaign-making animals is $\frac{n-1}{2}$.
b) Find the maximum number of campaign-making animals for $n=9$.
2014 Turkey Team Selection Test, 1
Find the number of $(a_1,a_2, ... ,a_{2014})$ permutations of the $(1,2, . . . ,2014)$ such that, for all $1\leq i<j\leq2014$, $i+a_i \leq j+a_j$.
1984 Iran MO (2nd round), 4
Find number of terms when we expand $(a+b+c)^{99}$ (in the general case).
2010 Contests, 1
There are several candles of the same size on the Chapel of Bones. On the first day a candle is lit for a hour. On the second day two candles are lit for a hour, on the third day three candles are lit for a hour, and successively, until the last day, when all the candles are lit for a hour. On the end of that day, all the candles were completely consumed. Find all the possibilities for the number of candles.
2007 China Team Selection Test, 2
Given an integer $ k > 1.$ We call a $ k \minus{}$digits decimal integer $ a_{1}a_{2}\cdots a_{k}$ is $ p \minus{}$monotonic, if for each of integers $ i$ satisfying $ 1\le i\le k \minus{} 1,$ when $ a_{i}$ is an odd number, $ a_{i} > a_{i \plus{} 1};$ when $ a_{i}$ is an even number, $ a_{i}<a_{i \plus{} 1}.$ Find the number of $ p \minus{}$monotonic $ k \minus{}$digits integers.
2011 Bosnia Herzegovina Team Selection Test, 1
Find maximum value of number $a$ such that for any arrangement of numbers $1,2,\ldots ,10$ on a circle, we can find three consecutive numbers such their sum bigger or equal than $a$.
2007 District Olympiad, 2
In an urn we have red and blue balls. A person has invented the next game: he extracts balls until he realises for the first time that the number of blue balls is equal to the number of red balls. After a such game he finds out that he has extracted 10 balls, and that there does not exist 3 consecutive balls of the same color. Prove that the fifth and the sixth balls have different collors.