Prove that there exists an infinite set of points \[ \dots, \; P_{-3}, \; P_{-2},\; P_{-1},\; P_0,\; P_1,\; P_2,\; P_3,\; \dots \] in the plane with the following property: For any three distinct integers $a,b,$ and $c$, points $P_a$, $P_b$, and $P_c$ are collinear if and only if $a+b+c=2014$.

Let be a natural number $ n, $ a number $ t\in (0,1) $ and $ n+1 $ numbers $ a_0\ge a_1\ge a_2\ge\cdots\ge a_n\ge 0. $ Prove the following matrix inequality: $$ \begin{vmatrix}\frac{(1+t\sqrt{-1})^2}{1+t^2} & -1 & 0& 0 & \cdots & 0 & 0 \\ 0 & \frac{(1+t\sqrt{-1})^2}{1+t^2} & -1 & 0 & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & 0 & 0 & \cdots & \frac{(1+t\sqrt{-1})^2}{1+t^2} & -1 \\ a_0 & a_1 & a_2 & a_3 & \cdots & a_{n-1} & a_n \end{vmatrix}^2\le a_0^2\left( 1+\frac{1}{t^2} \right) $$

We will designate by $Z_{(5)}$ a certain subset of the set $Q$ of the rational numbers . A rational belongs to $Z_{(5)}$ if and only if there exist equal fraction to this rational such that $5$ is not a divisor of its denominator. (For example, the rational number $13/10$ does not belong to $Z_{(5)}$ , since the denominator of all fractions equal to $13/10$ is a multiple of $5$. On the other hand, the rational $75/10$ belongs to $Z_{(5)}$ since that $75/10 = 15/12$). Reasonably answer the following questions: a) What algebraic structure (semigroup, group, etc.) does $Z_{(5)}$ have with respect to the sum? b) And regarding the product? c) Is $Z_{(5)}$ a subring of $Q$? d) Is $Z_{(5)}$ a vector space?

Solve the system of equations: $ \begin{matrix} |x+y| + |1-x| = 6 \\ |x+y+1| + |1-y| = 4. \end{matrix} $

Determine all real numbers $a$ such that the two polynomials $x^2+ax+1$ and $x^2+x+a$ have at least one root in common.

Let \( n \) be a positive integer, and let \( A \) and \( B \) be \( n \times n \) matrices with real coefficients such that \[ ABBA - BAAB = A - B. \] (a) Prove that \( \text{Tr}(A) = \text{Tr}(B) \) and that \( \text{Tr}(A^2) = \text{Tr}(B^2) \). (b) If \(BA^2B= A^2B^2\) and \(AB^2A= B^2A^2\), prove that \( \det A = \det B \). Note: \( \text{Tr}(X) \) denotes the trace of \( X \), which is the sum of the elements on its main diagonal, and \( \det X \) denotes the determinant of \( X \).

Let $ A$ be a $ n\times n$ matrix with complex elements. Prove that $ A^{\minus{}1} \equal{} \overline{A}$ if and only if there exists an invertible matrix $ B$ with complex elements such that $ A\equal{} B^{\minus{}1} \cdot \overline{B}$.

the code system of a new 'MO lock' is a regular $n$-gon,each vertex labelled a number $0$ or $1$ and coloured red or blue.it is known that for any two adjacent vertices,either their numbers or colours coincide. find the number of all possible codes(in terms of $n$).

Let $A,B\in\mathcal{M}_n(\mathbb{C})$ such that $A^2+B^2=2AB.$ Prove that for any complex number $x$\[\det(A-xI_n)=\det(B-xI_n).\][i]Mihai Opincariu and Vasile Pop[/i]

A $3\times 3$ matrix has determinant $0$ and the cofactor of any element is equal to the square of that element. Show that every element in the matrix is $0.$

Let be two matrices $ A,B\in M_2\left(\mathbb{R}\right) $ that satisfy the equality $ \left( A-B\right)^2 =O_2. $ [b]a)[/b] Show that $ \det\left( A^2-B^2\right) =\left( \det A -\det B\right)^2. $ [b]b)[/b] Demonstrate that $ \det\left( AB-BA\right) =0\iff \det A=\det B. $

Show that if a connected, nowhere zero sectional curvature of Riemannian manifold, where symmetric (1,1)-tensor of the Levi-Civita connection covariant derivative vanishes, then the tensor is constant times the unit tensor. (translated by j___d)

Let $ A \equal{} (a_{ij})$, where $ i,j \equal{} 1,2,\ldots,n$, be a square matrix with all $ a_{ij}$ non-negative integers. For each $ i,j$ such that $ a_{ij} \equal{} 0$, the sum of the elements in the $ i$th row and the $ j$th column is at least $ n$. Prove that the sum of all the elements in the matrix is at least $ \frac {n^2}{2}$.

Let $ \mathcal{M} =\left\{ A\in M_2\left( \mathbb{C}\right)\big| \det\left( A-zI_2\right) =0\implies |z| < 1\right\} . $ Prove that: $$ X,Y\in\mathcal{M}\wedge X\cdot Y=Y\cdot X\implies X\cdot Y\in\mathcal{M} . $$

Let $p$ be an odd prime number such that $p\equiv 2\pmod{3}.$ Define a permutation $\pi$ of the residue classes modulo $p$ by $\pi(x)\equiv x^3\pmod{p}.$ Show that $\pi$ is an even permutation if and only if $p\equiv 3\pmod{4}.$

Let $n \ge 2$ be a positive integer and let $A \in \mathcal{M}_n(\mathbb{R})$ be a matrix such that $A^2=-I_n$. If $B \in \mathcal{M}_n(\mathbb{R})$ and $AB = BA$, prove that $\det B \ge 0$.

Let $\alpha\in\mathbb R\backslash \{ 0 \}$ and suppose that $F$ and $G$ are linear maps (operators) from $\mathbb R^n$ into $\mathbb R^n$ satisfying $F\circ G - G\circ F=\alpha F$. a) Show that for all $k\in\mathbb N$ one has $F^k\circ G-G\circ F^k=\alpha kF^k$. b) Show that there exists $k\geq 1$ such that $F^k=0$.

Let $X_1,X_2,\ldots,X_m$ a numbering of the $m=2^n-1$ non-empty subsets of the set $\{1,2,\ldots,n\}$, $n\geq 2$. We consider the matrix $(a_{ij})_{1\leq i,j\leq m}$, where $a_{ij}=0$, if $X_i \cap X_j = \emptyset$, and $a_{ij}=1$ otherwise. Prove that the determinant $d$ of this matrix does not depend on the way the numbering was done and compute $d$.

Solve the system of equations: $ \begin{matrix} |x+y| + |1-x| = 6 \\ |x+y+1| + |1-y| = 4. \end{matrix} $

Let $n\in\mathbb{Z}$, $n\geq 3$. A matrix $A\in\mathcal{M}_n(\mathbb{C})$ is said to have property $(\mathcal{P})$ if $\det(A+X_{ij})=\det(A+X_{ji})$, for all $i,j\in\{1,2,\dots ,n\}$, where $X_{ij}\in\mathcal{M}_n(\mathbb{C})$ is the matrix with $1$ on position $(i,j)$ and $0$ otherwise. [list=a] [*] Show that if $A\in\mathcal{M}_n(\mathbb{C})$ has property $(\mathcal{P})$ and $\det(A)\neq 0$, then $A=A^T$. [*] Give an example of a matrix $A\in\mathcal{M}_n(\mathbb{C})$ with property $(\mathcal{P})$ such that $A\neq A^T$.

Set $T$ consists of $66$ points in plane, and $P$ consists of $16$ lines in plane. Pair $(A,l)$ is [i]good[/i] if $A \in T$, $l \in P$ and $A \in l$. Prove that maximum number of good pairs is no greater than $159$, and prove that there exits configuration with exactly $159$ good pairs.

Do either $(1)$ or $(2)$ $(1)$ Let $A$ be matrix $(a_{ij}), 1 \leq i,j \leq 4.$ Let $d =$ det$(A),$ and let $A_{ij}$ be the cofactor of $a_{ij}$, that is, the determinant of the $3 \times 3$ matrix formed from $A$ by deleting $a_{ij}$ and other elements in the same row and column. Let $B$ be the $4 \times 4$ matrix $(A_{ij})$ and let $D$ be det $B.$ Prove $D = d^3$. $(2)$ Let $P(x)$ be the quadratic $Ax^2 + Bx + C.$ Suppose that $P(x) = x$ has unequal real roots. Show that the roots are also roots of $P(P(x)) = x.$ Find a quadratic equation for the other two roots of this equation. Hence solve $(y^2 - 3y + 2)2 - 3(y^2 - 3y + 2) + 2 - y = 0.$

A $3$ by $3$ determinant has three entries equal to $2$, three entries equal to $5$, and three entries equal to $8$. Find the maximum possible value of the determinant.

In a school there are $n$ classes and $n$ students. The students are enrolled in classes, such that no two of them have exactly the same classes. Prove that we can close a class in a such way that there still are no two of them which have exactly the same classes.

Let $f(x)=\frac{ax+b}{cx+d}$ $F_n(x)=f(f(f...f(x)...))$ (with $n\ f's$) Suppose that $f(0) \not =0$, $f(f(0)) \not = 0$, and for some $n$ we have $F_n(0)=0$, show that $F_n(x)=x$ (for any valid x).