olymmath

IMO 1991

International Mathematical Olympiad 1991.

Official paper

The official paper in 1 language

English

Day 1

Problem 2

Let n>6 n > 6\, be an integer and a1,a2,⋯ ,ak a_{1},a_{2},\cdots ,a_{k}\, be all the natural numbers less than nn and relatively prime to nn . If a2−a1=a3−a2=⋯=ak−ak−1>0,a_{2} - a_{1} = a_{3} - a_{2} = \cdots = a_{k} - a_{k - 1} > 0, prove that n n\, must be either a prime number or a power of 22 .

Answer, solutions and source

Problem 3

Suppose G G\, is a connected graph with k k\, edges. Prove that it is possible to label the edges 1,2,…,k 1,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.Note: Graph-Definition. 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,v u,v\, belongs to at most one edge. The graph GG is connected if for each pair of distinct vertices x,y x,y\, there is some sequence of vertices x=v0,v1,v2,⋯ ,vm=y x = v_{0},v_{1},v_{2},\cdots ,v_{m} = y\, such that each pair vi,vi+1  (0≤i<m) v_{i},v_{i + 1}\;(0\leq i < m)\, is joined by an edge of GG .

Answer, solutions and source

Day 2

Problem 4

Suppose G is a connected graph with k edges. Prove that it is possible to label the edges 1, 2, ... , 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 1. [A graph is a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of edges belongs to at most one edge. The graph is connected if for each pair of distinct vertices x, y there is some sequence of vertices x = v0v_0, v1v_1, ... , vmv_m = y, such that each pair viv_i, vi+1v_{i+1} (0 ≤ i < m) is joined by an edge.]

Answer, solutions and source

Problem 6

Given any real number a > 1 construct a bounded infinite sequence x0x_0, x1x_1, x2x_2, ... such that ∣xi|x_i - xjx_j| |i - j∣aj|^a ≥ 1 for every pair of distinct i, j. [An infinite sequence x0x_0, x1x_1, x2x_2, ... of real numbers is bounded if there is a constant C such that ∣xi|x_i| < C for all i.]

Answer, solutions and source