Consider a skew-symmetric matrix $A = \begin{bmatrix} 0 & b & k \\ b & 0 & c \\ -c & -c & 0 \end{bmatrix}$ such that $a, b$ and $c$ are selected from the set $S = \{0, 1, 2, 3, \ldots, 12\}$. If $|A|$ is divisible by 3, then the number of such possible matrices is
If the system of equations \(x = 2a\), \(y = 3b\), \(z = c\) has non-zero solutions, i.e., \(\Delta = 0\) where \(\Delta = \begin{vmatrix} 1 & 2a & a \\ 1 & 3b & b \\ 1 & 4c & c \end{vmatrix} = 0\), then \(a\), \(b\), \(c\) are in:
If \(a_1, a_2, a_3, \ldots, a_n, \ldots\) are in GP, then the value of the determinant \[\begin{vmatrix} \log a_n & \log a_{n+1} & \log a_{n+2} \\ \log a_{n+3} & \log a_{n+4} & \log a_{n+5} \\ \log a_{n+6} & \log a_{n+7} & \log a_{n+8} \end{vmatrix}\] is