Found problems: 638
Let $n$ be a positive integer, and let $M_n$ be the set of invertible matrices with integer entries and size $n \times n$.
(a) Find the largest possible value of $n$ such that there exists a symmetric matrix $A \in M_n$ satisfying
\[
\det(A^{20} + A^{24}) < 2024.
\]
(b) Prove that for every $n$, there exists a matrix $B \in M_n$ such that
\[
\det(B^{20} + B^{24}) < 2024.
\]
To each number with $n^2$ digits, we associate the $n\times n$ determinant of the matrix obtained by writing the digits of the number in order along the rows. For example : $8617\mapsto \det \left(\begin{matrix}{\;8}& 6\;\\ \;1 &{ 7\;}\end{matrix}\right)=50$.
Find, as a function of $n$, the sum of all the determinants associated with $n^2$-digit integers. (Leading digits are assumed to be nonzero; for example, for $n = 2$, there are $9000$ determinants.)
Let $ f$ be a real-valued function on the plane such that for every square $ ABCD$ in the plane, $ f(A)\plus{}f(B)\plus{}f(C)\plus{}f(D)\equal{}0.$ Does it follow that $ f(P)\equal{}0$ for all points $ P$ in the plane?
For each pair of integers $(i,k)$ such that $1\le i\le k$, the linear transformation $P_{i,k}:\mathbb{R}^k\to\mathbb{R}^k$ is defined as:
$P_{i,k}(a_1,\cdots,a_{i-1},a_i,a_{i+1},\cdots,a_k)=(a_1,\cdots,a_{i-1},0,a_{i+1},\cdots,a_k)$
Prove that for all $n\ge2$ and for every set of $n-1$ linearly independent vectors $v_1,\cdots,v_{n-1}$ in $\mathbb{R}^n$, there is an integer $k$ such that $1\le k\le n$ and such that the vectors $P_{k,n}(v_1),\cdots,P_{k,n}(v_{n-1})$ are linearly independent.
$M = (a_{i,j} ), \ i, j = 1, 2, 3, 4$, is a square matrix of order four. Given that:
[list]
[*] [b](i)[/b] for each $i = 1, 2, 3,4$ and for each $k = 5, 6, 7$,
\[a_{i,k} = a_{i,k-4};\]\[P_i = a_{1,}i + a_{2,i+1} + a_{3,i+2} + a_{4,i+3};\]\[S_i = a_{4,i }+ a_{3,i+1} + a_{2,i+2} + a_{1,i+3};\]\[L_i = a_{i,1} + a_{i,2} + a_{i,3} + a_{i,4};\]\[C_i = a_{1,i} + a_{2,i} + a_{3,i} + a_{4,i},\]
[*][b](ii)[/b] for each $i, j = 1, 2, 3, 4$, $P_i = P_j , S_i = S_j , L_i = L_j , C_i = C_j$, and
[*][b](iii)[/b] $a_{1,1} = 0, a_{1,2} = 7, a_{2,1} = 11, a_{2,3} = 2$, and $a_{3,3} = 15$.[/list]
find the matrix M.
Let $n,p \geq 2$ be two integers and $A$ an $n\times n$ matrix with real elements such that $A^{p+1} = A$.
a) Prove that $\textrm{rank} \left( A \right) + \textrm{rank} \left( I_n - A^p \right) = n$.
b) Prove that if $p$ is prime then \[ \textrm{rank} \left( I_n - A \right) = \textrm{rank} \left( I_n - A^2 \right) = \ldots = \textrm{rank} \left( I_n - A^{p-1} \right) . \]
Let be a natural number $ n\ge 2 $ and three $ n\times n $ complex matrices that have the properties that they commute pairwise, their sum is thrice the identity matrix, and their squares are the identity matrix. Prove that these three matrices are equal.
[i]Marius Cavachi[/i]
Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him.
[i]A. Badzyan[/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.
Prove that if a $ 2\times 2 $ complex matrix has the property that there exists a natural number $ n $ such that $ \text{tr}\left( A^n\right) =\text{tr}\left( A^{n+1} \right) =0, $ then $ A^2=0. $
Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.
For which positive integers $n$ does there exist an $n \times n$ matrix $A$ whose entries are all in $\{0,1\}$, such that $A^2$ is the matrix of all ones?
Let $ A$ be a $ n\times n$ matrix with complex elements. Prove that $ A^{\minus{}1} \equal{} \overline{A}$ if and only if there exists an invertible matrix $ B$ with complex elements such that $ A\equal{} B^{\minus{}1} \cdot \overline{B}$.
Prove that there exists an infinite set of points \[ \dots, \; P_{-3}, \; P_{-2},\; P_{-1},\; P_0,\; P_1,\; P_2,\; P_3,\; \dots \] in the plane with the following property: For any three distinct integers $a,b,$ and $c$, points $P_a$, $P_b$, and $P_c$ are collinear if and only if $a+b+c=2014$.
Let $A,B\in \mathcal{M}_n(\mathbb{R})$. Prove that $\text{rank}\ A+\text{rank}\ B\le n$ if and only if there exists an invertible matrix $X\in \mathcal{M}_n(\mathbb{R})$ such that $AXB=O_n$.
We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions:
(1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal.
(2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal.
Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.
In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.
Let $ A$ be an $ n \times n$ matrix whose elements are non-negative real numbers. Assume that $ A$ is a non-singular matrix and all elements of $ A^{\minus{}1}$ are non-negative real numbers. Prove that every row and every column of $ A$ has exactly one non-zero element.
a) Prove that if $k$ is an even positive integer and $A$ is a real symmetric $n\times n$ matrix such that $\operatorname{tr}(A^k)^{k+1}=\operatorname{tr}(A^{k+1})^k$, then
$$A^n=\operatorname{tr}(A)A^{n-1}.$$
b) Does the assertion from a) also hold for odd positive integers $k$?
Given an integer $n\ge 2$, compute $\sum_{\sigma} \textrm{sgn}(\sigma) n^{\ell(\sigma)}$, where all $n$-element permutations are considered, and where $\ell(\sigma)$ is the number of disjoint cycles in the standard decomposition of $\sigma$.
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$.
Consider a matrix of size $n\times n$ whose entries are real numbers of absolute value not exceeding $1$. The sum of all entries of the matrix is $0$. Let $n$ be an even positive integer. Determine the least number $C$ such that every such matrix necessarily has a row or a column with the sum of its entries not exceeding $C$ in absolute value.
[i]Proposed by Marcin Kuczma, Poland[/i]
A square matrix is sum-magic if the sum of all elements in each row, column and major diagonal is constant. Similarly, a square matrix is product-magic if the product of all elements in each row, column and major diagonal is constant.
Determine if there exist $3\times 3$ matrices of real numbers which are both sum-magic and product-magic.
A matrix $\begin{bmatrix}
x & y \\
z & w
\end{bmatrix}$ has square root $\begin{bmatrix}
a & b \\
c & d
\end{bmatrix}$ if
$$\begin{bmatrix}
a & b \\
c & d
\end{bmatrix}^2
=
\begin{bmatrix}
a^2 + bc &ab + bd \\
ac + cd & bc + d^2
\end{bmatrix}
=
\begin{bmatrix}
x & y \\
z & w
\end{bmatrix}$$
Determine how many square roots the matrix $\begin{bmatrix}
2 & 2 \\
3 & 4
\end{bmatrix}$ has (complex coefficients are allowed).
The difference between the cubes of two consecutive positive integers is equal to $n^2$ for a positive integer $n$. Show that $n$ is the sum of two squares.