Found problems: 1488
1995 Vietnam National Olympiad, 3
Given an integer $ n\ge 2$ and a reular 2n-gon. Color all verices of the 2n-gon with n colors such that:
[b](i)[/b] Each vertice is colored by exactly one color.
[b](ii)[/b] Two vertices don't have the same color.
Two ways of coloring, satisfying the conditions above, are called equilavent if one obtained from the other by a rotation whose center is the center of polygon. Find the total number of mutually non-equivalent ways of coloring.
[i]Alternative statement:[/i]
In how many ways we can color vertices of an regular 2n-polygon using n different colors such that two adjent vertices are colored by different colors. Two colorings which can be received from each other by rotation are considered as the same.
1998 IberoAmerican, 1
There are representants from $n$ different countries sit around a circular table ($n\geq2$), in such way that if two representants are from the same country, then, their neighbors to the right are not from the same country. Find, for every $n$, the maximal number of people that can be sit around the table.
2006 MOP Homework, 2
Let m be a positive integer, and let $S=\{a_1=1, a_2, ..., a_m\}$ be a set of positive integers. Prove that there exists a positive integer $n$ with $n\le m$ and a set $T={b_1, b_2, ..., b_n}$ of positive integers such that
(a) all the subsets of $T$ have distinct sums of elements;
(b) each of the numbers $a_1$, $a_2$, ..., $a_m$ is the sum of the elements of a subset of $T$.
2006 Estonia Math Open Senior Contests, 5
Two players A and B play the following game. Initially, there are $ m$ equal positive integers $ n$ written on a blackboard. A begins and the players move alternately. The player to move chooses one of the non-zero numbers on the board. If this number k is the smallest among all positive integers on the board, the player replaces it with $ k\minus{}1$; if not, the player replaces it with the smallest positive number on the board. The player who first turns all the numbers into zeroes, wins. Who wins if both players use their best strategies?
2004 China Girls Math Olympiad, 4
A deck of $ 32$ cards has $ 2$ different jokers each of which is numbered $ 0$. There are $ 10$ red cards numbered $ 1$ through $ 10$ and similarly for blue and green cards. One chooses a number of cards from the deck. If a card in hand is numbered $ k$, then the value of the card is $ 2^k$, and the value of the hand is sum of the values of the cards in hand. Determine the number of hands having the value $ 2004$.
2005 Federal Competition For Advanced Students, Part 2, 1
The function $f : (0,...2005) \rightarrow N$ has the properties that $f(2x+1)=f(2x)$, $f(3x+1)=f(3x)$ and $f(5x+1)=f(5x)$ with $x \in (0,1,2,...,2005)$. How many different values can the function assume?
2002 Finnish National High School Mathematics Competition, 4
Convex figure $\mathcal{K}$ has the following property:
if one looks at $\mathcal{K}$ from any point of the certain circle $\mathcal{Y}$, then $\mathcal{K}$ is seen in the right angle.
Show that the figure is symmetric with respect to the centre of $\mathcal{Y.}$
1997 Taiwan National Olympiad, 9
For $n\geq k\geq 3$, let $X=\{1,2,...,n\}$ and let $F_{k}$ a the family of $k$-element subsets of $X$, any two of which have at most $k-2$ elements in common. Show that there exists a subset $M_{k}$ of $X$ with at least $[\log_{2}{n}]+1$ elements containing no subset in $F_{k}$.
1997 Vietnam Team Selection Test, 3
Let $ n$, $ k$, $ p$ be positive integers with $ 2 \le k \le \frac {n}{p \plus{} 1}$. Let $ n$ distinct points on a circle be given. These points are colored blue and red so that exactly $ k$ points are blue and, on each arc determined by two consecutive blue points in clockwise direction, there are at least $ p$ red points. How many such colorings are there?
2006 Austrian-Polish Competition, 9
We have an 8x8 chessboard with 64 squares. Then we have 3x1 dominoes which cover exactly 3 squares. Such dominoes can only be moved parallel to the borders of the chessboard and also only if the passing squares are free. If no dominoes can be moved, then the position is called stable.
a. Find the smalles number of covered squares neccessary for a stable position.
b. Prove: There exist a stable position with only one square uncovered.
c. Find all Squares which are uncoverd in at least one position of b).
2011 Estonia Team Selection Test, 6
On a square board with $m$ rows and $n$ columns, where $m\le n$, some squares are colored black in such a way that no two rows are alike. Find tha biggest integer $k$ such that, for every possible coloring to start with, one can always color $k$ columns entirely red in such a way that still no two rows are alike.
2011 Romania Team Selection Test, 3
Given a set $L$ of lines in general position in the plane (no two lines in $L$ are parallel, and no three lines are concurrent) and another line $\ell$, show that the total number of edges of all faces in the corresponding arrangement, intersected by $\ell$, is at most $6|L|$.
[i]Chazelle et al., Edelsbrunner et al.[/i]
1981 USAMO, 2
Every pair of communities in a county are linked directly by one mode of transportation; bus, train, or airplane. All three methods of transportation are used in the county with no community being serviced by all three modes and no three communities being linked pairwise by the same mode. Determine the largest number of communities in this county.
2011 Macedonia National Olympiad, 5
A table of the type $~$ $ (n_1, n_2, ... , n_m) ,\ n_1 \ge n_2 \ge ... \ge n_m $ $~$ is defined in the following way: $~$ $n_1$ $~$ squares are ordered horizontally one next to another, then $~$ $n_2$ $~$ squares are ordered horizontally beneath the already ordered $~$ $n_1$ $~$ squares. The procedure continues until a net composed of $~$ $n_1$ $~$ squares in the first row, $~$ $n_2$ $~$ in the second, $~$ $n_i$ $~$ in the $~$ $i$-th row is obtained, such that there are totally $~$ $n=n_1+n_2+...+n_m$ $~$ squares in the net. The ordered rows form a straight line on the left, as shown in the example. The obtained table is filled with the numbers from $~$ $1$ $~$ till $~$ $n$ $~$ in a way that the numbers in each row and column become greater from left to right and from top to bottom, respectively. An example of a table of the type $~$ $(5,4,2,1)$ $~$ and one possible way of filling it is attached to the post. Find the number of ways the table of type $~$ $(4,3,2)$ $~$ can be filled.
2001 Tournament Of Towns, 6
In a row are 23 boxes such that for $1\le k \le 23$, there is a box containing exactly $k$ balls. In one move, we can double the number of balls in any box by taking balls from another box which has more. Is it always possible to end up with exactly $k$ balls in the $k$-th box for $1\le k\le 23$?
2005 South East Mathematical Olympiad, 6
Let $P(A)$ be the arithmetic-means of all elements of set $A = \{ a_1, a_2, \ldots, a_n \}$, namely $P(A) = \frac{1}{n} \sum^{n}_{i=1}a_i$. We denote $B$ "balanced subset" of $A$, if $B$ is a non-empty subset of $A$ and $P(B) = P(A)$. Let set $M = \{ 1, 2, 3, 4, 5, 6, 7, 8, 9 \}$.
Find the number of all "balanced subset" of $M$.
2011 China Western Mathematical Olympiad, 3
Let $n \geq 2$ be a given integer
$a)$ Prove that one can arrange all the subsets of the set $\{1,2... ,n\}$ as a sequence of subsets $A_{1}, A_{2},\cdots , A_{2^{n}}$, such that $|A_{i+1}| = |A_{i}| + 1$ or $|A_{i}| - 1$ where $i = 1,2,3,\cdots , 2^{n}$ and $A_{2^{n} + 1} = A_{1}$
$b)$ Determine all possible values of the sum $\sum \limits_{i = 1}^{2^n} (-1)^{i}S(A_{i})$ where $S(A_{i})$ denotes the sum of all elements in $A_{i}$ and $S(\emptyset) = 0$, for any subset sequence $A_{1},A_{2},\cdots ,A_{2^n}$ satisfying the condition in $a)$
2011 Mongolia Team Selection Test, 2
Let $r$ be a given positive integer. Is is true that for every $r$-colouring of the natural numbers there exists a monochromatic solution of the equation $x+y=3z$?
(proposed by B. Batbaysgalan, folklore)
2018 China Team Selection Test, 6
Suppose $a_i, b_i, c_i, i=1,2,\cdots ,n$, are $3n$ real numbers in the interval $\left [ 0,1 \right ].$ Define $$S=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k<1 \right \}, \; \; T=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k>2 \right \}.$$ Now we know that $\left | S \right |\ge 2018,\, \left | T \right |\ge 2018.$ Try to find the minimal possible value of $n$.
2003 District Olympiad, 4
We say that a set $\displaystyle A$ of non-zero vectors from the plane has the property $\displaystyle \left( \mathcal S \right)$ iff it has at least three elements and for all $\displaystyle \overrightarrow u \in A$ there are $\displaystyle \overrightarrow v, \overrightarrow w \in A$ such that $\displaystyle \overrightarrow v \neq \overrightarrow w$ and $\displaystyle \overrightarrow u = \overrightarrow v + \overrightarrow w$.
(a) Prove that for all $\displaystyle n \geq 6$ there is a set of $\displaystyle n$ non-zero vectors, which has the property $\displaystyle \left( \mathcal S \right)$.
(b) Prove that every finite set of non-zero vectors, which has the property $\displaystyle \left( \mathcal S \right)$, has at least $\displaystyle 6$ elements.
[i]Mihai Baluna[/i]
2009 Tuymaada Olympiad, 2
An arrangement of chips in the squares of $ n\times n$ table is called [i]sparse[/i] if every $ 2\times 2$ square contains at most 3 chips. Serge put chips in some squares of the table (one in a square) and obtained a sparse arrangement. He noted however that if any chip is moved to any free square then the arrangement is no more sparce. For what $ n$ is this possible?
[i]Proposed by S. Berlov[/i]
2011 Vietnam Team Selection Test, 6
Let $n$ be an integer greater than $1.$ $n$ pupils are seated around a round table, each having a certain number of candies (it is possible that some pupils don't have a candy) such that the sum of all the candies they possess is a multiple of $n.$ They exchange their candies as follows: For each student's candies at first, there is at least a student who has more candies than the student sitting to his/her right side, in which case, the student on the right side is given a candy by that student. After a round of exchanging, if there is at least a student who has candies greater than the right side student, then he/she will give a candy to the next student sitting to his/her right side. Prove that after the exchange of candies is completed (ie, when it reaches equilibrium), all students have the same number of candies.
2007 Germany Team Selection Test, 2
Let $ n, k \in \mathbb{N}$ with $ 1 \leq k \leq \frac {n}{2} - 1.$ There are $ n$ points given on a circle. Arbitrarily we select $ nk + 1$ chords among the points on the circle. Prove that of these chords there are at least $ k + 1$ chords which pairwise do not have a point in common.
2013 India Regional Mathematical Olympiad, 3
A finite non-empty set of integers is called $3$-[i]good[/i] if the sum of its elements is divisible by $3$. Find the number of $3$-good subsets of $\{0,1,2,\ldots,9\}$.
2016 Bundeswettbewerb Mathematik, 4
There are $33$ children in a given class. Each child writes a number on the blackboard, which indicates how many other children possess the same forename as oneself. Afterwards, each child does the same thing with their surname. After they've finished, each of the numbers $0,1,2,\dots,10$ appear at least once on the blackboard.
Prove that there are at least two children in this class that have the same forename and surname.