olymmath

IMO 1977

International Mathematical Olympiad 1977.

Official paper

The official paper in 1 language

English

Day 1

Problem 1

  • Day 1

In the interior of a square ABCDABCD we construct the equilateral triangles ABK,BCL,CDM,DAN.ABK, BCL, CDM, DAN. Prove that the midpoints of the four segments KL,LM,MN,NKKL, LM, MN, NK and the midpoints of the eight segments AK,BK,BL,CL,CM,DM,DN,ANAK, BK, BL, CL, CM, DM, DN, AN are the 12 vertices of a regular dodecagon.

Answer, solutions and source

Problem 2

  • Day 1

In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

Answer, solutions and source

Problem 3

  • Day 1

Let nn be a given number greater than 2. We consider the set VnV_n of all the integers of the form 1+kn1 + kn with k=1,2,…k = 1, 2, \ldots A number mm from VnV_n is called indecomposable in VnV_n if there are not two numbers pp and qq from VnV_n so that m=pq.m = pq. Prove that there exist a number r∈Vnr \in V_n that can be expressed as the product of elements indecomposable in VnV_n in more than one way. (Expressions which differ only in order of the elements of VnV_n will be considered the same.)

Answer, solutions and source

Day 2

Problem 5

  • Day 2

Let a,ba,b be two natural numbers. When we divide a2+b2a^2+b^2 by a+ba+b , we the the remainder rr and the quotient q.q. Determine all pairs (a,b)(a, b) for which q2+r=1977.q^2 + r = 1977.

Answer, solutions and source

Problem 6

  • Day 2

Let N\mathbb{N} be the set of positive integers. Let ff be a function defined on N\mathbb{N} , which satisfies the inequality f(n+1)>f(f(n))f(n + 1) > f(f(n)) for all n∈Nn \in \mathbb{N} . Prove that for any nn we have f(n)=n.f(n) = n.

Answer, solutions and source