olymmath

USAMO 1975

United States of America Mathematical Olympiad 1975.

Day 1

Problem 1

  • Day 1

Show that for any non-negative reals x,y,[5x]+[5y]≥[3x+y]+[x+3y]\mathrm{x}, \mathrm{y},[5 \mathrm{x}]+[5 \mathrm{y}] \geq[3 \mathrm{x}+\mathrm{y}]+[\mathrm{x}+3 \mathrm{y}]. Hence or otherwise show that (5a)! (5b)!/(a!b!(3a+b)!(a+3b)!)(5 b)!/(a!b!(3 a+b)!(a+3 b)!) is integral for any positive integers a,ba, b.

Answer, solutions and source

Problem 2

  • Day 1

Show that for any tetrahedron the sum of the squares of the lengths of two opposite edges is at most the sum of the squares of the other four.

Answer, solutions and source

Problem 3

  • Day 1
  • Answer

A polynomial p(x)p(x) of degree nn satisfies p(0)=0,p(1)=1/2,p(2)=2/3,…,p(n)=n/(n+1)p(0)=0, p(1)=1 / 2, p(2)=2 / 3, \ldots, p(n)=n /(n+1). Find p(n+1)p(n+1).

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Two circles intersect at two points, one of them X\mathrm{X}. Find Y\mathrm{Y} on one circle and Z\mathrm{Z} on the other, so that X,Y\mathrm{X}, \mathrm{Y} and Z\mathrm{Z} are collinear and XY.XZ\mathrm{XY} . \mathrm{XZ} is as large as possible.

Answer, solutions and source

Problem 5

  • Day 2
  • Answer

A pack of n\mathrm{n} cards, including three aces, is well shuffled. Cards are turned over in turn. Show that the expected number of cards that must be turned over to reach the second ace is (n+1)/2(\mathrm{n}+1) / 2.

Answer, solutions and source