Found problems: 638
Today is Barbara's birthday, and Alberto wants to give her a gift playing the following game. The numbers 0,1,2,...,1024 are written on a blackboard. First Barbara erases $2^{9}$ numbers, then Alberto erases $2^{8}$ numbers, then Barbara $2^{7}$ and so on, until there are only two numbers a,b left. Now Barbara earns $|a-b|$ euro.
Find the maximum number of euro that Barbara can always win, independently of Alberto's strategy.
For an $n\times n$ matrix with real entries let $||M||=\sup_{x\in \mathbb{R}^{n}\setminus\{0\}}\frac{||Mx||_{2}}{||x||_{2}}$, where
$||\cdot||_{2}$ denotes the Euclidean norm on $\mathbb{R}^{n}$. Assume that an $n\times n$ matrxi $A$ with real entries satisfies $||A^{k}-A^{k-1}||\leq\frac{1}{2002k}$ for all positive integers $k$. Prove that $||A^{k}||\leq 2002$ for all positive integers $k$.
Let $ A,B,S $ be three $ 3\times 3 $ complex matrices with $ B=S^{-1}AS , $ and $ S $ nonsingular. Show:
$$ \text{tr} \left( B^2\right) +2\text{tr}(C(B)) = \left(\text{tr} (A)\right)^2 , $$
where $ C(B) $ is the cofactor of $ B. $
[i]Mihai Haivas[/i]
For matrices $A=[a_{ij}]_{m \times m}$ and $B=[b_{ij}]_{m \times m}$ where $A,B \in \mathbb{Z} ^{m \times m}$ let $A \equiv B \pmod{n}$ only if $a_{ij} \equiv b_{ij} \pmod{n}$ for every $i,j \in \{ 1,2,...,m \}$, that's $A-B=nZ$ for some $Z \in \mathbb{Z}^{m \times m}$. (The symbol $A \in \mathbb{Z} ^{m \times m}$ means that every element in $A$ is an integer.)
Prove that for $A \in \mathbb{Z} ^{m \times m}$ there is $B \in \mathbb{Z} ^{m \times m}$ , where $AB \equiv I \pmod{n }$ only if $(\det (A),n)=1$ and find the value of $B$ in the form of $A$ where $I$ represents the dimensional identity matrix $m \times m$.
[i](PP-nine)[/i]
Let $m$ and $n$ be integers greater than $1$ and $a_1 ,a_2 ,\ldots, a_{m+1}$ be real numbers. Prove that there exist real $n\times n$ matrices $A_1 ,A_2,\ldots, A_m$ such that
(i) $\det(A_j) =a_j$ for $j=1,2,\ldots,m$ and
(ii) $\det(A_1 +A_2 +\ldots+A_m)=a_{m+1}.$
Let $p$ be a prime number. Prove that from a $p^2\times p^2$ array of squares, we can select $p^3$ of the squares such that the centers of any four of the selected squares are not the vertices of a rectangle with sides parallel to the edges of the array.
Let $n$ be a positive integer divisible by $4$. Find the number of permutations $\sigma$ of $(1,2,3,\cdots,n)$ which satisfy the condition $\sigma(j)+\sigma^{-1}(j)=n+1$ for all $j \in \{1,2,3,\cdots,n\}$.
Let $A$ be a $3 \times 9$ matrix. All elements of $A$ are positive integers. We call an $m\times n$ submatrix of $A$ "ox" if the sum of its elements is divisible by $10$, and we call an element of $A$ "carboxylic" if it is not an element of any "ox" submatrix. Find the largest possible number of "carboxylic" elements in $A$.
Let $ a,b_0,b_1,b_2,...,b_{n\minus{}1}$ be complex numbers, $ A$ a complex square matrix of order $ p$, and $ E$ the unit matrix of order $ p$. Assuming that the eigenvalues of $ A$ are given, determine the eigenvalues of the matrix
\[ B\equal{}\begin{pmatrix} b_0E&b_1A&b_2A^2&\cdots&b_{n\minus{}1}A^{n\minus{}1} \\
ab_{n\minus{}1}A^{n\minus{}1}&b_0E&b_1A&\cdots&b_{n\minus{}2}A^{n\minus{}2}\\
ab_{n\minus{}2}A^{n\minus{}2}&ab_{n\minus{}1}A^{n\minus{}1}&b_0E&\cdots&b_{n\minus{}3}A^{n\minus{}3}\\
\vdots&\vdots&\vdots&\ddots&\vdots&\\
ab_1A&ab_2A^2&ab_3A^3&\cdots&b_0E
\end{pmatrix}\quad\]
Consider a matrix of size $8 \times 8$, containing positive integers only. One may repeatedly transform the entries of the matrix according to the following rules:
-Multiply all entries in some row by 2.
-Subtract 1 from all entries in some column.
Prove that one can transform the given matrix into the zero matrix.
Find the maximum number of pairwise disjoint sets of the form
$S_{a,b} = \{n^{2}+an+b | n \in \mathbb{Z}\}$, $a, b \in \mathbb{Z}$.
Find all triplets $(\lambda_1,\lambda_2,\lambda_3) \in \mathbb{R}^3$ such that there exists a matrix $A_{3 \times 3}$ with all entries being non-negative reals whose eigenvalues are $\lambda_1,\lambda_2,\lambda_3$.
Consider the $ 4\times 4 $ integer matrices that have the property that each one of them multiplied by its transpose is $
4I. $
[b]a)[/b] Show that the product of the elements of such a matrix is either $ 0, $ either $ 1. $
[b]b)[/b] How many such matrices have the property that the product of its elements is $ 0? $
We wish to construct a matrix with $19$ rows and $86$ columns, with entries $x_{ij} \in \{0, 1, 2\} \ (1 \leq i \leq 19, 1 \leq j \leq 86)$, such that:
[i](i)[/i] in each column there are exactly $k$ terms equal to $0$;
[i](ii)[/i] for any distinct $j, k \in \{1, . . . , 86\}$ there is $i \in \{1, . . . , 19\}$ with $x_{ij} + x_{ik} = 3.$
For what values of $k$ is this possible?
In each cell of a matrix $ n\times n$ a number from a set $ \{1,2,\ldots,n^2\}$ is written --- in the first row numbers $ 1,2,\ldots,n$, in the second $ n\plus{}1,n\plus{}2,\ldots,2n$ and so on. Exactly $ n$ of them have been chosen, no two from the same row or the same column. Let us denote by $ a_i$ a number chosen from row number $ i$. Show that:
\[ \frac{1^2}{a_1}\plus{}\frac{2^2}{a_2}\plus{}\ldots \plus{}\frac{n^2}{a_n}\geq \frac{n\plus{}2}{2}\minus{}\frac{1}{n^2\plus{}1}\]
Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares.
Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored.
Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge.
Prove that $N^{2}\geq M\cdot 2^{mn}$.
How many ordered four-tuples of integers $(a,b,c,d)$ with $0 < a < b < c < d < 500$ satisfy $a + d = b + c$ and $bc - ad = 93$?
Let $p$ be a prime and let $M$ be an $n\times m$ matrix with integer entries such that $Mv\not\equiv 0\pmod{p}$ for any column vector $v\neq 0$ whose entries are $0$ are $1$. Show that there exists a row vector $x$ with integer entries such that no entry of $xM$ is $0\pmod{p}$.
(translated by L. Erdős)
In triangle $ABC$, we have $\angle ABC=60$. The line through $B$ perpendicular to side $AB$ intersects angle bisector of $\angle BAC$ in $D$ and the line through $C$ perpendicular $BC$ intersects angle bisector of $\angle ABC$ in $E$. prove that $\angle BED\le 30$.
Let $A$ be a $3\times 3$ real matrix such that the vectors $Au$ and $u$ are orthogonal for
every column vector $u\in \mathbb{R}^{3}$. Prove that:
a) $A^{T}=-A$.
b) there exists a vector $v \in \mathbb{R}^{3}$ such that $Au=v\times u$ for every $u\in \mathbb{R}^{3}$,
where $v \times u$ denotes the vector product in $\mathbb{R}^{3}$.
Given a $19 \times 19$ matrix where each component is either $1$ or $-1$. Let $b_i$ be the product of all components in the $i$-th row, and $k_i$ be the product of all components in the $i$-th column, for all $1 \le i \le 19$. Prove that for any such matrix, $b_1 + k_1 + b_2 + k_2 + \cdots + b_{19} + k_{19} \neq 0$.
Alan and Barbara play a game in which they take turns filling entries of an initially empty $ 2008\times 2008$ array. Alan plays first. At each turn, a player chooses a real number and places it in a vacant entry. The game ends when all entries are filled. Alan wins if the determinant of the resulting matrix is nonzero; Barbara wins if it is zero. Which player has a winning strategy?
Consider a matrix whose entries are integers. Adding a same integer to all entries on a same row, or on a same column, is called an operation. It is given that, for infinitely many positive integers $n$, one can obtain, through a finite number of operations, a matrix having all entries divisible by $n$. Prove that, through a finite number of operations, one can obtain the null matrix.
Call a polynomial $ P(x_{1}, \ldots, x_{k})$ [i]good[/i] if there exist $ 2\times 2$ real matrices $ A_{1}, \ldots, A_{k}$ such that
$ P(x_{1}, \ldots, x_{k}) = \det \left(\sum_{i=1}^{k}x_{i}A_{i}\right).$
Find all values of $ k$ for which all homogeneous polynomials with $ k$ variables of degree 2 are good. (A polynomial is homogeneous if each term has the same total degree.)
Let $A,B,C$ be real square matrices of order $n$ such that $A^3=-I$, $BA^2+BA=C^6+C+I$ and $C$ is symmetric. Is it possible that $n=2005$?