15th IMC

IMC 2008

Blagoevgrad, Bulgaria · papers 27 July & 28 July 2008 · 12 problems across 2 papers

Official result files

Day 1

27 July 2008 · 6 problems
  1. Problem 1

    Find all continuous functions f:RRf : \mathbb{R} \to \mathbb{R} such that f(x)f(y)f(x) - f(y) is rational for all reals xx and yy such that xyx - y is rational.

  2. Problem 2

    Denote by VV the real vector space of all real polynomials in one variable, and let P:VRP : V \to \mathbb{R} be a linear map. Suppose that for all f,gVf, g \in V with P(fg)=0P(fg) = 0 we have P(f)=0P(f) = 0 or P(g)=0P(g) = 0. Prove that there exist real numbers x0x_0, cc such that P(f)=cf(x0)P(f) = c f(x_0) for all fVf \in V.

  3. Problem 3

    Let pp be a polynomial with integer coefficients and let a1<a2<<aka_1 < a_2 < \dots < a_k be integers.

    a) Prove that there exists aZa \in \mathbb{Z} such that p(ai)p(a_i) divides p(a)p(a) for all i=1,2,,ki = 1, 2, \dots, k.

    b) Does there exist an aZa \in \mathbb{Z} such that the product p(a1)p(a2)p(ak)p(a_1) \cdot p(a_2) \cdot \dots \cdot p(a_k) divides p(a)p(a)?

  4. Problem 4

    We say a triple (a1,a2,a3)(a_1, a_2, a_3) of nonnegative reals is better than another triple (b1,b2,b3)(b_1, b_2, b_3) if two out of the three following inequalities a1>b1a_1 > b_1, a2>b2a_2 > b_2, a3>b3a_3 > b_3 are satisfied. We call a triple (x,y,z)(x,y,z) special if xx, yy, zz are nonnegative and x+y+z=1x + y + z = 1. Find all natural numbers nn for which there is a set SS of nn special triples such that for any given special triple we can find at least one better triple in SS.

  5. Problem 5

    Does there exist a finite group GG with a normal subgroup HH such that AutH>AutG|\operatorname{Aut} H| > |\operatorname{Aut} G|?

  6. Problem 6

    For a permutation σ=(i1,i2,,in)\sigma = (i_1, i_2, \dots, i_n) of (1,2,,n)(1, 2, \dots, n) define D(σ)=k=1nikkD(\sigma) = \sum\limits_{k=1}^{n} |i_k - k|. Let Q(n,d)Q(n,d) be the number of permutations σ\sigma of (1,2,,n)(1, 2, \dots, n) with d=D(σ)d = D(\sigma). Prove that Q(n,d)Q(n,d) is even for d2nd \ge 2n.

Day 2

28 July 2008 · 6 problems
  1. Problem 1

    Let nn, kk be positive integers and suppose that the polynomial x2kxk+1x^{2k} - x^k + 1 divides x2n+xn+1x^{2n} + x^n + 1. Prove that x2k+xk+1x^{2k} + x^k + 1 divides x2n+xn+1x^{2n} + x^n + 1.

  2. Problem 2

    Two different ellipses are given. One focus of the first ellipse coincides with one focus of the second ellipse. Prove that the ellipses have at most two points in common.

  3. Problem 3

    Let nn be a positive integer. Prove that 2n12^{n-1} divides

    0k<n/2(n2k+1)5k.\sum_{0 \le k < n/2} \binom{n}{2k+1} 5^k.
  4. Problem 4

    Let Z[x]\mathbb{Z}[x] be the ring of polynomials with integer coefficients, and let f(x),g(x)Z[x]f(x), g(x) \in \mathbb{Z}[x] be nonconstant polynomials such that g(x)g(x) divides f(x)f(x) in Z[x]\mathbb{Z}[x]. Prove that if the polynomial f(x)2008f(x) - 2008 has at least 8181 distinct integer roots, then the degree of g(x)g(x) is greater than 55.

  5. Problem 5

    Let nn be a positive integer, and consider the matrix A=(aij)1i,jnA = (a_{ij})_{1 \le i,j \le n}, where

    aij={1if i+j is a prime number,0otherwise.a_{ij} = \begin{cases} 1 & \text{if } i + j \text{ is a prime number}, \\ 0 & \text{otherwise.} \end{cases}

    Prove that detA=k2|\det A| = k^2 for some integer kk.

  6. Problem 6

    Let H\mathcal{H} be an infinite-dimensional real Hilbert space, let d>0d > 0, and suppose that SS is a set of points (not necessarily countable) in H\mathcal{H} such that the distance between any two distinct points in SS is equal to dd. Show that there is a point yHy \in \mathcal{H} such that

    {2d(xy)  :  xS}\left\{ \frac{\sqrt{2}}{d}(x - y) \;:\; x \in S \right\}

    is an orthonormal system of vectors in H\mathcal{H}.