Consider a binary matrix $M$(all entries are $0$ or $1$) on $r$ rows and $c$ columns, where every row and every column contain at least one entry equal to $1$. Prove that there exists an entry $M(i,j) = 1$, such that the corresponding row-sum $R(i)$ and column-sum $C(j)$ satisfy $r R(i)\ge c C(j)$. (Proposed by Gerhard Woeginger, Austria)

$M_n(\mathbb{C})$ is the vector space of all complex $n\times n$ matrices. Given a linear map $T:M_n(\mathbb{C})\to M_n(\mathbb{C})$ s.t. $\det (A)=\det(T(A))$ for every $A\in M_n(\mathbb{C})$. (1) If $T(A)$ is the zero matrix, then show that $A$ is also the zero matrix. (2) Prove that $\text{rank} (A)=\text{rank} (T(A))$ for any $A\in M_n(\mathbb{C})$.

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?

Calculate \[\int\cdots\int \exp\left(-\sum_{1\le i\le j\le n}x_ix_j\right)dx_1\cdots dx_n\]

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes). $a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table. $b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.

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

Let n be a positive integer. Find all complex numbers $x_{1}$, $x_{2}$, ..., $x_{n}$ satisfying the following system of equations: $x_{1}+2x_{2}+...+nx_{n}=0$, $x_{1}^{2}+2x_{2}^{2}+...+nx_{n}^{2}=0$, ... $x_{1}^{n}+2x_{2}^{n}+...+nx_{n}^{n}=0$.

Let $A \in \mathcal{M}_n(\mathbb{R})$ be an invertible matrix. a) Prove that the eigenvalues of $AA^T$ are positive real numbers. b) We assume that there are two distinct positive integers, $p$ and $q$, such that $(AA^T)^p=(A^TA)^q.$ Prove that $A^T=A^{-1}.$

Let $V$ be a set of $5\times7$ matrices, with real entries and closed under addition and scalar multiplication. Prove or disprove the following assertion: If $V$ contains matrices of ranks $0, 1, 2, 4,$ and $5$, then it also contains a matrix of rank $3$.

Let $d$ be a positive integer and let $A$ be a $d\times d$ matrix with integer entries. Suppose $I+A+A_2+\ldots+A_{100}=0$ (where $I$ denotes the identity $d\times d$ matrix, and $0$ denotes the zero matrix, which has all entries $0$). Determine the positive integers $n\le100$ for which $A_n+A_{n+1}+\ldots+A_{100}$ has determinant $\pm1$.

Let be three complex numbers $ \alpha ,\beta ,\gamma $ such that $$ \begin{vmatrix} \left( \alpha -\beta \right)^2 & \left( \alpha -\beta \right)\left( \beta -\gamma \right) & \left( \beta -\gamma \right)^2 \\ \left( \beta -\gamma \right)^2 & \left( \beta -\gamma \right)\left( \gamma -\alpha \right) & \left( \gamma -\alpha \right)^2 \\ \left( \gamma -\alpha \right)^2 & \left( \gamma -\alpha \right)\left( \alpha -\beta \right) & \left( \alpha -\beta \right)^2\end{vmatrix} =0. $$ Prove that $ \alpha ,\beta ,\gamma $ are all equal, or their affixes represent a non-degenerate equilateral triangle. [i]Gheorghe Necșuleu[/i] and [i]Ion Necșuleu[/i]

In each square of a chessboard with $a$ rows and $b$ columns, a $0$ or $1$ is written satisfying the following conditions. [list][*]If a row and a column intersect in a square with a $0$, then that row and column have the same number of $0$s. [*]If a row and a column intersect in a square with a $1$, then that row and column have the same number of $1$s.[/list] Find all pairs $(a,b)$ for which this is possible.

For a positive integer $n$ determine all $n\times n$ real matrices $A$ which have only real eigenvalues and such that there exists an integer $k\geq n$ with $A + A^k = A^T$.

[i][b]a)[/b][/i] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^2+B^2=C^2$. [b][i]b)[/i][/b] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^4+B^4=C^4$. [b]Note[/b]: The notation $A\in \mathrm{SL}_{2}(\mathbb{Z})$ means that $A$ is a $2\times 2$ matrix with integer entries and $\det A=1$.

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 $

Let $ \Omega$ be the circumcircle of triangle $ ABC$. Let $ D$ be the point at which the incircle of $ ABC$ touches its side $ BC$. Let $ M$ be the point on $ \Omega$ such that the line $ AM$ is parallel to $ BC$. Also, let $ P$ be the point at which the circle tangent to the segments $ AB$ and $ AC$ and to the circle $ \Omega$ touches $ \Omega$. Prove that the points $ P$, $ D$, $ M$ are collinear.

Let $A=(a_{ij})$ and $B=(b_{ij})$ be two real $10\times10$ matrices such that $a_{ij}=b_{ij}+1$ for all $i,j$ and $A^3=0$. Prove that $\det B=0$.

We select $16$ cells on an $8\times 8$ chessboard. What is the minimal number of pairs of selected cells in the same row or column?

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

We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]

Numbers $1, 2,\cdots, 16$ are written in a $4\times 4$ square matrix so that the sum of the numbers in every row, every column, and every diagonal is the same and furthermore that the numbers $1$ and $16$ lie in opposite corners. Prove that the sum of any two numbers symmetric with respect to the center of the square equals $17$.

For $n\geq 1$ let $M$ be an $n\times n$ complex array with distinct eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_k$, with multiplicities $m_1,m_2,\ldots,m_k$ respectively. Consider the linear operator $L_M$ defined by $L_MX=MX+XM^T$, for any complex $n\times n$ array $X$. Find its eigenvalues and their multiplicities. ($M^T$ denotes the transpose matrix of $M$).

Find the number of ordered triplets $(a,b,c)$ of positive integers such that $abc=2008$ (the product of $a$, $b$, and $c$ is $2008$).

Let $n$ be a fixed positive integer. Determine the smallest possible rank of an $n\times n$ matrix that has zeros along the main diagonal and strictly positive real numbers off the main diagonal. [i]Proposed by Ilya Bogdanov and Grigoriy Chelnokov, MIPT, Moscow.[/i]