olymmath

IMC 2015

International Mathematics Competition for University Students 2015.

Other problems

Problem 1

For any integer n≥2n\ge 2 and two n×nn\times n matrices with real entries A,BA, B 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?

(Proposed by Zbigniew Skoczylas, Wroclaw University of Technology)

Problem 2

For a positive integer nn , let f(n)f(n) be the number obtained by writing nn in binary and replacing every 0 with 1 and vice versa. For example, n=23n=23 is 10111 in binary, so f(n)f(n) is 1000 in binary, therefore f(23)=8f(23) =8 . Prove that ∑k=1nf(k)≤n24.\sum_{k=1}^n f(k) \leq \frac{n^2}{4}. When does equality hold?

(Proposed by Stephan Wagner, Stellenbosch University)

Problem 3

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

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

(Proposed by Gerhard Woeginger, Eindhoven University of Technology)

Problem 7

Compute lim⁡A→+∞1A∫1AA1xdx.\lim_{A\to+\infty}\frac1A\int_1^A A^{\frac1x} dx . Proposed by Jan Šustek, University of Ostrava

Problem 8

Consider all 262626^{26} words of length 26 in the Latin alphabet. Define the weight\emph{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} .

Proposed by Fedor Petrov, St. Petersburg State University

Problem 9

An n×nn \times n complex matrix AA is called \emph{t-normal} if AAt=AtAAA^t = A^t A 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.

Proposed by Shachar Carmeli, Weizmann Institute of Science