Found problems: 1800
2005 Bulgaria Team Selection Test, 6
In a group of nine persons it is not possible to choose four persons such that every one knows the three others. Prove that this group of nine persons can be partitioned into four groups such that nobody knows anyone from his or her group.
2000 Romania Team Selection Test, 1
Let $P_1$ be a regular $n$-gon, where $n\in\mathbb{N}$. We construct $P_2$ as the regular $n$-gon whose vertices are the midpoints of the edges of $P_1$. Continuing analogously, we obtain regular $n$-gons $P_3,P_4,\ldots ,P_m$. For $m\ge n^2-n+1$, find the maximum number $k$ such that for any colouring of vertices of $P_1,\ldots ,P_m$ in $k$ colours there exists an isosceles trapezium $ABCD$ whose vertices $A,B,C,D$ have the same colour.
[i]Radu Ignat[/i]
2024 Polish Junior MO Finals, 2
Determine the smallest integer $n \ge 1$ such that a $n \times n$ square can be cut into square pieces of size $1 \times 1$ and $2 \times 2$ with both types occuring the same number of times.
2011 ELMO Shortlist, 5
Prove there exists a constant $c$ (independent of $n$) such that for any graph $G$ with $n>2$ vertices, we can split $G$ into a forest and at most $cf(n)$ disjoint cycles, where
a) $f(n)=n\ln{n}$;
b) $f(n)=n$.
[i]David Yang.[/i]
1999 Baltic Way, 6
What is the least number of moves it takes a knight to get from one corner of an $n\times n$ chessboard, where $n\ge 4$, to the diagonally opposite corner?
2011 Federal Competition For Advanced Students, Part 2, 2
We consider permutations $f$ of the set $\mathbb{N}$ of non-negative integers, i.e. bijective maps $f$ from $\mathbb{N}$ to $\mathbb{N}$, with the following additional properties: \[f(f(x)) = x \quad \mbox{and}\quad \left| f(x)-x\right| \leqslant 3\quad\mbox{for all } x \in\mathbb{N}\mbox{.}\]
Further, for all integers $n > 42$, \[\left.M(n)=\frac{1}{n+1}\sum_{j=0}^n \left|f(j)-j\right|<2,011\mbox{.}\right.\]
Show that there are infinitely many natural numbers $K$ such that $f$ maps the set \[\left\{ n\mid 0\leqslant n\leqslant K\right\}\] onto itself.
2024 ITAMO, 5
A [i]fortress[/i] is a finite collection of cells in an infinite square grid with the property that one can pass from any cell of the fortress to any other by a sequence of moves to a cell with a common boundary line (but it can have "holes").
The [i]walls[/i] of a fortress are the unit segments between cells belonging to the fortress and cells not belonging to the fortress.
The [i]area[/i] $A$ of a fortress is the number of cells it consists of. The [i]perimeter[/i] $P$ is the total length of its walls.
Each cell of the fortress can contain a [i]guard[/i] which can oversee the cells to the top, the bottom, the right and the left of this cell, up until the next wall (it also oversees its own cell).
(a) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of perimeter $P \le 2024$.
(b) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of area $A \le 2024$.
2003 Silk Road, 1
Let $a_1, a_2, ....., a_{2003}$ be sequence of reals number.
Call $a_k$ $leading$ element, if at least one of expression $a_k; a_k+a_{k+1}; a_k+a_{k+1}+a_{k+2}; ....; a_k+a{k+1}+a_{k+2}+....+a_{2003}$ is positive.
Prove, that if exist at least one $leading$ element, then sum of all $leading$'s elements is positive.
Official solution [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=125&t=365714&p=2011659#p2011659]here[/url]
2009 Balkan MO, 3
A $ 9 \times 12$ rectangle is partitioned into unit squares. The centers of all the unit squares, except for the four corner squares and eight squares sharing a common side with one of them, are coloured red. Is it possible to label these red centres $ C_1,C_2,\ldots ,C_{96}$ in such way that the following to conditions are both fulfilled
i) the distances $C_1C_2,\ldots ,C_{95}C_{96}, C_{96}C_{1}$ are all equal to $ \sqrt {13}$,
ii) the closed broken line $ C_1C_2\ldots C_{96}C_1$ has a centre of symmetry?
[i]Bulgaria[/i]
2009 Indonesia TST, 1
Ati has $ 7$ pots of flower, ordered in $ P_1,P_2,P_3,P_4,P_5,P_6,P_7$. She wants to rearrange the position of those pots to $ B_1,B_2,B_2,B_3,B_4,B_5,B_6,B_7$ such that for every positive integer $ n<7$, $ B_1,B_2,\dots,B_n$ is not the permutation of $ P_1,P_2,\dots,P_7$. In how many ways can Ati do this?
2021 JBMO TST - Turkey, 3
In a country, there are $28$ cities and between some cities there are two-way flights. In every city there is exactly one airport and this airport is either small or medium or big. For every route which contains more than two cities, doesn't contain a city twice and ends where it begins; has all types of airports. What is the maximum number of flights in this country?
2012 Iran MO (2nd Round), 2
Suppose $n$ is a natural number. In how many ways can we place numbers $1,2,....,n$ around a circle such that each number is a divisor of the sum of it's two adjacent numbers?
1978 IMO Longlists, 40
If $C^p_n=\frac{n!}{p!(n-p)!} (p \ge 1)$, prove the identity
\[C^p_n=C^{p-1}_{n-1} + C^{p-1}_{n-2} + \cdots + C^{p-1}_{p} + C^{p-1}_{p-1}\]
and then evaluate the sum
\[S = 1\cdot 2 \cdot 3 + 2 \cdot 3 \cdot 4 + \cdots + 97 \cdot 98 \cdot 99.\]
2011 Kosovo National Mathematical Olympiad, 5
Let $n>1$ be an integer and $S_n$ the set of all permutations $\pi : \{1,2,\cdots,n \} \to \{1,2,\cdots,n \}$ where $\pi$ is bijective function. For every permutation $\pi \in S_n$ we define:
\[ F(\pi)= \sum_{k=1}^n |k-\pi(k)| \ \ \text{and} \ \ M_{n}=\frac{1}{n!}\sum_{\pi \in S_n} F(\pi) \]
where $M_n$ is taken with all permutations $\pi \in S_n$. Calculate the sum $M_n$.
2003 India IMO Training Camp, 9
Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.
2003 India IMO Training Camp, 9
Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.
2011 All-Russian Olympiad, 4
A $2010\times 2010$ board is divided into corner-shaped figures of three cells. Prove that it is possible to mark one cell in each figure such that each row and each column will have the same number of marked cells.
[i]I. Bogdanov & O. Podlipsky[/i]
2006 India IMO Training Camp, 2
Let $p$ be a prime number and let $X$ be a finite set containing at least $p$ elements. A collection of pairwise mutually disjoint $p$-element subsets of $X$ is called a $p$-family. (In particular, the empty collection is a $p$-family.) Let $A$(respectively, $B$) denote the number of $p$-families having an even (respectively, odd) number of $p$-element subsets of $X$. Prove that $A$ and $B$ differ by a multiple of $p$.
2013 China Girls Math Olympiad, 3
In a group of $m$ girls and $n$ boys, any two persons either know each other or do not know each other. For any two boys and any two girls, there are at least one boy and one girl among them,who do not know each other. Prove that the number of unordered pairs of (boy, girl) who know each other does not exceed $m+\frac{n(n-1)}{2}$.
2007 IMS, 2
Does there exist two unfair dices such that probability of their sum being $j$ be a number in $\left(\frac2{33},\frac4{33}\right)$ for each $2\leq j\leq 12$?
2008 Bosnia And Herzegovina - Regional Olympiad, 4
$ n$ points (no three being collinear) are given in a plane. Some points are connected and they form $ k$ segments. If no three of these segments form triangle ( equiv. there are no three points, such that each two of them are connected) prove that $ k \leq \left \lfloor \frac {n^{2}}{4}\right\rfloor$
2004 Pre-Preparation Course Examination, 6
Let $ l,d,k$ be natural numbers. We want to prove that for large numbers $ n$, for each $ k$-coloring of the $ n$-dimensional cube with side length $ l$, there is a $ d$-dimensional subspace that all of its vertices have the same color. Let $ H(l,d,k)$ be the least number such that for $ n\geq H(l,d,k)$ the previus statement holds.
a) Prove that:
\[ H(l,d \plus{} 1,k)\leq H(l,1,k) \plus{} H(l,d,k^l)^{H(l,1,k)}
\]
b) Prove that
\[ H(l \plus{} 1,1,k \plus{} 1)\leq H(l,1 \plus{} H(l \plus{} 1,1,k),k \plus{} 1)
\]
c) Prove the statement of problem.
d) Prove Van der Waerden's Theorem.
2012 Pan African, 1
The numbers $\frac{1}{1}, \frac{1}{2}, \cdots , \frac{1}{2012}$ are written on the blackboard. Aïcha chooses any two numbers from the blackboard, say $x$ and $y$, erases them and she writes instead the number $x + y + xy$. She continues to do this until only one number is left on the board. What are the possible values of the final number?
1997 Pre-Preparation Course Examination, 4
Let $n \geq 3$ be an integer. Consider the set $A=\{1,2,3,\ldots,n\}$, in each move, we replace the numbers $i, j$ by the numbers $i+j$ and $|i-j|$. After doing such moves all of the numbers are equal to $k$. Find all possible values for $k$.
1997 All-Russian Olympiad, 4
The Judgment of the Council of Sages proceeds as follows: the king arranges the sages in a line and places either a white hat or a black hat on each sage's head. Each sage can see the color of the hats of the sages in front of him, but not of his own hat or of the hats of the sages behind him. Then one by one (in an order of their choosing), each sage guesses a color. Afterward, the king executes those sages who did not correctly guess the color of their own hat. The day before, the Council meets and decides to minimize the number of executions. What is the smallest number of sages guaranteed to survive in this case?
See also [url]http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=530553[/url]