Ask your own question, for FREE!
MIT 18.06 Linear Algebra, Spring 2010 15 Online
OpenStudy (anonymous):

the number of different nxn symmetric matrices with each element being either 0 or 1 is ______ a. 2^n b. 2^(n^2) c.2^((n^2+n)/2) d.2^((n^2-n)/2) @IIT study group

OpenStudy (cathyangs):

I'm pretty sure that it's b.

OpenStudy (anonymous):

how?

OpenStudy (anonymous):

Option C. \[ \large \huge 2 ^ {\frac{(n^2 + n )}{2}} \]

OpenStudy (anonymous):

yes... c is the correct answer... how would u say that? please tell me...

OpenStudy (anonymous):

I know .. ;)

OpenStudy (cathyangs):

for each element, it can be either 0 or 1. Because there are nxn elements in the matrix, AHH!! it's symmetric. sorry, its 2^((n^2+n)/2)

OpenStudy (anonymous):

thank you... :)

OpenStudy (anonymous):

but can u elaborate the reason please...

OpenStudy (anonymous):

Alright .. how many places in the matrix can have 0 or 1?

OpenStudy (anonymous):

but can u elaborate the reason please...

OpenStudy (anonymous):

yaa... got it... thanks... it is (n^2+n)/2 places in which either 1 or 0 can be present... the remaining elements depends on the filled in elements as the matrix is symmetric... so... c is the option...

OpenStudy (anonymous):

anusha?

OpenStudy (anonymous):

but can u elaborate the reason please...

OpenStudy (anonymous):

thank u @ FoolForMath and @cathyangs

OpenStudy (anonymous):

You are welcome :)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!