Prove that the set of positive integers cannot be partitioned into three nonempty subsets such that, for any two integers $x,y$ taken from two different subsets, the number $x^2-xy+y^2$ belongs to the third subset.

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?

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.

A set of $1985$ points is distributed around the circumference of a circle and each of the points is marked with $1$ or $-1$. A point is called “good” if the partial sums that can be formed by starting at that point and proceeding around the circle for any distance in either direction are all strictly positive. Show that if the number of points marked with $-1$ is less than $662$, there must be at least one good point.

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.

Every point in the plane was colored in red or blue. Prove that one the two following statements is true: $\bullet$ there exist two red points at distance $1$ from each other; $\bullet$ there exist four blue points $B_1$, $B_2$, $B_3$, $B_4$ such that the points $B_i$ and $B_j$ are at distance $|i - j|$ from each other, for all integers $i $ and $j$ such as $1 \le i \le 4$ and $1 \le j \le 4$.

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.

Nine mathematicians meet at an international conference and discover that among any three of them, at least two speak a common language. If each of the mathematicians speak at most three languages, prove that there are at least three of the mathematicians who can speak the same language.

Given points $O$ and $A$ in the plane. Every point in the plane is colored with one of a finite number of colors. Given a point $X$ in the plane, the circle $C(X)$ has center $O$ and radius $OX+{\angle AOX\over OX}$, where $\angle AOX$ is measured in radians in the range $[0,2\pi)$. Prove that we can find a point $X$, not on $OA$, such that its color appears on the circumference of the circle $C(X)$.

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.

Suppose that every integer has been given one of the colors red, blue, green, yellow. Let $x$ and $y$ be odd integers such that $|x| \ne |y|$. Show that there are two integers of the same color whose difference has one of the following values: $x,y,x+y,x-y$.

In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$, $ n\in\mathbb{Z}$ and color each strip black or white. Prove that any rectangle which is not a square can be placed in the plane so that its vertices have the same color. [b]IMO Shortlist 2007 Problem C5 as it appears in the official booklet:[/b] In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$ for every integer $ n.$ Assume each strip $ S_n$ is colored either red or blue, and let $ a$ and $ b$ be two distinct positive integers. Prove that there exists a rectangle with side length $ a$ and $ b$ such that its vertices have the same color. ([i]Edited by Orlando Döhring[/i]) [i]Author: Radu Gologan and Dan Schwarz, Romania[/i]

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.

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.

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.

There are $ n$ points on the plane, no three of which are collinear. Each pair of points is joined by a red, yellow or green line. For any three points, the sides of the triangle they form consist of exactly two colours. Show that $ n<13$.

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

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?

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

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.

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 integer has been given one of the colours red, blue, green or yellow. Let $x$ and $y$ be odd integers so that $|x| \neq |y|$. Show that there are two integers of the same colour whose difference has one of the following values: $x,y,x+y$ or $x-y$.

Let $ABC$ be an equilateral triangle and $\mathcal{E}$ the set of all points contained in the three segments $AB$, $BC$, and $CA$ (including $A$, $B$, and $C$). Determine whether, for every partition of $\mathcal{E}$ into two disjoint subsets, at least one of the two subsets contains the vertices of a right-angled triangle.

A subset $M$ of $\{1, 2, . . . , 2006\}$ has the property that for any three elements $x, y, z$ of $M$ with $x < y < z$, $x+ y$ does not divide $z$. Determine the largest possible size of $M$.

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)$.