Found problems: 1488
2003 Germany Team Selection Test, 1
At a chess tournament the winner gets 1 point and the defeated one 0 points. A tie makes both obtaining $\frac{1}{2}$ points. 14 players, none of them equally aged, participated in a competition where everybody played against all the other players. After the competition a ranking was carried out. Of the two players with the same number of points the younger received the better ranking. After the competition Jan realizes that the best three players together got as many points as the last 9 players obtained points together. And Joerg noted that the number of ties was maximal. Determine the number of ties.
2003 Mexico National Olympiad, 6
Given a positive integer $n$, an allowed move is to form $2n+1$ or $3n+2$. The set $S_{n}$ is the set of all numbers that can be obtained by a sequence of allowed moves starting with $n$. For example, we can form $5 \rightarrow 11 \rightarrow 35$ so $5, 11$ and $35$ belong to $S_{5}$. We call $m$ and $n$ compatible if $S_{m}$ and $S_{n}$ has a common element. Which members of $\{1, 2, 3, ... , 2002\}$ are compatible with $2003$?
1977 IMO Longlists, 40
The numbers $1, 2, 3,\ldots , 64$ are placed on a chessboard, one number in each square. Consider all squares on the chessboard of size $2 \times 2.$ Prove that there are at least three such squares for which the sum of the $4$ numbers contained exceeds $100.$
2011 Tuymaada Olympiad, 3
In a word of more than $10$ letters, any two consecutive letters are different. Prove that one can change places of two consecutive letters so that the resulting word is not [i]periodic[/i], that is, cannot be divided into equal subwords.
2005 Junior Balkan Team Selection Tests - Romania, 7
A phone company starts a new type of service. A new customer can choose $k$ phone numbers in this network which are call-free, whether that number is calling or is being called. A group of $n$ students want to use the service.
(a) If $n\geq 2k+2$, show that there exist 2 students who will be charged when speaking.
(b) It $n=2k+1$, show that there is a way to arrange the free calls so that everybody can speak free to anybody else in the group.
[i]Valentin Vornicu[/i]
2014 Macedonia National Olympiad, 1
In a plane, 2014 lines are distributed in 3 groups. in every group all the lines are parallel between themselves. What is the maximum number of triangles that can be formed, such that every side of such triangle lie on one of the lines?
1987 IMO Longlists, 41
Let $n$ points be given arbitrarily in the plane, no three of them collinear. Let us draw segments between pairs of these points. What is the minimum number of segments that can be colored red in such a way that among any four points, three of them are connected by segments that form a red triangle?
2007 Indonesia TST, 1
Call an $n$-gon to be [i]lattice[/i] if its vertices are lattice points. Prove that inside every lattice convex pentagon there exists a lattice point.
2009 Germany Team Selection Test, 3
The 16 fields of a $4 \times 4$ checker board can be arranged in 18 lines as follows: the four lines, the four columns, the five diagonals from north west to south east and the five diagonals from north east to south west. These diagonals consists of 2,3 or 4 edge-adjacent fields of same colour; the corner fields of the chess board alone do not form a diagonal. Now, we put a token in 10 of the 16 fields. Each of the 18 lines contains an even number of tokens contains a point. What is the highest possible point number when can be achieved by optimal placing of the 10 tokens. Explain your answer.
2006 Switzerland Team Selection Test, 3
An airport contains 25 terminals which are two on two connected by tunnels. There is exactly 50 main tunnels which can be traversed in the two directions, the others are with single direction. A group of four terminals is called [i]good[/i] if of each terminal of the four we can arrive to the 3 others by using only the tunnels connecting them. Find the maximum number of good groups.
2007 India IMO Training Camp, 3
Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define
\[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\]
Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$
(Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)
1985 IMO Longlists, 43
Suppose that $1985$ points are given inside a unit cube. Show that one can always choose $32$ of them in such a way that every (possibly degenerate) closed polygon with these points as vertices has a total length of less than $8 \sqrt 3.$
2005 Olympic Revenge, 6
Zé Roberto and Humberto are playing the Millenium Game!
There are 30 empty boxes in a queue, and each box have a capacity of one blue stome.
Each player takes a blue stone and places it in a box (and it is a [i]move[/i]).
The winner is who, in its move, obtain three full consecutive boxes.
If Zé Roberto is the first player, who has the winner strategy?
1990 China Team Selection Test, 4
There are arbitrary 7 points in the plane. Circles are drawn through every 4 possible concyclic points. Find the maximum number of circles that can be drawn.
1987 IMO Longlists, 43
Let $2n + 3$ points be given in the plane in such a way that no three lie on a line and no four lie on a circle. Prove that the number of circles that pass through three of these points and contain exactly $n$ interior points is not less than $\frac 13 \binom{2n+3}{2}.$
1989 Polish MO Finals, 1
$n, k$ are positive integers. $A_0$ is the set $\{1, 2, ... , n\}$. $A_i$ is a randomly chosen subset of $A_{i-1}$ (with each subset having equal probability). Show that the expected number of elements of $A_k$ is $\dfrac{n}{2^k}$
2018 IFYM, Sozopol, 8
Find all positive integers $n$ for which a square[b][i] n x n[/i][/b] can be covered with rectangles [b][i]k x 1[/i][/b] and one square [b][i]1 x 1[/i][/b] when:
a) $k = 4$ b) $k = 8$
2003 China Team Selection Test, 2
Suppose $A\subseteq \{0,1,\dots,29\}$. It satisfies that for any integer $k$ and any two members $a,b\in A$($a,b$ is allowed to be same), $a+b+30k$ is always not the product of two consecutive integers. Please find $A$ with largest possible cardinality.
2005 Finnish National High School Mathematics Competition, 2
There are $12$ seats at a round table in a restaurant. A group of five women and seven men arrives at the table. How many ways are there for choosing the sitting order, provided that every woman ought to be surrounded by two men and two orders are regarded as different, if at least one person has a different neighbour on one's right side.
2010 China Team Selection Test, 3
Let $A$ be a finite set, and $A_1,A_2,\cdots, A_n$ are subsets of $A$ with the following conditions:
(1) $|A_1|=|A_2|=\cdots=|A_n|=k$, and $k>\frac{|A|}{2}$;
(2) for any $a,b\in A$, there exist $A_r,A_s,A_t\,(1\leq r<s<t\leq n)$ such that
$a,b\in A_r\cap A_s\cap A_t$;
(3) for any integer $i,j\, (1\leq i<j\leq n)$, $|A_i\cap A_j|\leq 3$.
Find all possible value(s) of $n$ when $k$ attains maximum among all possible systems $(A_1,A_2,\cdots, A_n,A)$.
2014 Saudi Arabia IMO TST, 3
We are given a lattice and two pebbles $A$ and $B$ that are placed at two lattice points. At each step we are allowed to relocate one of the pebbles to another lattice point with the condition that the distance between pebbles is preserved. Is it possible after finite number of steps to switch positions of the pebbles?
2014 Tuymaada Olympiad, 7
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]
2008 Mexico National Olympiad, 1
A king decides to reward one of his knights by making a game. He sits the knights at a round table and has them call out $1,2,3,1,2,3,\dots$ around the circle (that is, clockwise, and each person says a number). The people who say $2$ or $3$ immediately lose, and this continues until the last knight is left, the winner.
Numbering the knights initially as $1,2,\dots,n$, find all values of $n$ such that knight $2008$ is the winner.
2017 Bundeswettbewerb Mathematik, 1
For which integers $n \geq 4$ is the following procedure possible? Remove one number of the integers $1,2,3,\dots,n+1$ and arrange them in a sequence $a_1,a_2,\dots,a_n$ such that of the $n$ numbers \[ |a_1-a_2|,|a_2-a_3|,\dots,|a_{n-1}-a_n|,|a_n-a_1| \] no two are equal.
2003 Tournament Of Towns, 7
Two players in turn play a game. First Player has cards with numbers $2, 4, \ldots, 2000$ while Second Player has cards with numbers $1, 3, \ldots, 2001$. In each his turn, a player chooses one of his cards and puts it on a table; the opponent sees it and puts his card next to the first one. Player, who put the card with a larger number, scores 1 point. Then both cards are discarded. First Player starts. After $1000$ turns the game is over; First Player has used all his cards and Second Player used all but one. What are the maximal scores, that players could guarantee for themselves, no matter how the opponent would play?