The number of symmetric matrices of order \(3 \times 3\) whose every element is either 0 or 1 is
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → 64
In a symmetric matrix \(a_{ij} = a_{ji}\), so each element below the diagonal is the same as its mirror element above the diagonal.
The matrix is therefore fixed once these elements are chosen:
3 diagonal elements \(a_{11}, a_{22}, a_{33}\)
3 elements above the diagonal \(a_{12}, a_{13}, a_{23}\)
That is 6 free positions, and each can be filled in 2 ways (0 or 1):
\(2^6 = 64\)
Why the other options are incorrect
Option (1) 8 — Incorrect. \(2^3 = 8\) counts only the choices for the diagonal; the 3 elements above the diagonal are also free.
Option (3) 512 — Incorrect. \(2^9 = 512\) is the number of all \(3 \times 3\) matrices with elements 0 or 1, symmetric or not.
Option (4) 729 — Incorrect. \(3^6 = 729\) would need 3 choices for each position, but there are only 2.