Found problems: 81
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.
Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.
We colour every square of a $4\times 19$ chess board with one of the colours red, green and blue. Prove that however this colouring is done, we can always find two horizontal rows and two vertical columns such that the $4$ squares on the intersections of these lines all have the same colour.
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 edges of a graph with $2n$ vertices ($n \ge 4$) are colored in blue and red such that there is no blue triangle and there is no red complete subgraph with $n$ vertices. Find the least possible number of blue edges.
Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.
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$ be a positive integer. Morgane has coloured the integers $1,2,\ldots,n$. Each of them is coloured in exactly one colour. It turned out that for all positive integers $a$ and $b$ such that $a<b$ and $a+b \leqslant n$, at least two of the integers among $a$, $b$ and $a+b$ are of the same colour. Prove that there exists a colour that has been used for at least $2n/5$ integers. \\ \\
(Vincent Jugé)
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$?
For any integer $r \geq 1$, determine the smallest integer $h(r) \geq 1$ such that for any partition of the set $\{1, 2, \cdots, h(r)\}$ into $r$ classes, there are integers $a \geq 0 \ ; 1 \leq x \leq y$, such that $a + x, a + y, a + x + y$ belong to the same class.
[i]Proposed by Romania[/i]
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.
Find the least natural number $ n$ such that, if the set $ \{1,2, \ldots, n\}$ is arbitrarily divided into two non-intersecting subsets, then one of the subsets contains 3 distinct numbers such that the product of two of them equals the third.
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.
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.
In a group of nine persons it is not possible to choose four persons such that every one knows the three others. Prove that this group of nine persons can be partitioned into four groups such that nobody knows anyone from his or her group.
Consider $9$ points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $\,n\,$ such that whenever exactly $\,n\,$ edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.
Assume that the set of all positive integers is decomposed into $ r$ (disjoint) subsets $ A_1 \cup A_2 \cup \ldots \cup A_r \equal{} \mathbb{N}.$ Prove that one of them, say $ A_i,$ has the following property: There exists a positive $ m$ such that for any $ k$ one can find numbers $ a_1, a_2, \ldots, a_k$ in $ A_i$ with $ 0 < a_{j \plus{} 1} \minus{} a_j \leq m,$ $ (1 \leq j \leq k \minus{} 1)$.
Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.
Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.
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$?
In a room there are nine men. Among every three of them there are two mutually acquainted. Prove that some four of them are mutually acquainted.
In the plane are given $100$ points, such that no three of them are on the same line. The points are arranged in $10$ groups, any group containing at least $3$ points. Any two points in the same group are joined by a segment.
a) Determine which of the possible arrangements in $10$ such groups is the one giving the minimal numbers of triangles.
b) Prove that there exists an arrangement in such groups where each segment can be coloured with one of three given colours and no triangle has all edges of the same colour.
[i]Vasile Pop[/i]
For $n$ people, if it is known that
(a) there exist two people knowing each other among any three people, and
(b) there exist two people not knowing each other among any four people.
Find the maximum of $n$.
Here, we assume that if $A$ knows $B$, then $B$ knows $A$.
Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^5$, no three of which are consecutive terms of an arithmetic progression?
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$?