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$?

An integer sequence is defined by \[{ a_n = 2 a_{n-1} + a_{n-2}}, \quad (n > 1), \quad a_0 = 0, a_1 = 1.\] Prove that $2^k$ divides $a_n$ if and only if $2^k$ divides $n$.

Let $n$ be an integer with $n \geq 2$ and let $A \in \mathcal{M}_n(\mathbb{C})$ such that $\operatorname{rank} A \neq \operatorname{rank} A^2.$ Prove that there exists a nonzero matrix $B \in \mathcal{M}_n(\mathbb{C})$ such that $$AB=BA=B^2=0$$ [i]Cornel Delasava[/i]

The absolute value of the sum of the elements of a real orthogonal matrix is at most the order of the matrix.

Given a natural number $n$, for what maximal value $k$ it is possible to construct a matrix of size $k \times n$ consisting only of elements $\pm 1$ in such a way that for any interchange of a $+1$ with a $-1$ or vice versa, its rank is equal to $k$?

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|$.

Let points $ A = (0,0) , \ B = (1,2), \ C = (3,3), $ and $ D = (4,0) $. Quadrilateral $ ABCD $ is cut into equal area pieces by a line passing through $ A $. This line intersects $ \overline{CD} $ at point $ \left (\frac{p}{q}, \frac{r}{s} \right ) $, where these fractions are in lowest terms. What is $ p + q + r + s $? $ \textbf{(A)} \ 54 \qquad \textbf{(B)} \ 58 \qquad \textbf{(C)} \ 62 \qquad \textbf{(D)} \ 70 \qquad \textbf{(E)} \ 75 $

Prove that $N^2$ arbitrary distinct positive integers ($N>10$) can be arranged in a $N\times N$ table, so that all $2N$ sums in rows and columns are distinct. [i]Proposed by S. Volchenkov[/i]

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 be a natural number $ n\ge 2. $ Prove that there exist exactly two subsets of the set $ \left\{ \left.\left(\begin{matrix} a& b\\-b& a \end{matrix}\right)\right| a,b\in\mathbb{R} \right\} $ that are closed under multiplication and their cardinal is $ n. $ [i]Marcel Tena[/i]

Let $A\in M_4(C)$ be a non-zero matrix. $a)$ If $\text{rank}(A)=r<4$, prove the existence of two invertible matrices $U,V\in M_4(C)$, such that: \[UAV=\begin{pmatrix}I_r&0\\0&0\end{pmatrix}\] where $I_r$ is the $r$-unit matrix. $b)$ Show that if $A$ and $A^2$ have the same rank $k$, then the matrix $A^n$ has rank $k$, for any $n\ge 3$.

Let be a natural number $ n\ge 2, $ two complex numbers $ p,q, $ and four matrices $ A,B,C,D\in\mathcal{M}_n(\mathbb{C}) $ such that $ A+B=C+D=pI,AB+CD=qI $ and $ ABCD=0. $ Show that $ BCDA=0. $ [i]Marius Cavachi[/i]

We say a triple of real numbers $ (a_1,a_2,a_3)$ is [b]better[/b] than another triple $ (b_1,b_2,b_3)$ when exactly two out of the three following inequalities hold: $ a_1 > b_1$, $ a_2 > b_2$, $ a_3 > b_3$. We call a triple of real numbers [b]special[/b] when they are nonnegative and their sum is $ 1$. For which natural numbers $ n$ does there exist a collection $ S$ of special triples, with $ |S| \equal{} n$, such that any special triple is bettered by at least one element of $ S$?

Let $ n$ and $ k$ be positive integers. Say that a permutation $ \sigma$ of $ \{1,2,\dots n\}$ is $ k$-[i]limited[/i] if $ |\sigma(i)\minus{}i|\le k$ for all $ i.$ Prove that the number of $ k$-limited permutations of $ \{1,2,\dots n\}$ is odd if and only if $ n\equiv 0$ or $ 1\pmod{2k\plus{}1}.$

Determine whether there exist an odd positive integer $n$ and $n\times n$ matrices $A$ and $B$ with integer entries, that satisfy the following conditions: [list=1] [*]$\det (B)=1$;[/*] [*]$AB=BA$;[/*] [*]$A^4+4A^2B^2+16B^4=2019I$.[/*] [/list] (Here $I$ denotes the $n\times n$ identity matrix.) [i]Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan[/i]

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?

Suppose that $V$ is a finite dimensional vector space over the real numbers equipped with an inner product and $S:V\times V \longrightarrow \mathbb R$ is a skew symmetric function that is linear for each variable when others are kept fixed. Prove there exists a linear transformation $T:V \longrightarrow V$ such that $\forall u,v \in V: S(u,v)=<u,T(v)>$. We know that there always exists $v\in V$ such that $W=<v,T(v)>$ is invariant under $T$. (it means $T(W)\subseteq W$). Prove that if $W$ is invariant under $T$ then the following subspace is also invariant under $T$: $W^{\perp}=\{v\in V:\forall u\in W <v,u>=0\}$. Prove that if dimension of $V$ is more than $3$, then there exist a two dimensional subspace $W$ of $V$ such that the volume defined on it by function $S$ is zero!!!! (This is the way that we can define a two dimensional volume for each subspace $V$. This can be done for volumes of higher dimensions.)

(a) Let $f: \mathbb{R}^{n\times n}\rightarrow\mathbb{R}$ be a linear mapping. Prove that $\exists ! C\in\mathbb{R}^{n\times n}$ such that $f(A)=Tr(AC), \forall A \in \mathbb{R}^{n\times n}$. (b) Suppose in addtion that $\forall A,B \in \mathbb{R}^{n\times n}: f(AB)=f(BA)$. Prove that $\exists \lambda \in \mathbb{R}: f(A)=\lambda Tr(A)$

Let A,B,C,D four matrices of order n with complex entries, n>=2 and let k real number such that AC+kBD=I and AD=BC. Prove that CA+kDB=I and DA=CB.

Let $n \ge 2$ be an integer, and let $O$ be the $n \times n$ matrix whose entries are all equal to $0$. Two distinct entries of the matrix are chosen uniformly at random, and those two entries are changed from $0$ to $1$. Call the resulting matrix $A$. Determine the probability that $A^2 = O$, as a function of $n$.

[color=darkred]Let $ m$ and $ n$ be two nonzero natural numbers. In every cell $ 1 \times 1$ of the rectangular table $ 2m \times 2n$ are put signs $ \plus{}$ or $ \minus{}$. We call [i]cross[/i] an union of all cells which are situated in a line and in a column of the table. Cell, which is situated at the intersection of these line and column is called [i]center of the cross[/i]. A transformation is defined in the following way: firstly we mark all points with the sign $ \minus{}$. Then consecutively, for every marked cell we change the signs in the cross, whose center is the choosen cell. We call a table [i]accesible[/i] if it can be obtained from another table after one transformation. Find the number of all [i]accesible[/i] tables.[/color]

Let $p$ be a prime number. For any $\sigma \in S_p$ (the permutation group of $\{1,2,...,p \}),$ define the matrix $A_{\sigma}=(a_{ij}) \in \mathcal{M}_p(\mathbb{Z})$ as $a_{ij} = \sigma^{i-1}(j),$ where $\sigma^0$ is the identity permutation and $\sigma^k = \underbrace{\sigma \circ \sigma \circ ... \circ \sigma}_k.$ Prove that $D = \{ |\det A_{\sigma}| : \sigma \in S_p \}$ has at most $1+ (p-2)!$ elements.

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?

Let $n\in \mathbb{N}^*$ and a matrix $A\in \mathcal{M}_n(\mathbb{C}),\ A=(a_{ij})_{1\le i, j\le n}$ such that: \[a_{ij}+a_{jk}+a_{ki}=0,\ (\forall)i,j,k\in \{1,2,\ldots,n\}\] Prove that $\text{rank}\ A\le 2$.

Let $M$ be the (tridiagonal) $10\times10$ matrix $$M=\begin{pmatrix}-1&3&0&\cdots&\cdots&\cdots&0\\3&2&-1&0&&&\vdots\\0&-1&2&-1&\ddots&&\vdots\\\vdots&0&-1&2&\ddots&0&\vdots\\\vdots&&\ddots&\ddots&\ddots&-1&0\\\vdots&&&0&-1&2&-1\\0&\cdots&\cdots&\cdots&0&-1&2\end{pmatrix}$$Show that $M$ has exactly nine positive real eigenvalues (counted with multiplicities).