Let R and S be any two equivalence relations on a non-emply set A. Which one of the following statements is TRUE?

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

The determination of the matrix given below is $$$\left[ {\matrix{ 0 & 1 & 0 & 2 \cr { - 1} & 1 & 1 & 3 \cr 0 & 0 & 0 & 1 \cr 1 & { - 2} & 0 & 1 \cr } } \right]$$$

A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: