Find all positive integers $x>1, y$ and primes $p,q$ such that $p^{x}=2^{y}+q^{x}$

Let $A,B\in\mathcal{M}_{2}(\mathbb{R})$ (real $2\times 2$ matrices), that satisfy $A^{2}+B^{2}=AB$. Prove that $(AB-BA)^{2}=O_{2}$.

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

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.

Let $ n > 1$ be an odd positive integer and $ A = (a_{ij})_{i, j = 1..n}$ be the $ n \times n$ matrix with \[ a_{ij}= \begin{cases}2 & \text{if }i = j \\ 1 & \text{if }i-j \equiv \pm 2 \pmod n \\ 0 & \text{otherwise}\end{cases}.\] Find $ \det A$.

Let $A,B\in\mathcal{M}_3(\mathbb{R})$ de matrices such that $A^2+B^2=O_3.$ Prove that $\det(aA+bB)=0$ for any real numbers $a$ and $b.$

Let $d\leq n$ be positive integers and $A$ a real $d\times n$ matrix. Let $\sigma(A)$ be the supremum of $\inf_{v\in W,|v|=1}|Av|$ over all subspaces $W$ of $R^n$ with dimension $d$. For each $j \leq d$, let $r(j) \in \mathbb{R}^n$ be the $j$th row vector of $A$. Show that: \[\sigma(A) \leq \min_{i\leq d} d(r(i), \langle r(j), j\ne i\rangle) \leq \sqrt{n}\sigma(A)\] In which all are euclidian norms and $d(r(i), \langle r(j), j\ne i\rangle)$ denotes the distance between $r(i)$ and the span of $r(j), 1 \leq j \leq d, j\ne i$.

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

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|}. \]

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 $

Solve with full solution: \[\left\{\begin{matrix}\sqrt{(\sin x)^2+\frac{1}{(\sin x)^2}}+\sqrt{(\cos y)^2+\frac{1}{(\cos y)^2}}=\sqrt\frac{20y}{x+y} \\\sqrt{(\sin y)^2+\frac{1}{(\sin y)^2}}+\sqrt{(\cos x)^2+\frac{1}{(\cos x)^2}}=\sqrt\frac{20x}{x+y}\end{matrix}\right. \]

A real symmetric $2018\times 2018$ matrix $A=(a_{ij})$ satisfies $|a_{ij}-2018|\leq 1$ for every $1\leq i,j\leq 2018$. Denote the largest eigenvalue of $A$ by $\lambda(A)$. Find maximum and minumum value of $\lambda(A)$.

Prove that if $A{}$ is an $n\times n$ matrix with complex entries such that $A+A^*=A^2A^*$ then $A=A^*$. (Here, we denote by $M^*$ the conjugate transpose $\overline{M}^t$ of the matrix $M{}$).

In a tournament, 2011 players meet 2011 times to play a multiplayer game. Every game is played by all 2011 players together and ends with each of the players either winning or losing. The standings are kept in two $2011\times 2011$ matrices, $T=(T_{hk})$ and $W=(W_{hk}).$ Initially, $T=W=0.$ After every game, for every $(h,k)$ (including for $h=k),$ if players $h$ and $k$ tied (that is, both won or both lost), the entry $T_{hk}$ is increased by $1,$ while if player $h$ won and player $k$ lost, the entry $W_{hk}$ is increased by $1$ and $W_{kh}$ is decreased by $1.$ Prove that at the end of the tournament, $\det(T+iW)$ is a non-negative integer divisible by $2^{2010}.$

Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column. What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?

Let $A$ be a $n\times n$ matrix with complex elements and let $A^\star$ be the classical adjoint of $A$. Prove that if there exists a positive integer $m$ such that $(A^\star)^m = 0_n$ then $(A^\star)^2 = 0_n$. [i]Marian Ionescu, Pitesti[/i]

Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.

Let $M$ be a matrix with $r$ rows and $c$ columns. Each entry of $M$ is a nonnegative integer. Let $a$ be the average of all $rc$ entries of $M$. If $r > {(10 a + 10)}^c$, prove that $M$ has two identical rows.

Twenty-one rectangles of size $3\times 1$ are placed on an $8\times 8$ chessboard, leaving only one free unit square. What position can the free square lie at?

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

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 $n,k$ be positive integers such that $n\ge k$. $n$ lamps are placed on a circle, which are all off. In any step we can change the state of $k$ consecutive lamps. In the following three cases, how many states of lamps are there in all $2^n$ possible states that can be obtained from the initial state by a certain series of operations? i)$k$ is a prime number greater than $2$; ii) $k$ is odd; iii) $k$ is even.

Given $5n$ real numbers $r_i, s_i, t_i, u_i, v_i \geq 1 (1 \leq i \leq n)$, let $R = \frac {1}{n} \sum_{i=1}^{n} r_i$, $S = \frac {1}{n} \sum_{i=1}^{n} s_i$, $T = \frac {1}{n} \sum_{i=1}^{n} t_i$, $U = \frac {1}{n} \sum_{i=1}^{n} u_i$, $V = \frac {1}{n} \sum_{i=1}^{n} v_i$. Prove that $\prod_{i=1}^{n}\frac {r_i s_i t_i u_i v_i + 1}{r_i s_i t_i u_i v_i - 1} \geq \left(\frac {RSTUV +1}{RSTUV - 1}\right)^n$.

Solve in $(\mathbb{R}_{+}^{*})^{4}$ the following system : $\left\{\begin{matrix} x+y+z+t=4\\ \frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{t}=5-\frac{1}{xyzt} \end{matrix}\right.$

A Sudoku matrix is defined as a $ 9\times9$ array with entries from $ \{1, 2, \ldots , 9\}$ and with the constraint that each row, each column, and each of the nine $ 3 \times 3$ boxes that tile the array contains each digit from $ 1$ to $ 9$ exactly once. A Sudoku matrix is chosen at random (so that every Sudoku matrix has equal probability of being chosen). We know two of the squares in this matrix, as shown. What is the probability that the square marked by ? contains the digit $ 3$? $ \setlength{\unitlength}{6mm} \begin{picture}(9,9)(0,0) \multiput(0,0)(1,0){10}{\line(0,1){9}} \multiput(0,0)(0,1){10}{\line(1,0){9}} \linethickness{1.2pt} \multiput(0,0)(3,0){4}{\line(0,1){9}} \multiput(0,0)(0,3){4}{\line(1,0){9}} \put(0,8){\makebox(1,1){1}} \put(1,7){\makebox(1,1){2}} \put(3,6){\makebox(1,1){?}} \end{picture}$