olymmath

IMO 1982

International Mathematical Olympiad 1982.

Day 1

Problem 1

  • Day 1

The function f(n)f(n) is defined on the positive integers and takes non-negative integer values. f(2)=0,f(3)>0,f(9999)=3333f(2)=0,f(3)>0,f(9999)=3333 and for all m,n:m,n: f(m+n)−f(m)−f(n)=0 or 1.f(m+n)-f(m)-f(n)=0 \text{ or } 1. Determine f(1982)f(1982) .

Answer, solutions and source

Problem 2

  • Day 1

A non-isosceles triangle A1A2A3A_{1}A_{2}A_{3} has sides a1a_{1} , a2a_{2} , a3a_{3} with the side aia_{i} lying opposite to the vertex AiA_{i} . Let MiM_{i} be the midpoint of the side aia_{i} , and let TiT_{i} be the point where the inscribed circle of triangle A1A2A3A_{1}A_{2}A_{3} touches the side aia_{i} . Denote by SiS_{i} the reflection of the point TiT_{i} in the interior angle bisector of the angle AiA_{i} . Prove that the lines M1S1M_{1}S_{1} , M2S2M_{2}S_{2} and M3S3M_{3}S_{3} are concurrent.

Answer, solutions and source

Problem 3

  • Day 1

Consider infinite sequences {xn}\{x_n\} of positive reals such that x0=1x_0=1 and x0≥x1≥x2≥…x_0\ge x_1\ge x_2\ge\ldots .a) Prove that for every such sequence there is an n≥1n\ge1 such that: x02x1+x12x2+…+xn−12xn≥3.999.{x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999.b) Find such a sequence such that for all nn : x02x1+x12x2+…+xn−12xn<4.{x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Prove that if nn is a positive integer such that the equation x3−3xy2+y3=nx^3-3xy^2+y^3=n has a solution in integers x,yx,y , then it has at least three such solutions. Show that the equation has no solutions in integers for n=2891n=2891 .

Answer, solutions and source

Problem 5

  • Day 2

The diagonals ACAC and CECE of the regular hexagon ABCDEFABCDEF are divided by inner points MM and NN respectively, so that AMAC=CNCE=r.{AM\over AC}={CN\over CE}=r. Determine rr if B,MB,M and NN are collinear.

Answer, solutions and source

Problem 6

  • Day 2

Let SS be a square with sides length 100100 . Let LL be a path within SS which does not meet itself and which is composed of line segments A0A1,A1A2,A2A3,…,An−1AnA_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n with A0=AnA_0=A_n . Suppose that for every point PP on the boundary of SS there is a point of LL at a distance from PP no greater than 12\frac {1} {2} . Prove that there are two points XX and YY of LL such that the distance between XX and YY is not greater than 11 and the length of the part of LL which lies between XX and YY is not smaller than 198198 .

Answer, solutions and source