13th IMC

IMC 2006

Odessa, Ukraine · 20 – 26 July 2006 · 12 problems across 2 papers

Official result files

Day 1

6 problems
  1. Problem 120 pts

    Let f:RRf : \mathbb{R} \to \mathbb{R} be a real function. Prove or disprove each of the following statements.

    (a) If ff is continuous and range(f)=R\operatorname{range}(f) = \mathbb{R} then ff is monotonic.

    (b) If ff is monotonic and range(f)=R\operatorname{range}(f) = \mathbb{R} then ff is continuous.

    (c) If ff is monotonic and ff is continuous then range(f)=R\operatorname{range}(f) = \mathbb{R}.

  2. Problem 220 pts

    Find the number of positive integers xx satisfying the following two conditions:

    1. x<102006x < 10^{2006};

    2. x2xx^2 - x is divisible by 10200610^{2006}.

  3. Problem 320 pts

    Let AA be an n×nn \times n-matrix with integer entries and b1,,bkb_1, \dots, b_k be integers satisfying detA=b1bk\det A = b_1 \cdot \dots \cdot b_k. Prove that there exist n×nn \times n-matrices B1,,BkB_1, \dots, B_k with integer entries such that A=B1BkA = B_1 \cdot \dots \cdot B_k and detBi=bi\det B_i = b_i for all i=1,,ki = 1, \dots, k.

  4. Problem 420 pts

    Let ff be a rational function (i.e. the quotient of two real polynomials) and suppose that f(n)f(n) is an integer for infinitely many integers nn. Prove that ff is a polynomial.

  5. Problem 520 pts

    Let a,b,c,d,e>0a, b, c, d, e > 0 be real numbers such that a2+b2+c2=d2+e2a^2 + b^2 + c^2 = d^2 + e^2 and a4+b4+c4=d4+e4a^4 + b^4 + c^4 = d^4 + e^4. Compare the numbers a3+b3+c3a^3 + b^3 + c^3 and d3+e3d^3 + e^3.

  6. Problem 620 pts

    Find all sequences a0,a1,,ana_0, a_1, \dots, a_n of real numbers where n1n \ge 1 and an0a_n \ne 0, for which the following statement is true:

    If f:RRf : \mathbb{R} \to \mathbb{R} is an nn times differentiable function and x0<x1<<xnx_0 < x_1 < \dots < x_n are real numbers such that f(x0)=f(x1)==f(xn)=0f(x_0) = f(x_1) = \dots = f(x_n) = 0 then there exists an h(x0,xn)h \in (x_0, x_n) for which

    a0f(h)+a1f(h)++anf(n)(h)=0.a_0 f(h) + a_1 f'(h) + \dots + a_n f^{(n)}(h) = 0.

Day 2

6 problems
  1. Problem 120 pts

    Let VV be a convex polygon with nn vertices.

    (a) Prove that if nn is divisible by 33 then VV can be triangulated (i.e. dissected into non-overlapping triangles whose vertices are vertices of VV) so that each vertex of VV is the vertex of an odd number of triangles.

    (b) Prove that if nn is not divisible by 33 then VV can be triangulated so that there are exactly two vertices that are the vertices of an even number of the triangles.

  2. Problem 220 pts

    Find all functions f:RRf : \mathbb{R} \longrightarrow \mathbb{R} such that for any real numbers a<ba < b, the image f([a,b])f\big([a,b]\big) is a closed interval of length bab - a.

  3. Problem 320 pts

    Compare tan(sinx)\tan(\sin x) and sin(tanx)\sin(\tan x) for all x(0,π2)x \in \left(0, \dfrac{\pi}{2}\right).

  4. Problem 420 pts

    Let v0v_0 be the zero vector in Rn\mathbb{R}^n and let v1,v2,,vn+1Rnv_1, v_2, \dots, v_{n+1} \in \mathbb{R}^n be such that the Euclidean norm vivj|v_i - v_j| is rational for every 0i,jn+10 \le i, j \le n+1. Prove that v1,,vn+1v_1, \dots, v_{n+1} are linearly dependent over the rationals.

  5. Problem 520 pts

    Prove that there exists an infinite number of relatively prime pairs (m,n)(m,n) of positive integers such that the equation

    (x+m)3=nx(x+m)^3 = nx

    has three distinct integer roots.

  6. Problem 620 pts

    Let AiA_i, BiB_i, SiS_i (i=1,2,3i = 1, 2, 3) be invertible real 2×22 \times 2 matrices such that

    (1) not all AiA_i have a common real eigenvector;

    (2) Ai=Si1BiSiA_i = S_i^{-1} B_i S_i for all i=1,2,3i = 1, 2, 3;

    (3) A1A2A3=B1B2B3=(1001)A_1 A_2 A_3 = B_1 B_2 B_3 = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}.

    Prove that there is an invertible real 2×22 \times 2 matrix SS such that Ai=S1BiSA_i = S^{-1} B_i S for all i=1,2,3i = 1, 2, 3.