olymmath

SEEMOUS 2010

South Eastern European Mathematical Olympiad for University Students 2010.

Other problems

Problem 1

Let f0:[0,1]→Rf_0:[0,1]\to\mathbb R be a continuous function. Define the sequence of functions fn:[0,1]→Rf_n:[0,1]\to\mathbb R by fn(x)=∫0xfn−1(t)dtf_n(x)=\int^x_0f_{n-1}(t)dt for all integers n≥1n\ge1 .

a) Prove that the series ∑n=1∞fn(x)\sum_{n=1}^\infty f_n(x) is convergent for every x∈[0,1]x\in[0,1] . b) Find an explicit formula for the sum of the series ∑n=1∞fn(x),x∈[0,1]\sum_{n=1}^\infty f_n(x),x\in[0,1] .

Problem 2

Inside a square consider circles such that the sum of their circumferences is twice the perimeter of the square.

a) Find the minimum number of circles having this property. b) Prove that there exist infinitely many lines which intersect at least 3 of these circles.

Problem 3

Denote by M2(R)\mathcal M_2(\mathbb R) the set of all 2×22\times2 matrices with real entries. Prove that:

a) for every A∈M2(R)A\in\mathcal M_2(\mathbb R) there exist B,C∈M2(R)B,C\in\mathcal M_2(\mathbb R) such that A=B2+C2A=B^2+C^2 ; b) there do not exist B,C∈M2(R)B,C\in\mathcal M_2(\mathbb R) such that (0110)=B2+C2\begin{pmatrix}0&11&0\end{pmatrix}=B^2+C^2 and BC=CBBC=CB .

Problem 4

Suppose that AA and BB are n×nn\times n matrices with integer entries, and det⁡B≠0\det B\ne0 . Prove that there exists m∈Nm\in\mathbb N such that the product AB−1AB^{-1} can be represented as AB−1=∑k=1mNk−1,AB^{-1}=\sum_{k=1}^mN_k^{-1}, where NkN_k are n×nn\times n matrices with integer entries for all k=1,…,mk=1,\ldots,m , and Ni≠NjN_i\ne N_j for i≠ji\ne j .