# Day 1

Problem 1. Let \(\rm A\) and \(\rm B\) be real symmetric matrixes with all eigenvalues strictly greater than \(1\). Let \(\lambda\) be a real eigenvalue of matrix \(\rm {AB}\). Prove that \(\left| \lambda \right|\gt1\).

Problem 2. Let \(f:\Bbb R \to \Bbb R\) be a twice differentiable function. Suppose \(f(0) = 0\). Prove that there exists \(\xi \in\left({-\frac\pi2,\frac\pi2}\right)\) such that

\[f^{\prime\prime}\left( \xi \right) = f\left( \xi \right)\left(1 + 2\tan^2\xi \right).\]

Problem 3. There are \(2n\) students in a school \(\left( {n \in {\Bbb N},n \geqslant 2} \right)\). Each week \(n\) students go on a trip. After several trips the following condition was fulfiled: every two students were together on at least one trip. What is the minimum number of trips needed for this to happen?

Problem 4. Let \(n\geqslant 3\) and let \(x_1,x_2,\dotsc,x_n\) be nonnegative real numbers. Define \(A = \sum\limits_{i = 1}^n x_i,B = \sum\limits_{i = 1}^n x_i^2,C=\sum\limits_{i = 1}^n x_i^3\). Prove that:

\[ \left(n+1\right)A^2B+\left(n-2\right)B^2\geqslant A^4+\left(2n-2\right)AC.\]

Problem 5. Does there exist a sequence \((a_n)\) of complex numbers such that for every positive integer \(p\) we have that \(\sum\limits_{n=1}^\infty a_n^p\) converges if and only if \(p\) is not a prime?

# Day 2

Problem 1. Let \(z\) be a complex number with \(\left|z+1\right|>2\). Prove that \(\left|z^3+1\right| > 1\).

Problem 2. Let \(p\) and \(q\) be relatively prime positive integers. Prove that

\[\sum_{k=0}^{pq-1}(-1)^{\left[\frac kp\right]+\left[\frac kq\right]}=\begin{cases}0 &\text{if} pq \text{is even},\\1 &\text{if } pq \text{ is odd}.\end{cases}\]

(Here \([x]\) denotes the integer part of \(x\).)

Problem 3. Suppose that \(\mathbf v_1,\mathbf v_2,\dotsc,\mathbf v_d\) are unit vectors in \(\Bbb R^d\). Prove that there exists a unit vector \(\mathbf u\) such that

\[\left| \mathbf u\cdot\mathbf v_i \right| \leqslant \frac1{\sqrt d}\]

for \(i = 1,2,\dotsc,d\).

( Here \(\cdot \) denotes the usual scalar product on \(\Bbb R^d\)).

Problem 4. Does there exist an infinite set \(M\) consisting of positive integers such that for any \(a,b \in M\), with \(a\lt b\), the sum \(a+b\) is square-free?

( A positive integer is called square-free if no perfect square greater than \(1\) divides it ).

Problem 5. Consider a circular necklace with \(2013\) beads. Each bead can be painted either white or green. A painting of the necklace is called *good* if among any \(21\) successive beads there is at least one green bead. Prove that the number of good paintings of the necklace is odd.

(Two paintings that differ on some beads, but can be obtained from each other by rotating or flipping the necklace, are counted as different paintings. )