Found problems: 638
In how many ways can we enter numbers from the set $\{1,2,3,4\}$ into a $4\times 4$ array so that all of the following conditions hold?
(a) Each row contains all four numbers.
(b) Each column contains all four numbers.
(c) Each "quadrant" contains all four numbers. (The quadrants are the four corner $2\times 2$ squares.)
A particle is located on the coordinate plane at $ (5,0)$. Define a [i]move[/i] for the particle as a counterclockwise rotation of $ \pi/4$ radians about the origin followed by a translation of $ 10$ units in the positive $ x$-direction. Given that the particle's position after $ 150$ moves is $ (p,q)$, find the greatest integer less than or equal to $ |p|\plus{}|q|$.
Consider an $N\times N$ matrix, where $N$ is an odd positive integer, such that all its entries are $-1,0$ or $1$. Consider the sum of the numbers in every line and every column. Prove that at least two of the $2N$ sums are equal.
At the vertices $A, B, C, D, E, F, G, H$ of a cube, $2001, 2002, 2003, 2004, 2005, 2008, 2007$ and $2006$ stones respectively are placed. It is allowed to move a stone from a vertex to each of its three neighbours, or to move a stone to a vertex from each of its three neighbours. Which of the following arrangements of stones at $A, B, \ldots , H$ can be obtained?
$(\text{a})\quad 2001, 2002, 2003, 2004, 2006, 2007, 2008, 2005;$
$(\text{b})\quad 2002, 2003, 2004, 2001, 2006, 2005, 2008, 2007;$
$(\text{c})\quad 2004, 2002, 2003, 2001, 2005, 2008, 2007, 2006.$
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 $P$ be a nonempty collection of subsets of $\{1,\dots,n\}$ such that:
(i) if $S,S'\in P,$ then $S\cup S'\in P$ and $S\cap S'\in P,$ and
(ii) if $S\in P$ and $S\ne\emptyset,$ then there is a subset $T\subset S$ such that $T\in P$ and $T$ contains exactly one fewer element than $S.$
Suppose that $f:P\to\mathbb{R}$ is a function such that $f(\emptyset)=0$ and \[f(S\cup S')= f(S)+f(S')-f(S\cap S')\text{ for all }S,S'\in P.\] Must there exist real numbers $f_1,\dots,f_n$ such that \[f(S)=\sum_{i\in S}f_i\] for every $S\in P?$
In Prime Land, there are seven major cities, labelled $C_0$, $C_1$, \dots, $C_6$. For convenience, we let $C_{n+7} = C_n$ for each $n=0,1,\dots,6$; i.e. we take the indices modulo $7$. Al initially starts at city $C_0$.
Each minute for ten minutes, Al flips a fair coin. If the coin land heads, and he is at city $C_k$, he moves to city $C_{2k}$; otherwise he moves to city $C_{2k+1}$. If the probability that Al is back at city $C_0$ after $10$ moves is $\tfrac{m}{1024}$, find $m$.
[i]Proposed by Ray Li[/i]
Calculate the sum of matrix commutators $[A, [B, C]] + [B, [C, A]] + [C, [A, B]]$, where $[A, B] = AB-BA$
Let $A$ be a square matrix of odd order (at least $3$) whose entries are odd integers. Prove that if $A$ is invertible, then it is not possible for all the minors of the entries of a row to have equal absolute values.
Given is a prime number $p$ and natural $n$ such that $p \geq n \geq 3$. Set $A$ is made of sequences of lenght $n$ with elements from the set $\{0,1,2,...,p-1\}$ and have the following property:
For arbitrary two sequence $(x_1,...,x_n)$ and $(y_1,...,y_n)$ from the set $A$ there exist three different numbers $k,l,m$ such that:
$x_k \not = y_k$, $x_l \not = y_l$, $x_m \not = y_m$.
Find the largest possible cardinality of $A$.
Katie begins juggling five balls. After every second elapses, there is a chance she will drop a ball. If she is currently juggling $ k$ balls, this probability is $ \frac{k}{10}$. Find the expected number of seconds until she has dropped all the balls.
Prove that $ \exists X,Y,Z\in \mathcal{M}_n(\mathbb{C})$ such that
a)$ X^2\plus{}Y^2\equal{}A$
b) $ X^3\plus{}Y^3\plus{}Z^3\equal{}A$ , where $ A\in \mathcal{M}_n(\mathbb{C})$
[color=darkred]A row of a matrix belonging to $\mathcal{M}_n(\mathbb{C})$ is said to be [i]permutable[/i] if no matter how we would permute the entries of that row, the value of the determinant doesn't change. Prove that if a matrix has two [i]permutable[/i] rows, then its determinant is equal to $0$ .[/color]
Suppose that $T,U:V\longrightarrow V$ are two linear transformations on the vector space $V$ such that $T+U$ is an invertible transformation. Prove that
$TU=UT=0 \Leftrightarrow \operatorname{rank} T+\operatorname{rank} U=n$.
Let $A$, $B$ and $C$ be $n \times n$ matrices with complex entries satisfying
$$A^2=B^2=C^2 \text{ and } B^3 = ABC + 2I.$$
Prove that $A^6=I$.
Let $n \geq 2$ be a positive integer and, for all vectors with integer entries $$X=\begin{pmatrix}
x_1 \\
x_2 \\
\vdots \\
x_n
\end{pmatrix}$$
let $\delta(X) \geq 0$ be the greatest common divisor of $x_1,x_2, \dots, x_n.$ Also, consider $A \in \mathcal{M}_n(\mathbb{Z}).$
Prove that the following statements are equivalent:
$\textbf{i) }$ $|\det A | = 1$
$\textbf{ii) }$ $\delta(AX)=\delta(X),$ for all vectors $X \in \mathcal{M}_{n,1}(\mathbb{Z}).$
[i]Romeo Raicu[/i]
Consider the multiplicative group $ \left\{ \left.A_k:=\left(\begin{matrix} 2^k& 2^k\\2^k& 2^k\end{matrix}\right)\right| k\in\mathbb{Z} \right\} . $
[b]a)[/b] Prove that $A_xA_y=A_{x+y+1} , $ for all integers $ x,y. $
[b]b)[/b] Show that, for all integers $ t, $ the multiplicative group $ \left\{ A_{jt-1}|j\in\mathbb{Z} \right\} $ is a subgroup of $ G. $
[b]c)[/b] Determine the linear integer polynomials $ P $ for which it exists an isomorphism $ \left(
G,\cdot \right)\stackrel{\eta}{\cong}\left( \mathbb{Z} ,+ \right) $ such that $ \eta\left( A_k \right) =P(k). $
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$?
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?
If $A$ is the $3\times 3$ square matrix $\begin{bmatrix}
5 & 3 & 8\\
2 & 2 & 5\\
3 & 5 & 1
\end{bmatrix}$ and $B$ is the $4\times 4$ square matrix $\begin{bmatrix}
32 & 2 & 4 & 3 \\
3 & 4 & 8 & 3 \\
11 & 3 & 6 & 1 \\
5 & 5 & 10 & 1
\end{bmatrix} $ find the sum of the determinants of $A$ and $B$.
Let be an odd integer $ n\ge 3 $ and an $ n\times n $ real matrix $ A $ whose determinant is positive and such that $ A+\text{adj} A=2A^{-1} . $ Prove that $ A^{2010} +\text{adj}^{2010} A =2A^{-2010} . $
[i]Lucian Petrescu[/i]
Let $n$ be an even positive integer. We say that two different cells of a $n \times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.
Let $A$ be a real $4\times 2$ matrix and $B$ be a real $2\times 4$ matrix such that
\[ AB = \left(%
\begin{array}{cccc}
1 & 0 & -1 & 0 \\
0 & 1 & 0 & -1 \\
-1 & 0 & 1 & 0 \\
0 & -1 & 0 & 1 \\
\end{array}%
\right). \]
Find $BA$.
Let $A,B \in \mathcal{M}_n(\mathbb{R}).$ We consider the function $f:\mathcal{M}_n(\mathbb{C}) \to \mathcal{M}_n(\mathbb{C}),$ defined by $f(Z)=AZ+B\overline{Z},$ $Z \in \mathcal{M}_n(\mathbb{C}),$ where $\overline{Z}$ is the matrix whose entries are the conjugates of the corresponding entries of $Z.$ Prove that the following statements are equivalent:
$(1)$ the function $f$ is injective;
$(2)$ the function $f$ is surjective;
$(3)$ the matrices $A+B$ and $A-B$ are invertible.
Given two sequences $x_n$ and $y_n$ defined by $x_0 = y_0 = 7$,
\[x_n = 4x_{n-1}+3y_{n-1}, \text{ and}\]\[y_n = 3y_{n-1}+2x_{n-1},\]
find $\lim_{n \to \infty} \frac{x_n}{y_n}$.