Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

Studolymp / IMC / 2003

IMC 2003
contestants 185 · problems 12 (6+6) · scale 0–20 · per-problem yes

Problems

Day 1

Problem 1

(a) Let a1,a2,…a_1, a_2, \dots be a sequence of real numbers such that a1=1a_1 = 1 and an+1>32ana_{n+1} > \frac{3}{2} a_n for all nn. Prove that the sequence an(32)n−1\frac{a_n}{\left( \frac{3}{2} \right)^{n-1}} has a finite limit or tends to infinity. (10 points)

(b) Prove that for all α>1\alpha > 1 there exists a sequence a1,a2,…a_1, a_2, \dots with the same properties such that lim⁡an(32)n−1=α.\lim \frac{a_n}{\left( \frac{3}{2} \right)^{n-1}} = \alpha. (10 points)

Problem 2

Let a1,a2…,a51a_1, a_2 \dots, a_{51} be non-zero elements of a field. We simultaneously replace each element with the sum of the 50 remaining ones. In this way we get a sequence b1…,b51b_1 \dots, b_{51}. If this new sequence is a permutation of the original one, what can be the characteristic of the field? (The characteristic of a field is pp, if pp is the smallest positive integer such that x+x+⋯+x⏟p=0\underbrace{x + x + \dots + x}_{p} = 0 for any element xx of the field. If there exists no such pp, the characteristic is 0.)

Problem 3

Let AA be an n×nn \times n real matrix such that 3A3=A2+A+I3 A^3 = A^2 + A + I (II is the identity matrix). Show that the sequence AkA^k converges to an idempotent matrix. (A matrix BB is called idempotent if B2=BB^2 = B.)

Problem 4

Determine the set of all pairs (a,b)(a, b) of positive integers for which the set of positive integers can be decomposed into two sets AA and BB such that a⋅A=b⋅Ba \cdot A = b \cdot B.

Problem 5

Let g:[0,1]→Rg : [0,1] \to \mathbb{R} be a continuous function and let fn:[0,1]→Rf_n : [0,1] \to \mathbb{R} be a sequence of functions defined by f0(x)=g(x)f_0(x) = g(x) and fn+1(x)=1x∫0xfn(t) dt(x∈(0,1], n=0,1,2,… ).f_{n+1}(x) = \frac{1}{x} \int_0^x f_n(t)\,dt \quad (x \in (0,1],\ n = 0, 1, 2, \dots). Determine lim⁡n→∞fn(x)\lim\limits_{n \to \infty} f_n(x) for every x∈(0,1]x \in (0,1].

Problem 6

Let f(z)=anzn+an−1zn−1+⋯+a1z+a0f(z) = a_n z^n + a_{n-1} z^{n-1} + \dots + a_1 z + a_0 be a polynomial with real coefficients. Prove that if all roots of ff lie in the left half-plane {z∈C:Re⁡z<0}\{ z \in \mathbb{C} : \operatorname{Re} z < 0 \} then akak+3<ak+1ak+2a_k a_{k+3} < a_{k+1} a_{k+2} holds for every k=0,1,…,n−3k = 0, 1, \dots, n-3.

Day 2

Problem 7

Let AA and BB be n×nn \times n real matrices such that AB+A+B=0AB + A + B = 0. Prove that AB=BAAB = BA.

Problem 8

Evaluate the limit lim⁡x→0+∫x2xsin⁡mttn dt(m,n∈N).\lim_{x \to 0+} \int_x^{2x} \frac{\sin^m t}{t^n}\,dt \quad (m, n \in \mathbb{N}).

Problem 9

Let AA be a closed subset of Rn\mathbb{R}^n and let BB be the set of all those points b∈Rnb \in \mathbb{R}^n for which there exists exactly one point a0∈Aa_0 \in A such that ∣a0−b∣=inf⁡a∈A∣a−b∣.|a_0 - b| = \inf_{a \in A} |a - b|. Prove that BB is dense in Rn\mathbb{R}^n; that is, the closure of BB is Rn\mathbb{R}^n.

Problem 10

Find all positive integers nn for which there exists a family FF of three-element subsets of S={1,2,…,n}S = \{1, 2, \dots, n\} satisfying the following two conditions:

(i) for any two different elements a,b∈Sa, b \in S, there exists exactly one A∈FA \in F containing both a,ba, b;

(ii) if a,b,c,x,y,za, b, c, x, y, z are elements of SS such that if

{a,b,x},{a,c,y},{b,c,z}∈F\{a,b,x\}, \{a,c,y\}, \{b,c,z\} \in F, then {x,y,z}∈F\{x,y,z\} \in F.

Problem 11

(a) Show that for each function f:Q×Q→Rf : \mathbb{Q} \times \mathbb{Q} \to \mathbb{R} there exists a function g:Q→Rg : \mathbb{Q} \to \mathbb{R} such that f(x,y)≤g(x)+g(y)f(x, y) \le g(x) + g(y) for all x,y∈Qx, y \in \mathbb{Q}.

(b) Find a function f:R×R→Rf : \mathbb{R} \times \mathbb{R} \to \mathbb{R} for which there is no function g:R→Rg : \mathbb{R} \to \mathbb{R} such that f(x,y)≤g(x)+g(y)f(x, y) \le g(x) + g(y) for all x,y∈Rx, y \in \mathbb{R}.

Problem 12

Let (an)n∈N(a_n)_{n \in \mathbb{N}} be the sequence defined by a0=1,an+1=1n+1∑k=0nakn−k+2.a_0 = 1, \qquad a_{n+1} = \frac{1}{n+1} \sum_{k=0}^{n} \frac{a_k}{n - k + 2}. Find the limit lim⁡n→∞∑k=0nak2k,\lim_{n \to \infty} \sum_{k=0}^{n} \frac{a_k}{2^k}, if it exists.