Found problems: 638
For an ${n\times n}$ matrix $A$, let $X_{i}$ be the set of entries in row $i$, and $Y_{j}$ the set of entries in column $j$, ${1\leq i,j\leq n}$. We say that $A$ is [i]golden[/i] if ${X_{1},\dots ,X_{n},Y_{1},\dots ,Y_{n}}$ are distinct sets. Find the least integer $n$ such that there exists a ${2004\times 2004}$ golden matrix with entries in the set ${\{1,2,\dots ,n\}}$.
We have a set of ${221}$ real numbers whose sum is ${110721}$. It is deemed that the numbers form a rectangular table such that every row as well as the first and last columns are arithmetic progressions of more than one element. Prove that the sum of the elements in the four corners is equal to ${2004}$.
Let $S$ be the set of $2\times2$-matrices over $\mathbb{F}_{p}$ with trace $1$ and determinant $0$. Determine $|S|$.
Find all positive integers $x>1, y$ and primes $p,q$ such that $p^{x}=2^{y}+q^{x}$
Let $A \in \mathcal{M}_n(\mathbb{R})$ be an invertible matrix.
a) Prove that the eigenvalues of $AA^T$ are positive real numbers.
b) We assume that there are two distinct positive integers, $p$ and $q$, such that $(AA^T)^p=(A^TA)^q.$ Prove that $A^T=A^{-1}.$
Let be the sequence of sets $ \left(\left\{ A\in\mathcal{M}_2\left(\mathbb{R} \right) | A^{n+1} =2003^nA\right\}\right)_{n\ge 1} . $
[b]a)[/b] Prove that each term of the above sequence hasn't a finite cardinal.
[b]b)[/b] Determine the intersection of the third element of the above sequence with the $ 2003\text{rd} $ element.
[i]Gheorghe Iurea[/i]
[hide=Note]Similar with [url]https://artofproblemsolving.com/community/c7h1943241p13387495[/url].[/hide]
$n(\geq 2)$ is a given integer and $T$ is set of all $n\times n$ matrices whose entries are elements of the set $S=\{1,\cdots,2017\}$. Evaluate the following value.
\[\sum_{A\in T} \text{det}(A)\]
Let $H$ be an $n\times n$ matrix all of whose entries are $\pm1$ and whose rows are mutually orthogonal. Suppose $H$ has an $a\times b$ submatrix whose entries are all $1.$ Show that $ab\le n.$
Let $\{A_{1},\dots,A_{k}\}$ be matrices which make a group under matrix multiplication. Suppose $M=A_{1}+\dots+A_{k}$. Prove that each eigenvalue of $M$ is equal to $0$ or $k$.
Prove that these two statements are equivalent for an $n$ dimensional vector space $V$:
[b]$\cdot$[/b] For the linear transformation $T:V\longrightarrow V$ there exists a base for $V$ such that the representation of $T$ in that base is an upper triangular matrix.
[b]$\cdot$[/b] There exist subspaces $\{0\}\subsetneq V_1 \subsetneq ...\subsetneq V_{n-1}\subsetneq V$ such that for all $i$, $T(V_i)\subseteq V_i$.
Let $a, b, c, d$ be integers. Show that the product \[(a-b)(a-c)(a-d)(b-c)(b-d)(c-d)\] is divisible by $12$.
Prove that for any natural numbers $0 \leq i_1 < i_2 < \cdots < i_k$ and $0 \leq j_1 < j_2 < \cdots < j_k$, the matrix $A = (a_{rs})_{1\leq r,s\leq k}$, $a_{rs} = {i_r + j_s\choose i_r} = {(i_r + j_s)!\over i_r!\, j_s!}$ ($1\leq r,s\leq k$) is nonsingular.
Let $a,b, p_1 ,p_2, \ldots, p_n$ be real numbers with $a \ne b$. Define $f(x)= (p_1 -x) (p_2 -x) \cdots (p_n -x)$. Show that
$$ \text{det} \begin{pmatrix} p_1 & a& a & \cdots & a \\
b & p_2 & a & \cdots & a\\
b & b & p_3 & \cdots & a\\
\vdots & \vdots & \vdots & \ddots & \vdots\\
b & b& b &\cdots &p_n
\end{pmatrix}= \frac{bf(a) -af(b)}{b-a}.$$
There are $4$ distinct codes used in an intelligence station, one of them applied in each week. No two codes used in two adjacent weeks are the same code. Knowing that code $A$ is used in the first week, find the probability that code $A$ is used in the seventh week.
Consider the set
\[M = \left\{
\begin{pmatrix}
a & b \\
c & d
\end{pmatrix}
\in\mathcal{M}_2(\mathbb{C})\ |\ ab = cd
\right\}.\]
a) Give an example of matrix $A\in M$ such that $A^{2017}\in M$ and $A^{2019}\in M$, but $A^{2018}\notin M$.
b) Show that if $A\in M$ and there exists the integer number $k\ge 1$ such that $A^k \in M$, $A^{k + 1}\in M$ si $A^{k + 2} \in M$, then $A^n\in M$, for any integer number $n\ge 1$.
Given two distinct elements $a,b \in \{-1,0,1\}$, consider the matrix $A$ .
Find a subset $S$ of the set of the rows of $A$, of minimum size, such that every other row of $A$ is a linear combination of the rows in $S$ with integer coefficients.
Let $n \ge 1$ be a positive integer. An $n \times n$ matrix is called [i]good[/i] if each entry is a non-negative integer, the sum of entries in each row and each column is equal. A [i]permutation[/i] matrix is an $n \times n$ matrix consisting of $n$ ones and $n(n-1)$ zeroes such that each row and each column has exactly one non-zero entry.
Prove that any [i]good[/i] matrix is a sum of finitely many [i]permutation[/i] matrices.
Let $A$ be the set of $n$-digit integers whose digits are all from $\{ 1, 2, 3, 4, 5 \}$. $B$ is subset of $A$ such that it contains digit $5$, and there is no digit $3$ in front of digit $5$ (i.e. for $n = 2$, $35$ is not allowed, but $53$ is allowed). How many elements does set $B$ have?
Let $n\geq 2$ and $1 \leq r \leq n$. Consider the set $S_r=(A \in M_n(\mathbb{Z}_2), rankA=r)$. Compute the sum $\sum_{X \in S_r}X$
What is the maximal dimension of a linear subspace $ V$ of the vector space of real $ n \times n$ matrices such that for all $ A$ in $ B$ in $ V$, we have $ \text{trace}\left(AB\right) \equal{} 0$ ?
Denote by $\mathcal M_2(\mathbb R)$ the set of all $2\times2$ matrices with real entries. Prove that:
a) for every $A\in\mathcal M_2(\mathbb R)$ there exist $B,C\in\mathcal M_2(\mathbb R)$ such that $A=B^2+C^2$;
b) there do not exist $B,C\in\mathcal M_2(\mathbb R)$ such that $\begin{pmatrix}0&1\\1&0\end{pmatrix}=B^2+C^2$ and $BC=CB$.
A matrix $M$ is called idempotent if $M^2 = M$. Find an idempotent $2 \times 2$ matrix with distinct rational entries or write “none” if none exist.
For $n\ge 1$ let $d_n$ be the $\gcd$ of the entries of $A^n-\mathcal{I}_2$ where
\[ A=\begin{pmatrix} 3&2\\ 4&3\end{pmatrix}\quad \text{ and }\quad \mathcal{I}_2=\begin{pmatrix}1&0\\ 0&1\\\end{pmatrix}\]
Show that $\lim_{n\to \infty}d_n=\infty$.
Numbers $1, 2,\cdots, 16$ are written in a $4\times 4$ square matrix so that the sum of the numbers in every row, every column, and every diagonal is the same and furthermore that the numbers $1$ and $16$ lie in opposite corners. Prove that the sum of any two numbers symmetric with respect to the center of the square equals $17$.
For a $ n\times n $ real matrix $ M, $ prove that
[b]a)[/b] $ M=0 $ if $ \text{tr} \left(M^tM\right) =0. $
[b]b)[/b] $ ^tM=M $ if $M^tM=M^2. $
[b]c)[/b] $ ^tM=-M $ if $ M^tM=-M^2. $
[b]d)[/b] Give example of a $ 2\times 2 $ real matrix $ A $ satisfying the following:
$ \text{(i)} ^tA\cdot A^2=A^3 $ and $ ^tA\neq A $
$ \text{(ii)} ^tA\cdot A^2=-A^3 $ and $ ^tA\neq -A $
[i]Vasile Pop[/i]