Let $$n = {p^2}q,$$ where $$p$$ and $$q$$ are distinct prime numbers. How many numbers $$m$$ satisfy $$1 \le m \le n$$ and $$gcd\left( {m.n} \right) = 1?$$ Note that $$gcd(m,n)$$ is the greatest common divisor of $$m$$ and $$n$$.

Consider the set $$H$$ of all $$3$$ $$X$$ $$3$$ matrices of the type $$$\left[ {\matrix{ a & f & e \cr 0 & b & d \cr 0 & 0 & c \cr } } \right]$$$

Where $$a, b, c, d, e$$ and $$f$$ are real numbers and $$abc$$ $$ \ne \,\,0$$. Under the matrix multiplication operation, the set $$H$$ is:

What are the eigen values of the following $$2x2$$ matrix? $$$\left[ {\matrix{ 2 & { - 1} \cr { - 4} & 5 \cr } } \right]$$$

Consider the following system of equations in three real variables $$x1, x2$$ and $$x3$$ :
$$2x1 - x2 + 3x3 = 1$$
$$3x1 + 2x2 + 5x3 = 2$$
$$ - x1 + 4x2 + x3 = 3$$
This system of equations has