This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 638

Let $ n$ be a positive integer, and consider the matrix $ A \equal{} (a_{ij})_{1\leq i,j\leq n}$ where $ a_{ij} \equal{} 1$ if $ i\plus{}j$ is prime and $ a_{ij} \equal{} 0$ otherwise. Prove that $ |\det A| \equal{} k^2$ for some integer $ k$.
For what values of $ n$ does there exist an $ n \times n$ array of entries -1, 0 or 1 such that the $ 2 \cdot n$ sums obtained by summing the elements of the rows and the columns are all different?
Suppose that $\displaystyle{{v_1},{v_2},...,{v_d}}$ are unit vectors in $\displaystyle{{{\Bbb R}^d}}$. Prove that there exists a unitary vector $\displaystyle{u}$ such that $\displaystyle{\left| {u \cdot {v_i}} \right| \leq \frac{1}{{\sqrt d }}}$ for $\displaystyle{i = 1,2,...,d}$. [b]Note.[/b] Here $\displaystyle{ \cdot }$ denotes the usual scalar product on $\displaystyle{{{\Bbb R}^d}}$. [i]Proposed by Tomasz Tkocz, University of Warwick.[/i]
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\}}$.
Whether $m$ and $n$ natural numbers, $m,n\ge 2$. Consider matrices, ${{A}_{1}},{{A}_{2}},...,{{A}_{m}}\in {{M}_{n}}(R)$ not all nilpotent. Demonstrate that there is an integer number $k>0$ such that ${{A}^{k}}_{1}+{{A}^{k}}_{2}+.....+{{A}^{k}}_{m}\ne {{O}_{n}}$
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]
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 $A\in M_3(\mathbb Z)$ such that $\det(A)=1$. What is the maximum possible number of entries of $A$ that are even?
Let $n \geq 1$. Find a set of distincts real numbers $\left(x_j\right)_{1\leq j\leq n}$ such that for any bijections $f : \{1, 2,\cdots ,n\}^2 \to \{1, 2,\cdots ,n\}^2$ the matrix $\left(x_{f(i,j)}\right)_{1\leq i,j\leq n}$ is invertible.
Let $M_n$ be the $n\times n$ matrix with entries as follows: for $1\leq i \leq n$, $m_{i,i}=10$; for $1\leq i \leq n-1, m_{i+1,i}=m_{i,i+1}=3$; all other entries in $M_n$ are zero. Let $D_n$ be the determinant of matrix $M_n$. Then $\displaystyle \sum_{n=1}^{\infty} \dfrac{1}{8D_n+1}$ can be represented as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. Note: The determinant of the $1\times 1$ matrix $[a]$ is $a$, and the determinant of the $2\times 2$ matrix $\left[ \begin{array}{cc} a & b \\ c & d \end{array} \right]=ad-bc$; for $n\geq 2$, the determinant of an $n\times n$ matrix with first row or first column $a_1\ a_2\ a_3 \dots\ a_n$ is equal to $a_1C_1 - a_2C_2 + a_3C_3 - \dots + (-1)^{n+1} a_nC_n$, where $C_i$ is the determinant of the $(n-1)\times (n-1)$ matrix found by eliminating the row and column containing $a_i$.
An $(n^2+n+1) \times (n^2+n+1)$ matrix of zeros and ones is given. If no four ones are vertices of a rectangle, prove that the number of ones does not exceed $(n + 1)(n^2 + n + 1).$
a)Prove that any matrix $A\in \mathcal{M}_4(\mathbb{C})$ can be written as a sum of four matrices $B_1,B_2,B_3,B_4\in \mathcal{M}_4(\mathbb{C})$ with the rank equal to $1$. b)$I_4$ can't be written as a sum of less than four matrices with the rank equal to $1$. [i]Manuela Prajea & Ion Savu[/i]
Which of the following are true? $\textbf{(A)}~\exists A\in M_3(\mathbb R)\text{ such that }A^2=-I_3$ $\textbf{(B)}~\exists A,B\in M_3(\mathbb R)\text{ such that }AB-BA=I_3$ $\textbf{(C)}~\forall A\in M_4,\det\left(I_4+A^2\right)\ge0$ $\textbf{(D)}~\text{None of the above}$
In a magic square $n \times n$ composed from the numbers $1,2,\cdots,n^2$, the centers of any two squares are joined by a vector going from the smaller number to the bigger one. Prove that the sum of all these vectors is zero. (A magic square is a square matrix such that the sums of entries in all its rows and columns are equal.)
Let $(a_{i,j})^n_{i,j=1}$ be a real matrix such that $a_{i,i}=0$ for $i=1,2,\ldots,n$. Prove that there exists a set $\mathcal J\subset\{1,2,\ldots,n\}$ of indices such that $$\sum_{\begin{smallmatrix}i\in\mathcal J\\j\notin\mathcal J\end{smallmatrix}}a_{i,j}+\sum_{\begin{smallmatrix}i\notin\mathcal J\\j\in\mathcal J\end{smallmatrix}}a_{i,j}\ge\frac12\sum_{i,j=1}^na_{i,j}.$$
We call an $n\times n$ matrix [i]well groomed[/i] if it only contains elements $0$ and $1$, and it does not contain the submatrix $\begin{pmatrix} 1& 0\\ 0 & 1 \end{pmatrix}.$ Show that there exists a constant $c>0$ such that every well groomed, $n\times n$ matrix contains a submatrix of size at least $cn\times cn$ such that all of the elements of the submatrix are equal. (A well groomed matrix may contain the submatrix $\begin{pmatrix} 0& 1\\ 1 & 0 \end{pmatrix}.$ )
Show that the number $\begin{matrix} \\ N= \end{matrix} \underbrace{44 \ldots 4}_{n} \underbrace{88 \ldots 8}_{n} - 1\underbrace{33 \ldots3 }_{n-1}2$ is a perfect square for all positive integers $n$.
Let $x_1,\cdots, x_n$ be nonzero vectors of a vector space $V$ and $\varphi:V\to V$ be a linear transformation such that $\varphi x_1 = x_1$, $\varphi x_k = x_k - x_{k-1}$ for $k = 2, 3,\ldots,n$. Prove that the vectors $x_1,\ldots,x_n$ are linearly independent.
Let $A$ be a $n \times n$ matrix of real numbers such that $A^2+\mathbb{I}=A$, where $\mathbb{I}$ is the identity $n \times n$ matrix. Prove that the matrix $A^{3n}$ , where $\nu\in\mathbb{Z}$ takes only two values and find those values.
Compute the determinant of the $n\times n$ matrix $A=(a_{ij})_{ij}$, $$a_{ij}=\begin{cases} (-1)^{|i-j|} & \text{if}\, i\ne j,\\ 2 & \text{if}\, i= j. \end{cases}$$
Let $\mathbb{N}=\{1,2,\ldots\}$. Find all functions $f: \mathbb{N}\to\mathbb{N}$ such that for all $m,n\in \mathbb{N}$ the number $f^2(m)+f(n)$ is a divisor of $(m^2+n)^2$.
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 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.
For a given natural number, $ n\ge 2, $ consider two matrices $ A,B\in\mathcal{M}_n(\mathbb{C}) $ that commute and such that $ A $ is invertible and that the function $ M:\mathbb{C}\longrightarrow\mathbb{C} ,M(x)=\det (A+xB) $ is bounded above or below. Prove that $ B^n=0. $ [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]
Given real numbers $x_i,y_i (i=1,2,\ldots ,n)$, let $A$ be the $n\times n$ matrix given by $a_{ij}=1$ if $x_i\ge y_j$ and $a_{ij}=0$ otherwise. Suppose $B$ is a $n\times n$ matrix whose entries are $0$ and $1$ such that the sum of entries in any row or column of $B$ equals the sum of entries in the corresponding row or column of $A$. Prove that $B=A$.