Found problems: 1800
2002 China Western Mathematical Olympiad, 4
Assume that $ S\equal{}(a_1, a_2, \cdots, a_n)$ consists of $ 0$ and $ 1$ and is the longest sequence of number, which satisfies the following condition: Every two sections of successive $ 5$ terms in the sequence of numbers $ S$ are different, i.e., for arbitrary $ 1\le i<j\le n\minus{}4$, $ (a_i, a_{i\plus{}1}, a_{i\plus{}2}, a_{i\plus{}3}, a_{i\plus{}4})$ and $ (a_j, a_{j\plus{}1}, a_{j\plus{}2}, a_{j\plus{}3}, a_{j\plus{}4})$ are different. Prove that the first four terms and the last four terms in the sequence are the same.
2010 Indonesia TST, 3
In a party, each person knew exactly $ 22$ other persons. For each two persons $ X$ and $ Y$, if $ X$ and $ Y$ knew each other, there is no other person who knew both of them, and if $ X$ and $ Y$ did not know each other, there are exactly $ 6$ persons who knew both of them. Assume that $ X$ knew $ Y$ iff $ Y$ knew $ X$. How many people did attend the party?
[i]Yudi Satria, Jakarta[/i]
1997 All-Russian Olympiad, 4
The numbers from $1$ to $100$ are arranged in a $10\times 10$ table so that any two adjacent numbers have sum no larger than $S$. Find the least value of $S$ for which this is possible.
[i]D. Hramtsov[/i]
2012 Iran MO (3rd Round), 4
Prove that if $n$ is large enough, in every $n\times n$ square that a natural number is written on each one of its cells, one can find a subsquare from the main square such that the sum of the numbers is this subsquare is divisible by $1391$.
2013 Mexico National Olympiad, 3
What is the largest amount of elements that can be taken from the set $\{1, 2, ... , 2012, 2013\}$, such that within them there are no distinct three, say $a$, $b$,and $c$, such that $a$ is a divisor or multiple of $b-c$?
2014 Contests, 1
In Sikinia we only pay with coins that have a value of either $11$ or $12$ Kulotnik. In a burglary in one of Sikinia's banks, $11$ bandits cracked the safe and could get away with $5940$ Kulotnik. They tried to split up the money equally - so that everyone gets the same amount - but it just doesn't worked. After a while their leader claimed that it actually isn't possible.
Prove that they didn't get any coin with the value $12$ Kulotnik.
2014 China Team Selection Test, 2
Let $A$ be a finite set of positive numbers , $B=\{\frac{a+b}{c+d} |a,b,c,d \in A \}$.
Show that: $\left | B \right | \ge 2\left | A \right |^2-1 $,
where $|X| $ be the number of elements of the finite set $X$.
(High School Affiliated to Nanjing Normal University )
2014 Contests, 3
We have $4n + 5$ points on the plane, no three of them are collinear. The points are colored with two colors. Prove that from the points we can form $n$ empty triangles (they have no colored points in their interiors) with pairwise disjoint interiors, such that all points occurring as vertices of the $n$ triangles have the same color.
1971 Bundeswettbewerb Mathematik, 4
Inside a square with side lengths $1$ a broken line of length $>1000$ without selfintersection is drawn.
Show that there is a line parallel to a side of the square that intersects the broken line in at least $501$ points.
2005 Turkey MO (2nd round), 3
Some of the $n + 1$ cities in a country (including the capital city) are connected by one-way or two-way airlines. No two cities are connected by both a one-way airline and a two-way airline, but there may be more than one two-way airline between two cities. If $d_A$ denotes the number of airlines from a city $A$, then $d_A \le n$ for any city $A$ other than the capital city and $d_A + d_B \le n$ for any two cities $A$ and $B$ other than the capital city which are not connected by a two-way airline. Every airline has a return, possibly consisting of several connected flights. Find the largest possible number of two-way airlines and all configurations of airlines for which this largest number is attained.
1995 All-Russian Olympiad, 4
Can the numbers from 1 to 81 be written in a 9×9 board, so that the sum of numbers in each 3×3 square is the same?
[i]S. Tokarev[/i]
2008 Bulgaria Team Selection Test, 3
Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.
2004 Iran MO (3rd Round), 3
Suppose $V= \mathbb{Z}_2^n$ and for a vector $x=(x_1,..x_n)$ in $V$ and permutation $\sigma$.We have $x_{\sigma}=(x_{\sigma(1)},...,x_{\sigma(n)})$
Suppose $ n=4k+2,4k+3$ and $f:V \to V$ is injective and if $x$ and $y$ differ in more than $n/2$ places then $f(x)$ and $f(y)$ differ in more than $n/2$ places.
Prove there exist permutaion $\sigma$ and vector $v$ that $f(x)=x_{\sigma}+v$
2007 Tournament Of Towns, 5
A square of side length $1$ centimeter is cut into three convex polygons. Is it possible that the diameter of each of them does not exceed
[list][b]a)[/b] $1$ centimeter;
[b]b)[/b] $1.01$ centimeters;
[b]c)[/b] $1.001$ centimeters?[/list]
2012 Iran MO (3rd Round), 1
We've colored edges of $K_n$ with $n-1$ colors. We call a vertex rainbow if it's connected to all of the colors. At most how many rainbows can exist?
[i]Proposed by Morteza Saghafian[/i]
1998 Tournament Of Towns, 5
Let $ n$ and $ m$ be given positive integers. In one move, a chess piece called an $ (n,m)$-crocodile goes $ n$ squares horizontally or vertically and then goes $ m$ squares in a perpendicular direction. Prove that the squares of an infinite chessboard can be painted in black and white so that this chess piece always moves from a black square to a white one or vice-versa.
2002 Tournament Of Towns, 3
[list]
[*] A test was conducted in class. It is known that at least $\frac{2}{3}$ of the problems were hard. Each such problems were not solved by at least $\frac{2}{3}$ of the students. It is also known that at least $\frac{2}{3}$ of the students passed the test. Each such student solved at least $\frac{2}{3}$ of the suggested problems. Is this possible?
[*] Previous problem with $\frac{2}{3}$ replaced by $\frac{3}{4}$.
[*] Previous problem with $\frac{2}{3}$ replaced by $\frac{7}{10}$.[/list]
2012 Indonesia TST, 2
Let $T$ be the set of all 2-digit numbers whose digits are in $\{1,2,3,4,5,6\}$ and the tens digit is strictly smaller than the units digit. Suppose $S$ is a subset of $T$ such that it contains all six digits and no three numbers in $S$ use all six digits. If the cardinality of $S$ is $n$, find all possible values of $n$.
2002 Turkey Team Selection Test, 3
Consider $2n+1$ points in space, no four of which are coplanar where $n>1$. Each line segment connecting any two of these points is either colored red, white or blue. A subset $M$ of these points is called a [i]connected monochromatic[/i] subset, if for each $a,b \in M$, there are points $a=x_0,x_1, \dots, x_l = b$ that belong to $M$ such that the line segments $x_0x_1, x_1x_2, \dots, x_{l-1}x_1$ are all have the same color. No matter how the points are colored, if there always exists a connected monochromatic $k-$subset, find the largest value of $k$. ($l > 1$)
2012 China Team Selection Test, 1
In a simple graph $G$, we call $t$ pairwise adjacent vertices a $t$[i]-clique[/i]. If a vertex is connected with all other vertices in the graph, we call it a [i]central[/i] vertex. Given are two integers $n,k$ such that $\dfrac {3}{2} \leq \dfrac{1}{2} n < k < n$. Let $G$ be a graph on $n$ vertices such that
[b](1)[/b] $G$ does not contain a $(k+1)$-[i]clique[/i];
[b](2)[/b] if we add an arbitrary edge to $G$, that creates a $(k+1)$-[i]clique[/i].
Find the least possible number of [i]central[/i] vertices in $G$.
2010 Contests, 2
All positive divisors of a positive integer $N$ are written on a blackboard. Two players $A$ and $B$ play the following game taking alternate moves. In the firt move, the player $A$ erases $N$. If the last erased number is $d$, then the next player erases either a divisor of $d$ or a multiple of $d$. The player who cannot make a move loses. Determine all numbers $N$ for which $A$ can win independently of the moves of $B$.
[i](4th Middle European Mathematical Olympiad, Individual Competition, Problem 2)[/i]
2011 ELMO Shortlist, 6
Do there exist positive integers $k$ and $n$ such that for any finite graph $G$ with diameter $k+1$ there exists a set $S$ of at most $n$ vertices such that for any $v\in V(G)\setminus S$, there exists a vertex $u\in S$ of distance at most $k$ from $v$?
[i]David Yang.[/i]
1976 Canada National Olympiad, 1
Given four weights in geometric progression and an equal arm balance, show how to find the heaviest weight using the balance only twice.
1996 All-Russian Olympiad, 7
Two piles of coins lie on a table. It is known that the sum of the weights of the coins in the two piles are equal, and for any natural number $k$, not exceeding the number of coins in either pile, the sum of the weights of the $k$ heaviest coins in the first pile is not more than that of the second pile. Show that for any natural number $x$, if each coin (in either pile) of weight not less than $x$ is replaced by a coin of weight $x$, the first pile will not be lighter than the second.
[i]D. Fon-der-Flaas[/i]
2010 Contests, 4
Let $n$ be a positive integer. Find the smallest positive integer $k$ with the property that for any colouring nof the squares of a $2n$ by $k$ chessboard with $n$ colours, there are $2$ columns and $2$ rows such that the $4$ squares in their intersections have the same colour.