uniolympiads Ελληνικά

IMC 2015

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

Official files

  1. Problem 1 (Day 1)

    For any integer n≥2n \ge 2 and two n×nn \times n matrices with real entries AA, BB that satisfy the equation

    A−1+B−1=(A+B)−1A^{-1} + B^{-1} = (A + B)^{-1}

    prove that det⁡(A)=det⁡(B)\det(A) = \det(B).

    Does the same conclusion follow for matrices with complex entries?

    Hints and solution

  2. Problem 2 (Day 1)

    For a positive integer nn, let f(n)f(n) be the number obtained by writing nn in binary and replacing every 00 with 11 and vice versa. For example, n=23n = 23 is 1011110111 in binary, so f(n)f(n) is 10001000 in binary, therefore f(23)=8f(23) = 8. Prove that

    ∑k=1nf(k)≤n24.\sum_{k=1}^{n} f(k) \le \frac{n^2}{4}.

    When does equality hold?

    Hints and solution

  3. Problem 3 (Day 1)

    Let F(0)=0F(0) = 0, F(1)=32F(1) = \frac{3}{2}, and F(n)=52F(n−1)−F(n−2)F(n) = \frac{5}{2}F(n-1) - F(n-2) for n≥2n \ge 2.

    Determine whether or not ∑n=0∞1F(2n)\sum_{n=0}^{\infty} \frac{1}{F(2^n)} is a rational number.

    Hints and solution

  4. Problem 4 (Day 1)

    Determine whether or not there exist 1515 integers m1,…,m15m_1, \dots, m_{15} such that

    ∑k=115mk⋅arctan⁡(k)=arctan⁡(16).\sum_{k=1}^{15} m_k \cdot \arctan(k) = \arctan(16).

    Hints and solution

  5. Problem 5 (Day 1)

    Let n≥2n \ge 2, let A1,A2,…,An+1A_1, A_2, \dots, A_{n+1} be n+1n + 1 points in the nn-dimensional Euclidean space, not lying on the same hyperplane, and let BB be a point strictly inside the convex hull of A1,A2,…,An+1A_1, A_2, \dots, A_{n+1}. Prove that ∠AiBAj>90∘\angle A_iBA_j > 90^\circ holds for at least nn pairs (i,j)(i, j) with 1≤i<j≤n+11 \le i < j \le n + 1.

    Hints and solution

  6. Problem 6 (Day 2)

    Prove that

    ∑n=1∞1n (n+1)<2.\sum_{n=1}^{\infty} \frac{1}{\sqrt{n}\,(n+1)} < 2.

    Hints and solution

  7. Problem 7 (Day 2)

    Compute

    lim⁡A→+∞1A∫1AA1x dx.\lim_{A \to +\infty} \frac{1}{A} \int_1^A A^{\frac{1}{x}}\,dx.

    Hints and solution

  8. Problem 8 (Day 2)

    Consider all 262626^{26} words of length 2626 in the Latin alphabet. Define the weight of a word as 1/(k+1)1/(k+1), where kk is the number of letters not used in this word. Prove that the sum of the weights of all words is 3753^{75}.

    Hints and solution

  9. Problem 9 (Day 2)

    An n×nn \times n complex matrix AA is called t-normal if AAt=AtAAA^t = A^tA where AtA^t is the transpose of AA. For each nn, determine the maximum dimension of a linear space of complex n×nn \times n matrices consisting of t-normal matrices.

    Hints and solution

  10. Problem 10 (Day 2)

    Let nn be a positive integer, and let p(x)p(x) be a polynomial of degree nn with integer coefficients. Prove that

    max⁡0≤x≤1∣p(x)∣>1en.\max_{0 \le x \le 1} |p(x)| > \frac{1}{e^n}.

    Hints and solution