olymmath

IMO 1971

International Mathematical Olympiad 1971.

Day 1

Problem 1

  • Day 1

Let En=(a1−a2)(a1−a3)…(a1−an)+(a2−a1)(a2−a3)…(a2−an)+…+(an−a1)(an−a2)…(an−an−1).E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). Let SnS_n be the proposition that En≥0E_n\ge0 for all real aia_i . Prove that SnS_n is true for n=3n=3 and 55 , but for no other n>2n>2 .

Answer, solutions and source

Problem 2

  • Day 1

Let P1P_1 be a convex polyhedron with vertices A1,A2,…,A9A_1,A_2,\ldots,A_9 . Let PiP_i be the polyhedron obtained from P1P_1 by a translation that moves A1A_1 to AiA_i . Prove that at least two of the polyhedra P1,P2,…,P9P_1,P_2,\ldots,P_9 have an interior point in common.

Answer, solutions and source

Problem 3

  • Day 1

Prove that we can find an infinite set of positive integers of the from 2n−32^n-3 (where nn is a positive integer) every pair of which are relatively prime.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

All faces of the tetrahedron ABCDABCD are acute-angled. Take a point XX in the interior of the segment ABAB , and similarly YY in BC,ZBC, Z in CDCD and TT in ADAD .

a.) If ∠DAB+∠BCD≠∠CDA+∠ABC\angle DAB+\angle BCD\ne\angle CDA+\angle ABC , then prove none of the closed paths XYZTXXYZTX has minimal length;

b.) If ∠DAB+∠BCD=∠CDA+∠ABC\angle DAB+\angle BCD=\angle CDA+\angle ABC , then there are infinitely many shortest paths XYZTXXYZTX , each with length 2ACsin⁡k2AC\sin k , where 2k=∠BAC+∠CAD+∠DAB2k=\angle BAC+\angle CAD+\angle DAB .

Answer, solutions and source

Problem 5

  • Day 2

Prove that for every positive integer mm we can find a finite set SS of points in the plane, such that given any point AA of SS , there are exactly mm points in SS at unit distance from AA .

Answer, solutions and source

Problem 6

  • Day 2

Let A=(aij)A = (a_{ij}) , where i,j=1,2,…,ni,j = 1,2,\ldots,n , be a square matrix with all aija_{ij} non-negative integers. For each i,ji,j such that aij=0a_{ij} = 0 , the sum of the elements in the ii th row and the jj th column is at least nn . Prove that the sum of all the elements in the matrix is at least n22\frac {n^2}{2} .

Answer, solutions and source