7th IMC

IMC 2000

London, United Kingdom · 26 – 31 July 2000 · 12 problems across 2 papers

Day 1

6 problems
  1. Problem 1

    Is it true that if f:[0,1][0,1]f : [0,1] \to [0,1] is

    a) monotone increasing

    b) monotone decreasing

    then there exists an x[0,1]x \in [0,1] for which f(x)=xf(x) = x?

  2. Problem 2

    Let p(x)=x5+xp(x) = x^5 + x and q(x)=x5+x2q(x) = x^5 + x^2. Find all pairs (w,z)(w,z) of complex numbers with wzw \ne z for which p(w)=p(z)p(w) = p(z) and q(w)=q(z)q(w) = q(z).

  3. Problem 3

    AA and BB are square complex matrices of the same size and

    rank(ABBA)=1.\operatorname{rank}(AB - BA) = 1.

    Show that (ABBA)2=0(AB - BA)^2 = 0.

  4. Problem 4

    a) Show that if (xi)(x_i) is a decreasing sequence of positive numbers then

    (i=1nxi2)1/2i=1nxii.\left( \sum_{i=1}^{n} x_i^2 \right)^{1/2} \le \sum_{i=1}^{n} \frac{x_i}{\sqrt{i}}.

    b) Show that there is a constant CC so that if (xi)(x_i) is a decreasing sequence of positive numbers then

    m=11m(i=mxi2)1/2Ci=1xi.\sum_{m=1}^{\infty} \frac{1}{\sqrt{m}} \left( \sum_{i=m}^{\infty} x_i^2 \right)^{1/2} \le C \sum_{i=1}^{\infty} x_i.
  5. Problem 5

    Let RR be a ring of characteristic zero (not necessarily commutative). Let ee, ff and gg be idempotent elements of RR satisfying e+f+g=0e + f + g = 0. Show that e=f=g=0e = f = g = 0.

    (RR is of characteristic zero means that, if aRa \in R and nn is a positive integer, then na0na \ne 0 unless a=0a = 0. An idempotent xx is an element satisfying x=x2x = x^2.)

  6. Problem 6

    Let f:R(0,)f : \mathbb{R} \to (0,\infty) be an increasing differentiable function for which limxf(x)=\lim\limits_{x \to \infty} f(x) = \infty and ff' is bounded.

    Let F(x)=0xfF(x) = \int_0^x f. Define the sequence (an)(a_n) inductively by

    a0=1,an+1=an+1f(an),a_0 = 1, \quad a_{n+1} = a_n + \frac{1}{f(a_n)},

    and the sequence (bn)(b_n) simply by bn=F1(n)b_n = F^{-1}(n). Prove that limn(anbn)=0\lim\limits_{n \to \infty} (a_n - b_n) = 0.

Day 2

6 problems
  1. Problem 1

    a) Show that the unit square can be partitioned into nn smaller squares if nn is large enough.

    b) Let d2d \ge 2. Show that there is a constant N(d)N(d) such that, whenever nN(d)n \ge N(d), a dd-dimensional unit cube can be partitioned into nn smaller cubes.

  2. Problem 2

    Let ff be continuous and nowhere monotone on [0,1][0,1]. Show that the set of points on which ff attains local minima is dense in [0,1][0,1].

    (A function is nowhere monotone if there exists no interval where the function is monotone. A set is dense if each non-empty open interval contains at least one element of the set.)

  3. Problem 3

    Let p(z)p(z) be a polynomial of degree nn with complex coefficients. Prove that there exist at least n+1n+1 complex numbers zz for which p(z)p(z) is 00 or 11.

  4. Problem 4

    Suppose the graph of a polynomial of degree 66 is tangent to a straight line at 33 points A1A_1, A2A_2, A3A_3, where A2A_2 lies between A1A_1 and A3A_3.

    a) Prove that if the lengths of the segments A1A2A_1A_2 and A2A3A_2A_3 are equal, then the areas of the figures bounded by these segments and the graph of the polynomial are equal as well.

    b) Let k=A2A3A1A2k = \dfrac{A_2A_3}{A_1A_2}, and let KK be the ratio of the areas of the appropriate figures. Prove that

    27k5<K<72k5.\frac{2}{7} k^5 < K < \frac{7}{2} k^5.
  5. Problem 5

    Let R+\mathbb{R}^+ be the set of positive real numbers. Find all functions f:R+R+f : \mathbb{R}^+ \to \mathbb{R}^+ such that for all x,yR+x, y \in \mathbb{R}^+

    f(x)f(yf(x))=f(x+y).f(x)f(yf(x)) = f(x+y).
  6. Problem 6

    For an m×mm \times m real matrix AA, eAe^A is defined as n=01n!An\sum\limits_{n=0}^{\infty} \dfrac{1}{n!} A^n. (The sum is convergent for all matrices.) Prove or disprove, that for all real polynomials pp and m×mm \times m real matrices AA and BB, p(eAB)p(e^{AB}) is nilpotent if and only if p(eBA)p(e^{BA}) is nilpotent. (A matrix AA is nilpotent if Ak=0A^k = 0 for some positive integer kk.)