Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (zzr0ck3r):

Good methods for finding eigen values? \(M = \begin{array}{cc} 0&1&1&1&1& \\ 1&0&1&1&1 \\ 1&1&0&1&1 \\ 1&1&1&0&1\\ 1&1&1&1&0 \end{array}\)

OpenStudy (zzr0ck3r):

@freckles where you go ;(

OpenStudy (usukidoll):

\[\det(A- \lambda I) =0\] and then use cofactor expansion like crazy

OpenStudy (zzr0ck3r):

I said good methods :)

OpenStudy (usukidoll):

=(

OpenStudy (usukidoll):

row operations first? idk that may destroy the determinant...

OpenStudy (freckles):

lol well ... I was kind of trying to see if could find a pattern but I didn't see a pattern like you know M_n is a n by n matrix with 0's on the diagonal and 1's everywhere else but it was totally not a good method

OpenStudy (freckles):

and not just a bad method but it didn't seem to work like that

OpenStudy (usukidoll):

does this whole matrix break one of the rules for row operations? Don't we need a 1 at the top left corner of the first row?

OpenStudy (zzr0ck3r):

word

OpenStudy (usukidoll):

row swaps... so it does not break the first rule

OpenStudy (usukidoll):

I would switch the last one with the first one r_1<->r_5

OpenStudy (usukidoll):

swap r_2 <-> r_4 , then r_3 <-> r_4 ?

OpenStudy (freckles):

actually I do see a pattern

OpenStudy (freckles):

so there must be some kinda of shortcut for M_n where M_n is a n by n matrix with 0's a long the diagonal and 1's elsewhere

OpenStudy (freckles):

I want to make a conjecture \[\text{ egienvalues }(M_n)=n-1,-1 \text{ (multiplicity } (n-1) \text{ )}\]

OpenStudy (freckles):

Now I know this isn't a method but it might help to come up with something from this if it is even true

OpenStudy (freckles):

like we know the trace of M is suppose to be the sum of the eigenvalues

OpenStudy (freckles):

\[0=\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5\]

OpenStudy (freckles):

I don't know a quick way to find the determinant but the product of the eigenvalues equals the determinant

OpenStudy (zzr0ck3r):

ill play with this too

OpenStudy (freckles):

another cute thing \[M_n=[1]_n-I\] where 1_n is a n by n matrix only made of 1's and I is the identity matrix don't know if this helps yet

OpenStudy (freckles):

you know I'm not totally sure yet but it seems to be: in this case anyways \[\text{ eigenvalues(}M_n\text{)}=\text{ egivenvalues(}[1]_n\text{)}-\text{ egienvalues(}I\text{)}\]

OpenStudy (freckles):

the eigenvalues of I are 1 (n amount of times) and the eigenvalues of [1]_n are n, 0 (n-1 amount of times)

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!