Find the Jordan normal form of the operator $e^{d/dt}$ in the space of quasi-polynomials $\{e^{\lambda t}p(t)\}$ where the degree of the polynomial $p$ is less than $5$, and of the operator $\text{ad}_A$, $B\mapsto [A, B]$, in the space of $n\times n$ matrices $B$, where $A$ is a diagonal matrix.

Let $ A\in\mathcal{M}_4\left(\mathbb{R}\right) $ be an invertible matrix whose trace is equal to the trace of its adjugate, which is nonzero. Show that $ A^2+I $ is singular if and only if there exists a nonzero matrix in $ \mathcal{M}_4\left( \mathbb{R} \right) $ that anti-commutes with it.

Let $n$ be a positive integer. Find the smallest positive integer $k$ with the property that for any colouring nof the squares of a $2n$ by $k$ chessboard with $n$ colours, there are $2$ columns and $2$ rows such that the $4$ squares in their intersections have the same colour.

Let be a natural number $ n\ge 2 $ and two $ n\times n $ complex matrices $ A,B $ that satisfy $ (AB)^3=O_n. $ Does this imply that $ (BA)^3=O_n ? $

Determine, with proof, whether or not there exist integers $a,b,c>2010$ satisfying the equation \[a^3+2b^3+4c^3=6abc+1.\]

Consider the sytem of equations \[ a_{11}x_1+a_{12}x_2+a_{13}x_3 = 0 \]\[a_{21}x_1+a_{22}x_2+a_{23}x_3 =0\]\[a_{31}x_1+a_{32}x_2+a_{33}x_3 = 0 \] with unknowns $x_1, x_2, x_3$. The coefficients satisfy the conditions: a) $a_{11}, a_{22}, a_{33}$ are positive numbers; b) the remaining coefficients are negative numbers; c) in each equation, the sum ofthe coefficients is positive. Prove that the given system has only the solution $x_1=x_2=x_3=0$.

Define a sequence $\{u_n\}_{n=0}^{\infty}$ by $u_0=u_1=u_2=1,$ and thereafter by the condition that $\det\begin{vmatrix} u_n & u_{n+1} \\ u_{n+2} & u_{n+3} \end{vmatrix}=n!$ for all $n\ge 0.$ Show that $u_n$ is an integer for all $n.$ (By convention, $0!=1$.)

Let $A,B \in M_{n}(\mathbb{R}).$ Show that $rank(A) = rank(B)$ if and only if there exist nonsingular matrices $X,Y,Z \in M_{n}(\mathbb{R})$ such that \[ AX + YB = AZB. \]

Let $A=\left( \begin{array}{ccc} 1 & 1& 0 \\ 0 & 1& 0 \\ 0 &0 & 2 \end{array} \right),\ B=\left( \begin{array}{ccc} a & 1& 0 \\ b & 2& c \\ 0 &0 & a+1 \end{array} \right)\ (a,\ b,\ c\in{\mathbb{C}}).$ (1) Find the condition for $a,\ b,\ c$ such that ${\text{rank} (AB-BA})\leq 1.$ (2) Under the condition of (1), find the condition for $a,\ b,\ c$ such that $B$ is diagonalizable.

Let $A=a_{ij}$ is simetrical real matrix. Prove that : $\sum_i e^{a_{ii}} \leq tr (e^A)$

In each field of a table there is a real number. We call such $n \times n$ table [i]silly[/i] if each entry equals the product of all the numbers in the neighbouring fields. a) Find all $2 \times 2$ silly tables. b) Find all $3 \times 3$ silly tables.

Let $a,b\in \mathbb{R}$ such that $b>a^2$. Find all the matrices $A\in \mathcal{M}_2(\mathbb{R})$ such that $\det(A^2-2aA+bI_2)=0$.

Let $n$ be a positive integer. An $n \times n$ matrix (a rectangular array of numbers with $n$ rows and $n$ columns) is said to be a platinum matrix if: [list=i] [*] the $n^2$ entries are integers from $1$ to $n$; [*] each row, each column, and the main diagonal (from the upper left corner to the lower right corner) contains each integer from $1$ to $n$ exactly once; and [*] there exists a collection of $n$ entries containing each of the numbers from $1$ to $n$, such that no two entries lie on the same row or column, and none of which lie on the main diagonal of the matrix. [/list] Determine all values of $n$ for which there exists an $n \times n$ platinum matrix.

Find all positive integers $n \geq 2$ with the following property : there is a matrix $A \in M_{n} (\mathbb{R})$ and a prime number $p \geq 2$ such that $A^{*}$ has exactly $p$ not null elements and $A^{p}=0_{n}$.

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]