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

Studolymp / IMC / 1995

IMC 1995
contestants · problems 12 (6+6) · scale 0–10 · per-problem no

No individual results were published for this edition — problems and solutions only.

Problems

Day 1

P1

Let XX be a nonsingular matrix with columns X1,X2,,XnX_1, X_2, \dots, X_n. Let YY be a matrix with columns X2,X3,,Xn,0X_2, X_3, \dots, X_n, 0. Show that the matrices A=YX1A = Y X^{-1} and B=X1YB = X^{-1} Y have rank n1n-1 and have only 00's for eigenvalues.

P2

Let ff be a continuous function on [0,1][0,1] such that for every x[0,1]x \in [0,1] we have x1f(t)dt1x22\int\limits_x^1 f(t)\,dt \ge \dfrac{1-x^2}{2}. Show that 01f2(t)dt13\int\limits_0^1 f^2(t)\,dt \ge \dfrac{1}{3}.

P3

Let ff be twice continuously differentiable on (0,+)(0, +\infty) such that limx0+f(x)=\lim\limits_{x \to 0+} f'(x) = -\infty and limx0+f(x)=+\lim\limits_{x \to 0+} f''(x) = +\infty. Show that limx0+f(x)f(x)=0.\lim_{x \to 0+} \frac{f(x)}{f'(x)} = 0.

P4

Let F:(1,)RF : (1, \infty) \to \mathbb{R} be the function defined by F(x):=xx2dtlnt.F(x) := \int_x^{x^2} \frac{dt}{\ln t}. Show that FF is one-to-one (i.e. injective) and find the range (i.e. set of values) of FF.

P5

Let AA and BB be real n×nn \times n matrices. Assume that there exist n+1n+1 different real numbers t1,t2,,tn+1t_1, t_2, \dots, t_{n+1} such that the matrices Ci=A+tiB,i=1,2,,n+1,C_i = A + t_i B, \quad i = 1, 2, \dots, n+1, are nilpotent (i.e. Cin=0C_i^n = 0).

Show that both AA and BB are nilpotent.

P6

Let p>1p > 1. Show that there exists a constant Kp>0K_p > 0 such that for every x,yRx, y \in \mathbb{R} satisfying xp+yp=2|x|^p + |y|^p = 2, we have (xy)2Kp(4(x+y)2).(x - y)^2 \le K_p \left( 4 - (x+y)^2 \right).

Day 2

P7

Let AA be 3×33 \times 3 real matrix such that the vectors AuAu and uu are orthogonal for each column vector uR3u \in \mathbb{R}^3. Prove that:

a) A=AA^\top = -A, where AA^\top denotes the transpose of the matrix AA;

b) there exists a vector vR3v \in \mathbb{R}^3 such that Au=v×uAu = v \times u for every uR3u \in \mathbb{R}^3, where v×uv \times u denotes the vector product in R3\mathbb{R}^3.

P8

Let {bn}n=0\{b_n\}_{n=0}^{\infty} be a sequence of positive real numbers such that b0=1b_0 = 1, bn=2+bn121+bn1b_n = 2 + \sqrt{b_{n-1}} - 2 \sqrt{1 + \sqrt{b_{n-1}}}. Calculate n=1bn2n.\sum_{n=1}^{\infty} b_n 2^n.

P9

Let all roots of an nn-th degree polynomial P(z)P(z) with complex coefficients lie on the unit circle in the complex plane. Prove that all roots of the polynomial 2zP(z)nP(z)2 z P'(z) - n P(z) lie on the same circle.

P10

a) Prove that for every ε>0\varepsilon > 0 there is a positive integer nn and real numbers λ1,,λn\lambda_1, \dots, \lambda_n such that maxx[1,1]xk=1nλkx2k+1<ε.\max_{x \in [-1,1]} \left| x - \sum_{k=1}^{n} \lambda_k x^{2k+1} \right| < \varepsilon.

b) Prove that for every odd continuous function ff on [1,1][-1,1] and for every ε>0\varepsilon > 0 there is a positive integer nn and real numbers μ1,,μn\mu_1, \dots, \mu_n such that maxx[1,1]f(x)k=1nμkx2k+1<ε.\max_{x \in [-1,1]} \left| f(x) - \sum_{k=1}^{n} \mu_k x^{2k+1} \right| < \varepsilon. Recall that ff is odd means that f(x)=f(x)f(x) = -f(-x) for all x[1,1]x \in [-1,1].

P11

a) Prove that every function of the form f(x)=a02+cosx+n=2Nancos(nx)f(x) = \frac{a_0}{2} + \cos x + \sum_{n=2}^{N} a_n \cos(nx) with a0<1|a_0| < 1, has positive as well as negative values in the period [0,2π)[0, 2\pi).

b) Prove that the function F(x)=n=1100cos(n32x)F(x) = \sum_{n=1}^{100} \cos(n^{\frac{3}{2}} x) has at least 40 zeros in the interval (0,1000)(0, 1000).

P12

Suppose that {fn}n=1\{f_n\}_{n=1}^{\infty} is a sequence of continuous functions on the interval [0,1][0,1] such that 01fm(x)fn(x)dx={1if n=m0if nm\int_0^1 f_m(x) f_n(x)\,dx = \begin{cases} 1 & \text{if } n = m \\ 0 & \text{if } n \ne m \end{cases} and sup{fn(x):x[0,1] and n=1,2,}<+.\sup \{ |f_n(x)| : x \in [0,1] \text{ and } n = 1,2,\dots \} < +\infty. Show that there exists no subsequence {fnk}\{f_{n_k}\} of {fn}\{f_n\} such that limkfnk(x)\lim\limits_{k \to \infty} f_{n_k}(x) exists for all x[0,1]x \in [0,1].