Let and be the distinct roots of the equation . Consider the set . For a matrix , define and for and .
Match each entry in List-I to the correct entry in List-II.
| List-I | List-II | ||
|---|---|---|---|
| (P) | The number of matrices with all entries in such that for all is | (1) | 1 |
| (Q) | The number of symmetric matrices with all entries in such that for all is | (2) | 12 |
| (R) | Let be a skew symmetric matrix such that for . Then the number of elements in the set is | (3) | Infinite |
| (S) | Let be a matrix with all entries in such that for all . Then the absolute value of the determinant of is | (4) | 6 |
| (5) | 0 |
The quadratic has distinct roots satisfying the Vieta relations and . Consequently , a fact that will be used repeatedly.
Case P (row and column sums zero, no symmetry condition):
Let a row be with each and . Write the counts of in the row as . Then and Since are linearly independent over , we must have Thus every row is a permutation of , and the same holds for every column.
A array in which each row and column contains every symbol exactly once is a Latin square of order . For a fixed first row there are exactly such squares; there are possible first rows, giving matrices.
Therefore
Case Q (symmetric matrices with column sums zero):
Because the matrix is symmetric, row sums equal column sums, so every row also sums to and hence is a permutation of . Let the diagonal be . If any two diagonal entries were equal, the corresponding column would repeat that entry, violating the “one-of-each’’ rule; therefore are all distinct. There are ways to choose this ordered diagonal.
Once the diagonal is fixed, the -entry for must be the unique element of different from and , and symmetry forces the -entry to be the same. Hence the rest of the matrix is determined uniquely.
Thus there are symmetric matrices, so
Case R (skew-symmetric matrix and a linear system):
A skew-symmetric matrix is of the form where (because the entries below the diagonal are required to lie in ). The given system is
The second column of is , exactly the required right-hand side. Since the rank of a skew-symmetric matrix is or (it is never full), this right-hand side is always in the column space, so the system is consistent. Because the rank is , the solution space has dimension , containing infinitely many vectors.
Hence the set in question is infinite, so
Case S (row sums zero, determinant):
Each row sums to , so (as in Case P) every row is a permutation of . Thus every row lies in the plane , a -dimensional subspace of . Three vectors confined to a plane are necessarily linearly dependent, so the matrix is singular and its determinant is .
Therefore
Collecting the results:
(P) 12 (Option 2), (Q) 6 (Option 4), (R) Infinite (Option 3), (S) 0 (Option 5)
The option that matches this combination is
Option C: (P) (2), (Q) (4), (R) (3), (S) (5).
Tagged Transpose, symmetric and skew-symmetric matrices. Machine-assigned, so read it as a strong shortlist rather than a verdict.