Another dash of symmetry .....

Let S S be the set of all symmetric 3 3 x 3 3 matrices which have only 0 0 's and 1 1 's as entries. (The number of entries that can be 0 0 can be any integer from 0 0 to 9 9 inclusive, as is the case for the number of entries that can be 1 1 .)

Let N ( k ) N(k) be the number of elements of S S that have k k 0 0 's as entries. Find k = 0 9 ( N ( k ) ) 2 \displaystyle\sum_{k=0}^9 (N(k))^{2} .


The answer is 580.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

For the matrix A \textbf{A} to be symmetric it must be equal to its transpose, i.e., the entries must be such that a i j = a j i a_{ij}=a_{ji} .

For a 3 3 x 3 3 matrix this means that we require the 3 3 "pairings" a 12 = a 21 , a 13 = a 31 a_{12}=a_{21}, a_{13}=a_{31} and a 23 = a 32 a_{23}=a_{32} , while a 11 , a 22 a_{11}, a_{22} and a 33 a_{33} are unchanged by the transposing.

Now we need to look separately at the cases where there are 0 , 1 , 2 , . . . , 9 0, 1, 2, ... ,9 entries that are 0 0 .

There is only 1 1 matrix that has no 0 0 's, and this matrix is indeed symmetric.

To have just one 0 0 , all the pairing must be 1 1 's and precisely 1 1 of the a i i a_{ii} entries must be 0 0 . This gives us 3 3 symmetric matrices.

We can have 2 2 entries that are 0 0 in the following ways: (i) 2 2 of the a i i a_{ii} entries are 0 0 , and all other entries are 1 1 , and (ii), precisely one of the pairings is composed of 0 0 's, and all other entries are 1 1 's. Case (i) gives us ( 3 2 ) = 3 \binom{3}{2} = 3 symmetric matrices, and case (ii) gives us ( 3 1 ) = 3 \binom{3}{1} = 3 more symmetric matrices, for a total of 6 6 .

We can have 3 3 entries that are 0 0 in the following ways: (i) all the a i i a_{ii} entries are 0 0 and all the pairings are 1 1 's, and (ii) one of the pairings is composed of 0 0 's and one of the a i i a_{ii} entries is a 0 0 . Case {i} gives us 1 1 symmetric matrix, and case (ii) gives us ( 3 1 ) ( 3 1 ) = 3 3 = 9 \binom{3}{1} \binom{3}{1} = 3*3 = 9 more, for a total of 10 10 .

We can have 4 4 entries that are 0 0 in the following ways: (i) one of the pairings is composed of 0 0 's and 2 2 of the a i i a_{ii} entries are 0 0 's, and (ii) 2 2 of the pairings are composed of 0 0 's, with all remaining entries being 1 1 's. Case (i) gives us ( 3 1 ) ( 3 2 ) = 9 \binom{3}{1} \binom{3}{2} = 9 symmetric matrices, and case (ii) gives us ( 3 2 ) = 3 \binom{3}{2} = 3 more, for a total of 12 12 .

The number of symmetric matrices with 5 5 entries that are 0 0 is the same as the number with 4 4 entries that are 1 1 , which by symmetry will be the same as the number with 4 4 entries that are 0 0 , i.e., 12 12 . Similarly, the number of symmetric matrices with 6 , 7 , 8 6, 7, 8 and 9 9 entries that are 0 0 will be 10 , 6 , 3 10, 6, 3 and 1 1 , respectively.

The desired sum is then 2 ( 1 2 + 3 2 + 6 2 + 1 0 2 + 1 2 2 ) = 580 2*(1^{2} + 3^{2} + 6^{2} + 10^{2} + 12^{2}) = \boxed{580} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...