2

Question is to find The number of symmetric matrices of order 5 with each element either 0 or 1 .

What i am trying is

If i take matrix of order 2

$$A=\left[\matrix{ A & B \\ B & C \ }\right]$$

Here i am having $2.2.2$ cases in total .Assuming A and C are different .Is thi correct way to generalise to higher order ? Thanks

godonichia
  • 2,235

1 Answers1

2

Yes your argument is a good start. You may count $n$ the amount of possibly different elements of an upper triangular matrix and then you get $2^n$ binary symmetric matrices. In the case of matrices $3\times 3$ we have $$\begin{pmatrix} A_1 & A_2 & A_3 \\ & A_4 & A_5 \\ & & A_6 \end{pmatrix}$$ where $A_1,A_2,A_3,A_4,A_5,A_6 \in \{0,1\}$ so you'll have $2^{6}$ possible matrices (note that the other elements of the matrix are fixed by symmetry). Now, for finding $n$ you may have a look here.

Surb
  • 55,662