Let $A, B \in M_6 (\mathbb{Z} )$ such that $A \equiv I \equiv B \text{ mod }3$ and $A^3 B^3 A^3 = B^3$. Prove that $A = I$. Here $M_6 (\mathbb{Z} )$ indicates the $6$ by $6$ matrices with integer entries, $I$ is the identity matrix, and $X \equiv Y \text{ mod }3$ means all entries of $X-Y$ are divisible by $3$.

Let $\mathbb{M}$ be the vector space of $m \times p$ real matrices. For a vector subspace $S\subseteq \mathbb{M}$, denote by $\delta(S)$ the dimension of the vector space generated by all columns of all matrices in $S$. Say that a vector subspace $T\subseteq \mathbb{M}$ is a $\emph{covering matrix space}$ if \[ \bigcup_{A\in T, A\ne \mathbf{0}} \ker A =\mathbb{R}^p \] Such a $T$ is minimal if it doesn't contain a proper vector subspace $S\subset T$ such that $S$ is also a covering matrix space. [list] (a) (8 points) Let $T$ be a minimal covering matrix space and let $n=\dim (T)$ Prove that \[ \delta(T)\le \dbinom{n}{2} \] (b) (2 points) Prove that for every integer $n$ we can find $m$ and $p$, and a minimal covering matrix space $T$ as above such that $\dim T=n$ and $\delta(T)=\dbinom{n}{2}$[/list]

Let be a $ 2\times 2 $ real matrix $ A $ whose primary diagonal has positive elements and whose secondary diagonal has negative elements. If $ \det A>0, $ show that [b]a)[/b] for any $ 2\times 2 $ matrix $ X $ of positive real numbers there exists a $ 2\times 2 $ matrix of positive real numbers such that $ AY=X. $ [b]b)[/b] there is a $ 2\times 2 $ matrix $ Z $ of positive real numbers having the property that all elements of $ AZ $ are positive. [i]Vasile Pop[/i]

Let $M$ be a matrix with $r$ rows and $c$ columns. Each entry of $M$ is a nonnegative integer. Let $a$ be the average of all $rc$ entries of $M$. If $r > {(10 a + 10)}^c$, prove that $M$ has two identical rows.

Let $ A$ and $ B$ be nonsingular matrices of order $ p$, and let $ \xi$ and $ \eta$ be independent random vectors of dimension $ p$. Show that if $ \xi,\eta$ and $ \xi A\plus{} \eta B$ have the same distribution, if their first and second moments exist, and if their covariance matrix is the identity matrix, then these random vectors are normally distributed. [i]B. Gyires[/i]

Introduce a standard scalar product in $\mathbb{R}^4.$ Let $V$ be a partial vector space in $\mathbb{R}^4$ produced by $\left( \begin{array}{c} 1 \\ -1 \\ -1 \\ 1 \end{array} \right),\left( \begin{array}{c} 1 \\-1 \\ 1 \\ -1 \end{array} \right).$ Find a pair of base of orthogonal complement $W$ for $V$ in $\mathbb{R}^4.$

Investigate the convergence of the integral \[\int_{-\infty}^{\infty}\int_{-\infty}^{\infty}\frac{dxdy}{1+x^4y^4}\]

[b]a)[/b] Determine the center of the ring of square matrices of a certain dimensions with elements in a given field, and prove that it is isomorphic with the given field. [b]b)[/b] Prove that $$ \left(\mathcal{M}_n\left( \mathbb{R} \right) ,+, \cdot\right)\not\cong \left(\mathcal{M}_n\left( \mathbb{C} \right) ,+,\cdot\right) , $$ for any natural number $ n\ge 2. $ [i]Marian Andronache, Ion Sava[/i]

Let $ ABC$ be an isosceles right triangle and $M$ be the midpoint of its hypotenuse $AB$. Points $D$ and $E$ are taken on the legs $AC$ and $BC$ respectively such that $AD=2DC$ and $BE=2EC$. Lines $AE$ and $DM$ intersect at $F$. Show that $FC$ bisects the $\angle DFE$.

In how many ways can one fill an $n*n$ matrix with $+1$ and $-1$ so that the product of the entries in each row and each column equals $-1$?

For any positive integer $ n$, let \[f(n) \equal{} \begin{cases} \log_8{n}, & \text{if }\log_8{n}\text{ is rational,} \\ 0, & \text{otherwise.} \end{cases}\] What is $ \sum_{n \equal{} 1}^{1997}{f(n)}$? $ \textbf{(A)}\ \log_8{2047}\qquad \textbf{(B)}\ 6\qquad \textbf{(C)}\ \frac {55}{3}\qquad \textbf{(D)}\ \frac {58}{3}\qquad \textbf{(E)}\ 585$

Let $(G,\cdot)$ be a finite group with the identity element, $e$. The smallest positive integer $n$ with the property that $x^{n}= e$, for all $x \in G$, is called the [i]exponent[/i] of $G$. (a) For all primes $p \geq 3$, prove that the multiplicative group $\mathcal G_{p}$ of the matrices of the form $\begin{pmatrix}\hat 1 & \hat a & \hat b \\ \hat 0 & \hat 1 & \hat c \\ \hat 0 & \hat 0 & \hat 1 \end{pmatrix}$, with $\hat a, \hat b, \hat c \in \mathbb Z \slash p \mathbb Z$, is not commutative and has [i]exponent[/i] $p$. (b) Prove that if $\left( G, \circ \right)$ and $\left( H, \bullet \right)$ are finite groups of [i]exponents[/i] $m$ and $n$, respectively, then the group $\left( G \times H, \odot \right)$ with the operation given by $(g,h) \odot \left( g^\prime, h^\prime \right) = \left( g \circ g^\prime, h \bullet h^\prime \right)$, for all $\left( g,h \right), \, \left( g^\prime, h^\prime \right) \in G \times H$, has the [i]exponent[/i] equal to $\textrm{lcm}(m,n)$. (c) Prove that any $n \geq 3$ is the [i]exponent[/i] of a finite, non-commutative group. [i]Ion Savu[/i]

In triangle $ABC$, the medians and bisectors corresponding to sides $BC$, $CA$, $AB$ are $m_a$, $m_b$, $m_c$ and $w_a$, $w_b$, $w_c$ respectively. $P=w_a \cap m_b$, $Q=w_b \cap m_c$, $R=w_c \cap m_a$. Denote the areas of triangle $ABC$ and $PQR$ by $F_1$ and $F_2$ respectively. Find the least positive constant $m$ such that $\frac{F_1}{F_2}<m$ holds for any $\triangle{ABC}$.

Calculate $ \begin{pmatrix}1&0&0& \ldots &0\\\binom{1}{0} &\binom{1}{1} &0& \ldots & 0 \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ \binom{n}{0} &\binom{n}{1} & \binom{n}{2} & \ldots & \binom{n}{n}\end{pmatrix}^{-1} . $

Cards numbered from 1 to $2^n$ are distributed among $k$ children, $1\leq k\leq 2^n$, so that each child gets at least one card. Prove that the number of ways to do that is divisible by $2^{k-1}$ but not by $2^k$. [i] M. Ivanov [/i]

Find all positive integers $x>1, y$ and primes $p,q$ such that $p^{x}=2^{y}+q^{x}$

Let $A$ be an $n\times n$ square matrix with integer entries. Suppose that $p^2A^{p^2}=q^2A^{q^2}+r^2I_n$ for some positive integers $p,q,r$ where $r$ is odd and $p^2=q^2+r^2$. Prove that $|\det A|=1$. (Here $I_n$ means the $n\times n$ identity matrix.)

Determine the number of $n$-tuples of integers $(x_1,x_2,\cdots ,x_n)$ such that $|x_i| \le 10$ for each $1\le i \le n$ and $|x_i-x_j| \le 10$ for $1 \le i,j \le n$.

Given $5n$ real numbers $r_i, s_i, t_i, u_i, v_i \geq 1 (1 \leq i \leq n)$, let $R = \frac {1}{n} \sum_{i=1}^{n} r_i$, $S = \frac {1}{n} \sum_{i=1}^{n} s_i$, $T = \frac {1}{n} \sum_{i=1}^{n} t_i$, $U = \frac {1}{n} \sum_{i=1}^{n} u_i$, $V = \frac {1}{n} \sum_{i=1}^{n} v_i$. Prove that $\prod_{i=1}^{n}\frac {r_i s_i t_i u_i v_i + 1}{r_i s_i t_i u_i v_i - 1} \geq \left(\frac {RSTUV +1}{RSTUV - 1}\right)^n$.

A set $M$ consists of $n$ elements. Find the greatest $k$ for which there is a collection of $k$ subsets of $M$ such that for any subsets $A_{1},...,A_{j}$ from the collection, there is an element belonging to an odd number of them

Let $ u,v $ be two endomorphisms of a finite vectorial space that verify the relation $ uv-vu=u. $ Calculate $ u^kv-vu^k $ and show that u is nilpotent.

Let $S_n$ denote the set of all permutations of the numbers $1,2,\dots,n.$ For $\pi\in S_n,$ let $\sigma(\pi)=1$ if $\pi$ is an even permutation and $\sigma(\pi)=-1$ if $\pi$ is an odd permutation. Also, let $v(\pi)$ denote the number of fixed points of $\pi.$ Show that \[ \sum_{\pi\in S_n}\frac{\sigma(\pi)}{v(\pi)+1}=(-1)^{n+1}\frac{n}{n+1}. \]

Let $n\in \mathbb{N},\ n\ge 2$. For any matrix $A\in \mathcal{M}_n(\mathbb{C})$, let $m(A)$ be the number of non-zero minors of $A$. Prove that: a)$m(I_n)=2^n-1$; b)If $A\in \mathcal{M}_n(\mathbb{C})$ is non-singular, then $m(A)\ge 2^n-1$. [i]Marius Ghergu[/i]

Let $A$ be a real $n\times n$ matrix satisfying $$A+A^{\text T}=I,$$where $A^{\text T}$ denotes the transpose of $A$ and $I$ the $n\times n$ identity matrix. Show that $\det A>0$.

We are given $ 3^{2k}$ apparently identical coins,one of which is fake,being lighter than the others. We also dispose of three apparently identical balances without weights, one of which is broken (and yields outcomes unrelated to the actual situations). How can we find the fake coin in $ 3k\plus{}1$ weighings?