Found problems: 1488
2003 India IMO Training Camp, 6
A zig-zag in the plane consists of two parallel half-lines connected by a line segment. Find $z_n$, the maximum number of regions into which $n$ zig-zags can divide the plane. For example, $z_1=2,z_2=12$(see the diagram). Of these $z_n$ regions how many are bounded? [The zig-zags can be as narrow as you please.] Express your answers as polynomials in $n$ of degree not exceeding $2$.
[asy]
draw((30,0)--(-70,0), Arrow);
draw((30,0)--(-20,-40));
draw((-20,-40)--(80,-40), Arrow);
draw((0,-60)--(-40,20), dashed, Arrow);
draw((0,-60)--(0,15), dashed);
draw((0,15)--(40,-65),dashed, Arrow);
[/asy]
2001 Tournament Of Towns, 5
Alex places a rook on any square of an empty $8\times8$ chessboard. Then he places additional rooks one rook at a time, each attacking an odd number of rooks which are already on the board. A rook attacks to the left, to the right, above and below, and only the first rook in each direction. What is the maximum number of rooks Alex can place on the chessboard?
2011 Postal Coaching, 3
Let $C$ be a circle, $A_1 , A_2,\ldots ,A_n$ be distinct points inside $C$ and $B_1 , B_2 ,\ldots ,B_n$ be distinct points on $C$ such that no two of the segments $A_1B_1 , A_2 B_2 ,\ldots ,A_n B_n$ intersect. A grasshopper can jump from $A_r$ to $A_s$ if the line segment $A_r A_s$ does not intersect any line segment $A_t B_t (t \neq r, s)$. Prove that after a certain number of jumps, the grasshopper can jump from any $A_u$ to any $A_v$ .
2014 Contests, 2
Let $k\ge 1$ be a positive integer.
We consider $4k$ chips, $2k$ of which are red and $2k$ of which are blue. A sequence of those $4k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an
equal number of consecutive blue chips. For example, we can move from $r\underline{bb}br\underline{rr}b$ to $r\underline{rr}br\underline{bb}b$ where $r$ denotes a red chip and $b$ denotes a blue chip.
Determine the smallest number $n$ (as a function of $k$) such that starting from any initial sequence of the $4k$ chips, we need at most $n$ moves to reach the state in which the first $2k$ chips are red.
2000 Finnish National High School Mathematics Competition, 4
There are seven points on the plane, no three of which are collinear. Every pair of points is connected with a line segment, each of which is either blue or red. Prove that there are at least four monochromatic triangles in the fi gure.
2000 Canada National Olympiad, 2
A [i]permutation[/i] of the integers $1901, 1902, \cdots, 2000$ is a sequence $a_1, a_2, \cdots, a_{100}$ in which each of those integers appears exactly once. Given such a permutation, we form the sequence of partial sums
\[s_1 = a_1,\;\;s_2 = a_1 + a_2,\;\;s_3 = a_1 + a_2 + a_3, \; \ldots\;, \; s_{100} = a_1 + a_2 + \cdots + a_{100}.\]
How many of these permutations will have no terms of the sequence $s_1, \ldots, s_{100}$ divisible by three?
2004 Kurschak Competition, 3
We have placed some red and blue points along a circle. The following operations are permitted:
(a) we may add a red point somewhere and switch the color of its neighbors,
(b) we may take off a red point from somewhere and switch the color of its neighbors (if there are at least $3$ points on the circle and there is a red one too).
Initially, there are two blue points on the circle. Using a number of these operations, can we reach a state with exactly two red point?
1999 All-Russian Olympiad, 1
There are three empty jugs on a table. Winnie the Pooh, Rabbit, and Piglet put walnuts in the jugs one by one. They play successively, with the initial determined by a draw. Thereby Winnie the Pooh plays either in the first or second jug, Rabbit in the second or third, and Piglet in the first or third. The player after whose move there are exactly 1999 walnuts loses the games. Show that Winnie the Pooh and Piglet can cooperate so as to make Rabbit lose.
1993 Taiwan National Olympiad, 4
In the Cartesian plane, let $C$ be a unit circle with center at origin $O$. For any point $Q$ in the plane distinct from $O$, define $Q'$ to be the intersection of the ray $OQ$ and the circle $C$. Prove that for any $P\in C$ and any $k\in\mathbb{N}$ there exists a lattice point $Q(x,y)$ with $|x|=k$ or $|y|=k$ such that $PQ'<\frac{1}{2k}$.
2008 South africa National Olympiad, 4
A pack of $2008$ cards, numbered from $1$ to $2008$, is shuffled in order to play a game in which each move has two steps:
(i) the top card is placed at the bottom;
(ii) the new top card is removed.
It turns out that the cards are removed in the order $1,2,\dots,2008$. Which card was at the top before the game started?
1998 Taiwan National Olympiad, 3
Let $ m,n$ be positive integers, and let $ F$ be a family of $ m$-element subsets of $ \{1,2,...,n\}$ satisfying $ A\cap B \not \equal{} \emptyset$ for all $ A,B\in F$. Determine the maximum possible number of elements in $ F$.
1989 IMO Longlists, 60
A family of sets $ A_1, A_2, \ldots ,A_n$ has the following properties:
[b](i)[/b] Each $ A_i$ contains 30 elements.
[b](ii)[/b] $ A_i \cap A_j$ contains exactly one element for all $ i, j, 1 \leq i < j \leq n.$
Determine the largest possible $ n$ if the intersection of all these sets is empty.
2007 All-Russian Olympiad, 7
Given a convex polyhedron $F$. Its vertex $A$ has degree $5$, other vertices have degree $3$. A colouring of edges of $F$ is called nice, if for any vertex except $A$ all three edges from it have different colours. It appears that the number of nice colourings is not divisible by $5$. Prove that there is a nice colouring, in which some three consecutive edges from $A$ are coloured the same way.
[i]D. Karpov[/i]
1982 Bundeswettbewerb Mathematik, 3
Suppose $P$ is a point inside a convex $2n$-gon, such that $P$ does not lie on any diagonal. Show that $P$ lies inside an even number of triangles whose vertices are vertices of the polygon.
2006 China Western Mathematical Olympiad, 4
Given a positive integer $ n\geq 2$, let $ B_{1}$, $ B_{2}$, ..., $ B_{n}$ denote $ n$ subsets of a set $ X$ such that each $ B_{i}$ contains exactly two elements. Find the minimum value of $ \left|X\right|$ such that for any such choice of subsets $ B_{1}$, $ B_{2}$, ..., $ B_{n}$, there exists a subset $ Y$ of $ X$ such that:
(1) $ \left|Y\right| \equal{} n$;
(2) $ \left|Y \cap B_{i}\right|\leq 1$ for every $ i\in\left\{1,2,...,n\right\}$.
2010 China Team Selection Test, 2
In a football league, there are $n\geq 6$ teams. Each team has a homecourt jersey and a road jersey with different color. When two teams play, the home team always wear homecourt jersey and the road team wear their homecourt jersey if the color is different from the home team's homecourt jersey, or otherwise the road team shall wear their road jersey. It is required that in any two games with 4 different teams, the 4 teams' jerseys have at least 3 different color. Find the least number of color that the $n$ teams' $2n$ jerseys may use.
1996 IberoAmerican, 2
Three tokens $A$, $B$, $C$ are, each one in a vertex of an equilateral triangle of side $n$. Its divided on equilateral triangles of side 1, such as it is shown in the figure for the case $n=3$
Initially, all the lines of the figure are painted blue. The tokens are moving along the lines painting them of red, following the next two rules:
[b](1) [/b]First $A$ moves, after that $B$ moves, and then $C$, by turns. On each turn, the token moves over exactly one line of one of the little triangles, form one side to the other.
[b](2)[/b] Non token moves over a line that is already painted red, but it can rest on one endpoint of a side that is already red, even if there is another token there waiting its turn.
Show that for every positive integer $n$ it is possible to paint red all the sides of the little triangles.
2005 Olympic Revenge, 1
Let $S=\{1,2,3,\ldots,n\}$, $n$ an odd number. Find the parity of number of permutations $\sigma : S \Rightarrow S$ such that the sequence defined by \[a(i)=|\sigma(i)-i|\] is monotonous.
2003 Brazil National Olympiad, 3
A graph $G$ with $n$ vertices is called [i]cool[/i] if we can label each vertex with a different positive integer not greater than $\frac{n^2}{4}$ and find a set of non-negative integers $D$ so that there is an edge between two vertices iff the difference between their labels is in $D$. Show that if $n$ is sufficiently large we can always find a graph with $n$ vertices which is not cool.
2005 Serbia Team Selection Test, 6
We say that $ n$ squares in a $ n\times n$ board are scattered if no two of them are in the same row or column.In every square of this board is witten a natural number so that the sum of numbrs in $ n$ scattered squares is always the same
and no row or no column contains two equal numbers .It turned out that the numbers on the main diagonal are arranged in the increasing order ,and that their product is the smallest among all products of $ n$ scattered numbers .Prove that scattered numbers with the greatest product are exactly those on the other diagonal.
2002 Federal Competition For Advanced Students, Part 2, 2
In the net drawn below, in how many ways can one reach the point $3n+1$ starting from the point $1$ so that the labels of the points on the way increase?
[asy]
import graph; size(12cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-4.3,xmax=12.32,ymin=-10.66,ymax=6.3; draw((1,2)--(xmax,0*xmax+2)); draw((1,0)--(xmax,0*xmax+0)); draw((0,1)--(1,2)); draw((1,0)--(0,1)); draw((1,2)--(3,0)); draw((1,0)--(3,2)); draw((3,2)--(5,0)); draw((3,0)--(5,2)); draw((5,2)--(7,0)); draw((5,0)--(7,2)); draw((7,2)--(9,0)); draw((7,0)--(9,2));
dot((1,0),linewidth(1pt)+ds); label("2",(0.96,-0.5),NE*lsf); dot((0,1),linewidth(1pt)+ds); label("1",(-0.42,0.9),NE*lsf); dot((1,2),linewidth(1pt)+ds); label("3",(0.98,2.2),NE*lsf); dot((2,1),linewidth(1pt)+ds); label("4",(1.92,1.32),NE*lsf); dot((3,2),linewidth(1pt)+ds); label("6",(2.94,2.2),NE*lsf); dot((4,1),linewidth(1pt)+ds); label("7",(3.94,1.32),NE*lsf); dot((6,1),linewidth(1pt)+ds); label("10",(5.84,1.32),NE*lsf); dot((3,0),linewidth(1pt)+ds); label("5",(2.98,-0.46),NE*lsf); dot((5,2),linewidth(1pt)+ds); label("9",(4.92,2.24),NE*lsf); dot((5,0),linewidth(1pt)+ds); label("8",(4.94,-0.42),NE*lsf); dot((8,1),linewidth(1pt)+ds); label("13",(7.88,1.34),NE*lsf); dot((7,2),linewidth(1pt)+ds); label("12",(6.8,2.26),NE*lsf); dot((7,0),linewidth(1pt)+ds); label("11",(6.88,-0.38),NE*lsf);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
[/asy]
2014 Tuymaada Olympiad, 6
Each of $n$ black squares and $n$ white squares can be obtained by a translation from each other. Every two squares of different colours have a common point. Prove that ther is a point belonging at least to $n$ squares.
[i](V. Dolnikov)[/i]
2004 Baltic Way, 12
There are $2n$ different numbers in a row. By one move we can interchange any two numbers or interchange any $3$ numbers cyclically (choose $a,b,c$ and place $a$ instead of $b$, $b$ instead of $c$, $c$ instead of $a$). What is the minimal number of moves that is always sufficient to arrange the numbers in increasing order ?
1979 IMO Longlists, 73
In a plane a finite number of equal circles are given. These circles are mutually nonintersecting (they may be externally tangent). Prove that one can use at most four colors for coloring these circles so that two circles tangent to each other are of different colors. What is the smallest number of circles that requires four colors?
1998 Poland - Second Round, 5
Let $a_1,a_2,\ldots,a_7, b_1,b_2,\ldots,b_7\geq 0$ be real numbers satisfying $a_i+b_i\le 2$ for all $i=\overline{1,7}$.
Prove that there exist $k\ne m$ such that $|a_k-a_m|+|b_k-b_m|\le 1$.
Thanks for show me the mistake typing