Found problems: 81
2017 India IMO Training Camp, 2
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.
1983 IMO Longlists, 50
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?
2017 Germany Team Selection Test, 2
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.
1983 IMO Shortlist, 1
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.
2011 Romania Team Selection Test, 2
Prove that the set $S=\{\lfloor n\pi\rfloor \mid n=0,1,2,3,\ldots\}$ contains arithmetic progressions of any finite length, but no infinite arithmetic progressions.
[i]Vasile Pop[/i]
1978 IMO Shortlist, 10
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.
1993 IMO Shortlist, 5
Let $S_n$ be the number of sequences $(a_1, a_2, \ldots, a_n),$ where $a_i \in \{0,1\},$ in which no six consecutive blocks are equal. Prove that $S_n \rightarrow \infty$ when $n \rightarrow \infty.$
2024 China Team Selection Test, 9
Color the positive integers by four colors $c_1,c_2,c_3,c_4$.
(1)Prove that there exists a positive integer $n$ and $i,j\in\{1,2,3,4\}$,such that among all the positive divisors of $n$, the number of divisors with color $c_i$ is at least greater than the number of divisors with color $c_j$ by $3$.
(2)Prove that for any positive integer $A$,there exists a positive integer $n$ and $i,j\in\{1,2,3,4\}$,such that among all the positive divisors of $n$, the number of divisors with color $c_i$ is at least greater than the number of divisors with color $c_j$ by $A$.
1999 IMO Shortlist, 4
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.
1983 IMO Shortlist, 3
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.
2000 Belarus Team Selection Test, 5.3
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$.
2017 Morocco TST-, 5
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.
1966 IMO Shortlist, 43
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.
2001 IMO Shortlist, 8
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.
2004 China Team Selection Test, 2
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.
2017 Peru IMO TST, 6
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.
2004 China Team Selection Test, 2
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.
1997 South africa National Olympiad, 6
Six points are connected in pairs by lines, each of which is either red or blue. Every pair of points is joined. Determine whether there must be a closed path having four sides all of the same colour. (A path is closed if it begins and ends at the same point.)
1992 IMO Longlists, 10
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.
2021 Cyprus JBMO TST, 4
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.
1964 IMO Shortlist, 4
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.
1983 IMO Longlists, 1
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.
1977 IMO Longlists, 32
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.
2017 Romania Team Selection Test, P3
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.
1986 IMO Shortlist, 9
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$?