uniolympiads Ελληνικά

IMC 2004

All the problems of the year on one page, as on the contest paper.

Official files

  1. Problem 1 (Day 1)

    Let SS be an infinite set of real numbers such that ∣s1+s2+⋯+sk∣<1|s_1 + s_2 + \dots + s_k| < 1 for every finite subset {s1,s2,…,sk}⊂S\{s_1, s_2, \dots, s_k\} \subset S. Show that SS is countable.

    Hints and solution

  2. Problem 2 (Day 1)

    Let P(x)=x2−1P(x) = x^2 - 1. How many distinct real solutions does the following equation have:

    P(P(…(P⏟2004(x))… ))=0 ?\underbrace{P(P(\dots(P}_{2004}(x))\dots)) = 0\,?

    Hints and solution

  3. Problem 3 (Day 1)

    Let SnS_n be the set of all sums ∑k=1nxk\sum_{k=1}^{n} x_k, where n≥2n \ge 2, 0≤x1,x2,…,xn≤π20 \le x_1, x_2, \dots, x_n \le \frac{\pi}{2} and

    ∑k=1nsin⁡xk=1.\sum_{k=1}^{n} \sin x_k = 1.

    a) Show that SnS_n is an interval. (10 points)

    b) Let lnl_n be the length of SnS_n. Find lim⁡n→∞ln\lim_{n \to \infty} l_n. (10 points)

    Hints and solution

  4. Problem 4 (Day 1)

    Suppose n≥4n \ge 4 and let MM be a finite set of nn points in R3\mathbb{R}^3, no four of which lie in a plane. Assume that the points can be coloured black or white so that any sphere which intersects MM in at least four points has the property that exactly half of the points in the intersection of MM and the sphere are white. Prove that all of the points in MM lie on one sphere.

    Hints and solution

  5. Problem 5 (Day 1)

    Let XX be a set of (2k−4k−2)+1\binom{2k-4}{k-2} + 1 real numbers, k≥2k \ge 2. Prove that there exists a monotone sequence {xi}i=1k⊆X\{x_i\}_{i=1}^{k} \subseteq X such that

    ∣xi+1−x1∣≥2∣xi−x1∣|x_{i+1} - x_1| \ge 2|x_i - x_1|

    for all i=2,…,k−1i = 2, \dots, k - 1.

    Hints and solution

  6. Problem 6 (Day 1)

    For every complex number z∉{0,1}z \notin \{0, 1\} define

    f(z):=∑(log⁡z)−4,f(z) := \sum (\log z)^{-4},

    where the sum is over all branches of the complex logarithm.

    a) Show that there are two polynomials PP and QQ such that f(z)=P(z)/Q(z)f(z) = P(z)/Q(z) for all z∈C∖{0,1}z \in \mathbb{C} \setminus \{0, 1\}. (10 points)

    b) Show that for all z∈C∖{0,1}z \in \mathbb{C} \setminus \{0, 1\}

    f(z)=zz2+4z+16(z−1)4.(10 points)f(z) = z\frac{z^2 + 4z + 1}{6(z-1)^4}. \qquad \text{(10 points)}

    Hints and solution

  7. Problem 1 (Day 2)

    Let AA be a real 4×24 \times 2 matrix and BB be a real 2×42 \times 4 matrix such that

    AB=(10−10010−1−10100−101).AB = \begin{pmatrix} 1 & 0 & -1 & 0 \\ 0 & 1 & 0 & -1 \\ -1 & 0 & 1 & 0 \\ 0 & -1 & 0 & 1 \end{pmatrix}.

    Find BABA.

    Hints and solution

  8. Problem 2 (Day 2)

    Let f,g ⁣:[a,b]→[0,∞)f, g\colon [a, b] \to [0, \infty) be continuous and non-decreasing functions such that for each x∈[a,b]x \in [a, b] we have

    ∫axf(t) dt≤∫axg(t) dt\int_a^x \sqrt{f(t)}\,dt \le \int_a^x \sqrt{g(t)}\,dt

    and ∫abf(t) dt=∫abg(t) dt\int_a^b \sqrt{f(t)}\,dt = \int_a^b \sqrt{g(t)}\,dt.

    Prove that ∫ab1+f(t) dt≥∫ab1+g(t) dt\int_a^b \sqrt{1 + f(t)}\,dt \ge \int_a^b \sqrt{1 + g(t)}\,dt.

    Hints and solution

  9. Problem 3 (Day 2)

    Let DD be the closed unit disk in the plane, and let p1,p2,…,pnp_1, p_2, \dots, p_n be fixed points in DD. Show that there exists a point pp in DD such that the sum of the distances of pp to each of p1,p2,…,pnp_1, p_2, \dots, p_n is greater than or equal to 11.

    Hints and solution

  10. Problem 4 (Day 2)

    For n≥1n \ge 1 let MM be an n×nn \times n complex matrix with distinct eigenvalues λ1,λ2,…,λk\lambda_1, \lambda_2, \dots, \lambda_k, with multiplicities m1,m2,…,mkm_1, m_2, \dots, m_k, respectively. Consider the linear operator LML_M defined by LM(X)=MX+XMTL_M(X) = MX + XM^T, for any complex n×nn \times n matrix XX. Find its eigenvalues and their multiplicities. (MTM^T denotes the transpose of MM; that is, if M=(mk,l)M = (m_{k,l}), then MT=(ml,k)M^T = (m_{l,k}).)

    Hints and solution

  11. Problem 5 (Day 2)

    Prove that

    ∫01∫01dx dyx−1+∣ln⁡y∣−1≤1.\int_0^1 \int_0^1 \frac{dx\,dy}{x^{-1} + |\ln y| - 1} \le 1.

    Hints and solution

  12. Problem 6 (Day 2)

    For n≥0n \ge 0 define matrices AnA_n and BnB_n as follows: A0=B0=(1)A_0 = B_0 = (1) and for every n>0n > 0

    An=(An−1An−1An−1Bn−1) and Bn=(An−1An−1An−10).A_n = \begin{pmatrix} A_{n-1} & A_{n-1} \\ A_{n-1} & B_{n-1} \end{pmatrix} \text{ and } B_n = \begin{pmatrix} A_{n-1} & A_{n-1} \\ A_{n-1} & 0 \end{pmatrix}.

    Denote the sum of all elements of a matrix MM by S(M)S(M). Prove that S(Ank−1)=S(Akn−1)S(A_n^{k-1}) = S(A_k^{n-1}) for every n,k≥1n, k \ge 1.

    Hints and solution