Found problems: 1800
2007 Romania Team Selection Test, 4
Let $S$ be the set of $n$-uples $\left( x_{1}, x_{2}, \ldots, x_{n}\right)$ such that $x_{i}\in \{ 0, 1 \}$ for all $i \in \overline{1,n}$, where $n \geq 3$. Let $M(n)$ be the smallest integer with the property that any subset of $S$ with at least $M(n)$ elements contains at least three $n$-uples \[\left( x_{1}, \ldots, x_{n}\right), \, \left( y_{1}, \ldots, y_{n}\right), \, \left( z_{1}, \ldots, z_{n}\right) \] such that
\[\sum_{i=1}^{n}\left( x_{i}-y_{i}\right)^{2}= \sum_{i=1}^{n}\left( y_{i}-z_{i}\right)^{2}= \sum_{i=1}^{n}\left( z_{i}-x_{i}\right)^{2}. \]
(a) Prove that $M(n) \leq \left\lfloor \frac{2^{n+1}}{n}\right\rfloor+1$.
(b) Compute $M(3)$ and $M(4)$.
2011 Stars Of Mathematics, 4
Given $n$ sets $A_i$, with $| A_i | = n$, prove they may be indexed $A_i = \{a_{i,j} \mid j=1,2,\ldots,n \}$, in such way that the sets $B_j = \{a_{i,j} \mid i=1,2,\ldots,n \}$, $1\leq j\leq n$, also have $| B_j | = n$.
(Anonymous)
2009 USA Team Selection Test, 1
Let $m$ and $n$ be positive integers. Mr. Fat has a set $S$ containing every rectangular tile with integer side lengths and area of a power of $2$. Mr. Fat also has a rectangle $R$ with dimensions $2^m \times 2^n$ and a $1 \times 1$ square removed from one of the corners. Mr. Fat wants to choose $m + n$ rectangles from $S$, with respective areas $2^0, 2^1, \ldots, 2^{m + n - 1}$, and then tile $R$ with the chosen rectangles. Prove that this can be done in at most $(m + n)!$ ways.
[i]Palmer Mebane.[/i]
2007 Balkan MO Shortlist, C3
Three travel companies provide transportation between $n$ cities, such that each connection between a pair of cities is covered by one company only. Prove that, for $n \geq 11$, there must exist a round-trip through some four cities, using the services of a same company, while for $n < 11$ this is not anymore necessarily true.
[i]Dan Schwarz[/i]
2013 National Olympiad First Round, 12
In the morning, $100$ students study as $50$ groups with two students in each group. In the afternoon, they study again as $50$ groups with two students in each group. No matter how the groups in the morning or groups in the afternoon are established, if it is possible to find $n$ students such that no two of them study together, what is the largest value of $n$?
$
\textbf{(A)}\ 42
\qquad\textbf{(B)}\ 38
\qquad\textbf{(C)}\ 34
\qquad\textbf{(D)}\ 25
\qquad\textbf{(E)}\ \text{None of above}
$
1999 Baltic Way, 10
May the points of a disc of radius $1$ (including its circumference) be partitioned into three subsets in such a way that no subset contains two points separated by a distance $1$?
2010 Indonesia TST, 4
For each positive integer $ n$, define $ f(n)$ as the number of digits $ 0$ in its decimal representation. For example, $ f(2)\equal{}0$, $ f(2009)\equal{}2$, etc. Please, calculate \[ S\equal{}\sum_{k\equal{}1}^{n}2^{f(k)},\] for $ n\equal{}9,999,999,999$.
[i]Yudi Satria, Jakarta[/i]
2010 All-Russian Olympiad, 2
Each of $1000$ elves has a hat, red on the inside and blue on the outside or vise versa. An elf with a hat that is red outside can only lie, and an elf with a hat that is blue outside can only tell the truth. One day every elf tells every other elf, “Your hat is red on the outside.” During that day, some of the elves turn their hats inside out at any time during the day. (An elf can do that more than once per day.) Find the smallest possible number of times any hat is turned inside out.
2000 Iran MO (3rd Round), 3
Let $n$ points be given on a circle, and let $nk + 1$ chords between these points be drawn, where $2k+1 < n$. Show that it is possible to select $k+1$ of the chords so that no two of them intersect.
2009 JBMO Shortlist, 1
Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.
2006 Pre-Preparation Course Examination, 8
Suppose that $p(n)$ is the number of ways to express $n$ as a sum of some naturall numbers (the two representations $4=1+1+2$ and $4=1+2+1$ are considered the same). Prove that for an infinite number of $n$'s $p(n)$ is even and for an infinite number of $n$'s $p(n)$ is odd.
2003 Junior Tuymaada Olympiad, 1
A $2003\times 2004$ rectangle consists of unit squares. We consider rhombi formed by four diagonals of unit squares.
What maximum number of such rhombi can be arranged in this rectangle so that no two of them have any common points except vertices?
[i]Proposed by A. Golovanov[/i]
2007 Peru IMO TST, 3
Let $T$ a set with 2007 points on the plane, without any 3 collinear points.
Let $P$ any point which belongs to $T$.
Prove that the number of triangles that contains the point $P$ inside and
its vertices are from $T$, is even.
1998 Baltic Way, 20
We say that some positive integer $m$ covers the number $1998$, if $1,9,9,8$ appear in this order as digits of $m$. (For instance $1998$ is covered by $2\textbf{1}59\textbf{9}36\textbf{98}$ but not by $213326798$.) Let $k(n)$ be the number of positive integers that cover $1998$ and have exactly $n$ digits ($n\ge 5$), all different from $0$. What is the remainder of $k(n)$ on division by $8$?
1988 Federal Competition For Advanced Students, P2, 2
An equilateral triangle $ A_1 A_2 A_3$ is divided into four smaller equilateral triangles by joining the midpoints $ A_4,A_5,A_6$ of its sides. Let $ A_7,...,A_{15}$ be the midpoints of the sides of these smaller triangles. The $ 15$ points $ A_1,...,A_{15}$ are colored either green or blue. Show that with any such colouring there are always three mutually equidistant points $ A_i,A_j,A_k$ having the same color.
2009 Korea National Olympiad, 1
Let $ A = \{ 1, 2, 3, \cdots , 12 \} $. Find the number of one-to-one function $ f :A \to A $ satisfying following condition: for all $ i \in A $, $ f(i)-i $ is not a multiple of $ 3 $.
2011 Indonesia MO, 5
[asy]
draw((0,1)--(4,1)--(4,2)--(0,2)--cycle);
draw((2,0)--(3,0)--(3,3)--(2,3)--cycle);
draw((1,1)--(1,2));
label("1",(0.5,1.5));
label("2",(1.5,1.5));
label("32",(2.5,1.5));
label("16",(3.5,1.5));
label("8",(2.5,0.5));
label("6",(2.5,2.5));
[/asy]
The image above is a net of a unit cube. Let $n$ be a positive integer, and let $2n$ such cubes are placed to build a $1 \times 2 \times n$ cuboid which is placed on a floor. Let $S$ be the sum of all numbers on the block visible (not facing the floor). Find the minimum value of $n$ such that there exists such cuboid and its placement on the floor so $S > 2011$.
2014 Balkan MO Shortlist, C3
Let $n$ be a positive integer. A regular hexagon with side length $n$ is divided into equilateral triangles with side length $1$ by lines parallel to its sides.
Find the number of regular hexagons all of whose vertices are among the vertices of those equilateral triangles.
[i]UK - Sahl Khan[/i]
2012 China National Olympiad, 3
Find the smallest positive integer $k$ such that, for any subset $A$ of $S=\{1,2,\ldots,2012\}$ with $|A|=k$, there exist three elements $x,y,z$ in $A$ such that $x=a+b$, $y=b+c$, $z=c+a$, where $a,b,c$ are in $S$ and are distinct integers.
[i]Proposed by Huawei Zhu[/i]
2023 Romania EGMO TST, P1
A square with side $2008$ is broken into regions that are all squares with side $1$. In every region, either $0$ or $1$ is written, and the number of $1$'s and $0$'s is the same. The border between two of the regions is removed, and the numbers in each of them are also removed, while in the new region, their arithmetic mean is recorded. After several of those operations, there is only one square left, which is the big square itself. Prove that it is possible to perform these operations in such a way, that the final number in the big square is less than $\frac{1}{2^{10^6}}$.
2015 India Regional MathematicaI Olympiad, 6
Let $S=\{1,2,\cdots, n\}$ and let $T$ be the set of all ordered triples of subsets of $S$, say $(A_1, A_2, A_3)$, such that $A_1\cup A_2\cup A_3=S$. Determine, in terms of $n$,
\[ \sum_{(A_1,A_2,A_3)\in T}|A_1\cap A_2\cap A_3|\]
2014 Brazil National Olympiad, 3
Let $N$ be an integer, $N>2$. Arnold and Bernold play the following game: there are initially $N$ tokens on a pile. Arnold plays first and removes $k$ tokens from the pile, $1\le k < N$. Then Bernold removes $m$ tokens from the pile, $1\le m\le 2k$ and so on, that is, each player, on its turn, removes a number of tokens from the pile that is between $1$ and twice the number of tokens his opponent took last. The player that removes the last token wins.
For each value of $N$, find which player has a winning strategy and describe it.
2004 Hong kong National Olympiad, 2
In a school there $b$ teachers and $c$ students. Suppose that
a) each teacher teaches exactly $k$ students, and
b)for any two (distinct) students , exactly $h$ teachers teach both of them.
Prove that $\frac{b}{h}=\frac{c(c-1)}{k(k-1)}$.
2012 Romania Team Selection Test, 3
Find the maximum possible number of kings on a $12\times 12$ chess table so that each king attacks exactly one of the other kings (a king attacks only the squares that have a common point with the square he sits on).
2011 Pre - Vietnam Mathematical Olympiad, 2
Let $A$ be a set of finite distinct positive real numbers. Two other sets $B$, $C$ are defined by:
\[B = \left\{ {\frac{x}{y};x,y \in A} \right\},\; \; \; C = \left\{ {xy;x,y \in A} \right\}\]
Prove that $\left| A \right|.\left| B \right| \le {\left| C \right|^2}$.