Documents

YearFilenameLanguageSource
1991IMO-1991-problems-eng.pdfen
Problem 1

Given a triangle ABCABC, let II be the center of its inscribed circle. The internal bisectors of the angles A,B,CA, B, C meet the opposite sides in A,B,CA', B', C' respectively. Prove that

14<AIBICIAABBCC827.\frac{1}{4} < \frac{AI \cdot BI \cdot CI}{AA' \cdot BB' \cdot CC'} \leq \frac{8}{27}.

Problem 2

Let n>6n > 6 be an integer and a1,a2,,aka_1, a_2, \ldots, a_k be all the natural numbers less than nn and relatively prime to nn. If

a2a1=a3a2==akak1>0,a_2 - a_1 = a_3 - a_2 = \cdots = a_k - a_{k-1} > 0,

prove that nn must be either a prime number or a power of 2.

Problem 3

Let S={1,2,3,,280}S = \{1, 2, 3, \ldots, 280\}. Find the smallest integer nn such that each nn-element subset of SS contains five numbers which are pairwise relatively prime.

Problem 4

Suppose GG is a connected graph with kk edges. Prove that it is possible to label the edges 1,2,,k1, 2, \ldots, k in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1.

[A graph consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices u,vu, v belongs to at most one edge. The graph GG is connected if for each pair of distinct vertices x,yx, y there is some sequence of vertices x=v0,v1,v2,,vm=yx = v_0, v_1, v_2, \ldots, v_m = y such that each pair vi,vi+1v_i, v_{i+1} (0i<m0 \leq i < m) is joined by an edge of GG.]

Problem 5

Let ABCABC be a triangle and PP an interior point of ABCABC. Show that at least one of the angles PAB\angle PAB, PBC\angle PBC, PCA\angle PCA is less than or equal to 30°30°.

Problem 6

An infinite sequence x0,x1,x2,x_0, x_1, x_2, \ldots of real numbers is said to be bounded if there is a constant CC such that xiC|x_i| \leq C for every i0i \geq 0.

Given any real number a>1a > 1, construct a bounded infinite sequence x0,x1,x2,x_0, x_1, x_2, \ldots such that

xixjija1|x_i - x_j||i - j|^a \geq 1

for every pair of distinct nonnegative integers i,ji, j.