20th IMC

IMC 2013

Blagoevgrad, Bulgaria · paper 2 on 9 August 2013 · 10 problems across 2 papers

Official result files

Day 1

5 problems
  1. Problem 1

    Let AA and BB be real symmetric matrices with all eigenvalues strictly greater than 11. Let λ\lambda be a real eigenvalue of matrix ABAB. Prove that λ>1|\lambda| > 1.

  2. Problem 2

    Let f:RRf : \mathbb{R} \to \mathbb{R} be a twice differentiable function. Suppose f(0)=0f(0) = 0. Prove that there exists ξ(π/2,π/2)\xi \in (-\pi/2, \pi/2) such that

    f(ξ)=f(ξ)(1+2tan2ξ).f''(\xi) = f(\xi)(1 + 2\tan^2 \xi).
  3. Problem 3

    There are 2n2n students in a school (nNn \in \mathbb{N}, n2n \ge 2). Each week nn students go on a trip. After several trips the following condition was fulfilled: every two students were together on at least one trip. What is the minimum number of trips needed for this to happen?

  4. Problem 4

    Let n3n \ge 3 and let x1,,xnx_1, \dots, x_n be nonnegative real numbers. Define A=i=1nxiA = \sum\limits_{i=1}^{n} x_i, B=i=1nxi2B = \sum\limits_{i=1}^{n} x_i^2 and C=i=1nxi3C = \sum\limits_{i=1}^{n} x_i^3. Prove that

    (n+1)A2B+(n2)B2A4+(2n2)AC.(n+1)A^2B + (n-2)B^2 \ge A^4 + (2n-2)AC.
  5. Problem 5

    Does there exist a sequence (an)(a_n) of complex numbers such that for every positive integer pp we have that n=1anp\sum\limits_{n=1}^{\infty} a_n^p converges if and only if pp is not a prime?

Day 2

9 August 2013 · 5 problems
  1. Problem 1

    Let zz be a complex number with z+1>2|z + 1| > 2. Prove that z3+1>1|z^3 + 1| > 1.

  2. Problem 2

    Let pp and qq be relatively prime positive integers. Prove that

    k=0pq1(1)kp+kq={0if pq is even,1if pq is odd.()\sum_{k=0}^{pq-1} (-1)^{\left\lfloor \frac{k}{p} \right\rfloor + \left\lfloor \frac{k}{q} \right\rfloor} = \begin{cases} 0 & \text{if } pq \text{ is even}, \\ 1 & \text{if } pq \text{ is odd}. \end{cases} \tag{$*$}

    (Here x\lfloor x \rfloor denotes the integer part of xx.)

  3. Problem 3

    Suppose that v1,,vdv_1, \dots, v_d are unit vectors in Rd\mathbb{R}^d. Prove that there exists a unit vector uu such that

    uvi1/d|u \cdot v_i| \le 1/\sqrt{d}

    for i=1,2,,di = 1, 2, \dots, d.

    (Here \cdot denotes the usual scalar product on Rd\mathbb{R}^d.)

  4. Problem 4

    Does there exist an infinite set MM consisting of positive integers such that for any a,bMa, b \in M, with a<ba < b, the sum a+ba + b is square-free?

    (A positive integer is called square-free if no perfect square greater than 11 divides it.)

  5. Problem 5

    Consider a circular necklace with 20132013 beads. Each bead can be painted either white or green. A painting of the necklace is called good, if among any 2121 successive beads there is at least one green bead. Prove that the number of good paintings of the necklace is odd.

    (Two paintings that differ on some beads, but can be obtained from each other by rotating or flipping the necklace, are counted as different paintings.)