Found problems: 181
The localities $P_1, P_2, \dots, P_{1983}$ are served by ten international airlines $A_1,A_2, \dots , A_{10}$. It is noticed that there is direct service (without stops) between any two of these localities and that all airline schedules offer round-trip flights. Prove that at least one of the airlines can offer a round trip with an odd number of landings.
An international society has its members from six different countries. The list of members contain $1978$ names, numbered $1, 2, \dots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two members from his own country, or twice as large as the number of one member from his own country.
The set $M = \{1, 2, . . . , 2n\}$ is partitioned into $k$ nonintersecting subsets $M_1,M_2, \dots, M_k,$ where $n \ge k^3 + k.$ Prove that there exist even numbers $2j_1, 2j_2, \dots, 2j_{k+1}$ in $M$ that are in one and the same subset $M_i$ $(1 \le i \le k)$ such that the numbers $2j_1 - 1, 2j_2 - 1, \dots, 2j_{k+1} - 1$ are also in one and the same subset $M_j (1 \le j \le k).$
Prove that there exists a four-coloring of the set $M = \{1, 2, \cdots, 1987\}$ such that any arithmetic progression with $10$ terms in the set $M$ is not monochromatic.
[b][i]Alternative formulation[/i][/b]
Let $M = \{1, 2, \cdots, 1987\}$. Prove that there is a function $f : M \to \{1, 2, 3, 4\}$ that is not constant on every set of $10$ terms from $M$ that form an arithmetic progression.
[i]Proposed by Romania[/i]
$ M$ is a subset of $ \{1, 2, 3, \ldots, 15\}$ such that the product of any three distinct elements of $ M$ is not a square. Determine the maximum number of elements in $ M.$
Ten localities are served by two international airlines such that there exists a direct service (without stops) between any two of these localities and all airline schedules offer round-trip service between the cities they serve. Prove that at least one of the airlines can offer two disjoint round trips each containing an odd number of landings.
Let $\{E_1, E_2, \dots, E_m\}$ be a collection of sets such that $E_i \subseteq X = \{1, 2, \dots, 100\}$, $E_i \neq X$, $i = 1, 2, \dots, m$. It is known that every two elements of $X$ is contained together in exactly one $E_i$ for some $i$. Determine the minimum value of $m$.
Seventeen people correspond by mail with one another-each one with all the rest. In their letters only three different topics are discussed. each pair of correspondents deals with only one of these topics. Prove that there are at least three people who write to each other about the same topic.
Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled:
[b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label.
[b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side.
[b](a)[/b] Find the maximal $r$ for which such a labelling is possible.
[b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there?
[hide="Easier version (5th German TST 2006) - contains answer to the harder version"]
[i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide]
[i]Proposed by Federico Ardila, Colombia[/i]
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line $L$ parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on $L$ is not greater than $1$?
Given $5$ points in a plane, no three of them being collinear. Each two of these $5$ points are joined with a segment, and every of these segments is painted either red or blue; assume that there is no triangle whose sides are segments of equal color.
[b]a.)[/b] Show that:
[i](1)[/i] Among the four segments originating at any of the $5$ points, two are red and two are blue.
[i](2)[/i] The red segments form a closed way passing through all $5$ given points. (Similarly for the blue segments.)
[b]b.)[/b] Give a plan how to paint the segments either red or blue in order to have the condition (no triangle with equally colored sides) satisfied.
An alphabet consists of $n$ letters. What is the maximal length of a word if we know that any two consecutive letters $a,b$ of the word are different and that the word cannot be reduced to a word of the kind $abab$ with $a\neq b$ by removing letters.
Let $s(k)$ be the number of ways to express $k$ as the sum of distinct $2012^{th}$ powers, where order does not matter. Show that for every real number $c$ there exists an integer $n$ such that $s(n)>cn$.
[i]Alex Zhu.[/i]
Given positive integer $n$, find the biggest real number $C$ which satisfy the condition that if the sum of the reciprocals of a set of integers (They can be the same.) that are greater than $1$ is less than $C$, then we can divide the set of numbers into no more than $n$ groups so that the sum of reciprocals of every group is less than $1$.
Let $A = (a_1, a_2, \ldots, a_{2001})$ be a sequence of positive integers. Let $m$ be the number of 3-element subsequences $(a_i,a_j,a_k)$ with $1 \leq i < j < k \leq 2001$, such that $a_j = a_i + 1$ and $a_k = a_j + 1$. Considering all such sequences $A$, find the greatest value of $m$.
Let $n \geq 5$ be a given integer. Determine the greatest integer $k$ for which there exists a polygon with $n$ vertices (convex or not, with non-selfintersecting boundary) having $k$ internal right angles.
[i]Proposed by Juozas Juvencijus Macys, Lithuania[/i]
Let $n$ be an even positive integer, and let $G$ be an $n$-vertex graph with exactly $\tfrac{n^2}{4}$ edges, where there are no loops or multiple edges (each unordered pair of distinct vertices is joined by either 0 or 1 edge). An unordered pair of distinct vertices $\{x,y\}$ is said to be [i]amicable[/i] if they have a common neighbor (there is a vertex $z$ such that $xz$ and $yz$ are both edges). Prove that $G$ has at least $2\textstyle\binom{n/2}{2}$ pairs of vertices which are amicable.
[i]Zoltán Füredi (suggested by Po-Shen Loh)[/i]
Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled:
[b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label.
[b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side.
[b](a)[/b] Find the maximal $r$ for which such a labelling is possible.
[b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there?
[hide="Easier version (5th German TST 2006) - contains answer to the harder version"]
[i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide]
[i]Proposed by Federico Ardila, Colombia[/i]
For any integer $n\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such that the following two conditions are satisfied:
[list][*] $a_i+b_i+c_i=n$ for all $i=1, \ldots, N(n)$,
[*] If $i\neq j$ then $a_i\neq a_j$, $b_i\neq b_j$ and $c_i\neq c_j$[/list]
Determine $N(n)$ for all $n\geq 2$.
[i]Proposed by Dan Schwarz, Romania[/i]
Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles.
[i]Author: Vyacheslav Yasinskiy, Ukraine[/i]
Let $n$ be a positive integer. An $n\times n$ board consisting of $n^2$ cells, each being a unit square colored either black or white, is called [i]convex[/i] if for every black colored cell, both the cell directly to the left of it and the cell directly above it are also colored black. We define the [i]beauty[/i] of a board as the number of pairs of its cells $(u,v)$ such that $u$ is black, $v$ is white, and $u$ and $v$ are in the same row or column. Determine the maximum possible beauty of a convex $n\times n$ board.
[i]Proposed by Ivan Novak[/i]
Bishops on a chessboard move along the diagonals ( that is , on lines parallel to the two main diagonals ) . Prove that the maximum number of non-attacking bishops on an $n*n$ chessboard is $2n-2$. (Two bishops are said to be attacking if they are on a common diagonal).
An $ (n, k) \minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that:
$ (i)$ Each player plays in each round, and every two players meet at most once.
$ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$.
Determine all pairs $ (n, k)$ for which there exists an $ (n, k) \minus{}$ tournament.
[i]Proposed by Carlos di Fiore, Argentina[/i]
Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?