Find the number of positive integer factors of the determinant of the 2 0 1 7 × 2 0 1 7 matrix whose diagonal elements are all 2017 and off-diagonal elements are all 1.
Notes:
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.
Clearly, 2 0 1 6 is an eigenvalue of the matrix (call the determinant A ).
Also, the matrix A − 2 0 1 6 I has all its elements 1 , so its nullity is 2 0 1 7 − 1 = 2 0 1 6 . Therefore, the geometric multiplicity of the eigenvalue, 2 0 1 6 is 2 0 1 6 , and hence its algebraic multiplicity is at least 2 0 1 6 (and at most 2 0 1 7 , because the order of the matrix is 2 0 1 7 ).
If the eigenvalue 2 0 1 6 would have had multiplicity 2 0 1 7 , then (trace A ) = sum of all eigenvalues of A ,and so
2 0 1 7 × 2 0 1 7 = 2 0 1 6 × 2 0 1 7 , which is absurd.
It follows that the eigenvalue 2 0 1 6 has multiplicity 2 0 1 6 . Let λ be the last eigenvalue. Then (trace A ) = sum of all eigenvalues of A , so
2 0 1 7 × 2 0 1 7 = 2 0 1 6 × 2 0 1 6 + λ , therefor λ = 4 0 3 3 .
It follows that
∣ A ∣ = 2 0 1 6 2 0 1 6 × 4 0 3 3 = ( 2 5 × 3 2 × 7 ) 2 0 1 6 × 3 7 × 1 0 9
= 2 1 0 0 8 0 × 3 4 0 3 2 × 7 2 0 1 6 × 3 7 × 1 0 9 , which has
1 0 0 8 1 × 4 0 3 3 × 2 0 1 7 × 2 × 2 = 3 2 8 0 1 8 0 3 7 7 6 4 factors.
How 2016 is an eigen value ?
Log in to reply
Note that A − 2 0 1 6 I has all rows the same, so it's determinant is 0 (Remember, a determinant of a matrix with any two rows or two columns same is 0 .
Log in to reply
You need to say a little more to prove your result. The vector e = ⎝ ⎜ ⎜ ⎜ ⎛ 1 1 ⋮ 1 ⎠ ⎟ ⎟ ⎟ ⎞ is an eigenvector of A of eigenvalue 4 0 3 3 , and any vector orthogonal to e is an eigenvector of A of eigenvalue 2 0 1 6 . Since the orthogonal complement of the one-dimensional subspace of R 2 0 1 7 spanned by e is 2 0 1 6 -dimensional, we deduce that we can find 2 0 1 6 linearly independent eigenvectors of A with eigenvalue 2 0 1 6 . Thus A has eigenvalues: 4 0 3 3 (once) and 2 0 1 6 (repeated 2 0 1 6 times)...
Problem Loading...
Note Loading...
Set Loading...
Adding a multiple of a row to another doesn't change the determinant, so add -1 times the first row to each of the other rows:
⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎛ 2 0 1 7 − 2 0 1 6 − 2 0 1 6 ⋮ − 2 0 1 6 1 2 0 1 6 0 ⋮ 0 1 0 2 0 1 6 ⋮ 0 … … … ⋱ … 1 0 0 ⋮ 2 0 1 6 ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ ⎞
Except for top left element (which is 2017), the first row contains all 1s, the diagonal contains all 2016s, and the first column contains all -2016s.
Add − 2 0 1 6 1 of each row except the first to the first row. The first row vanishes, except for the first element which becomes 4033.
Since the matrix is now lower diagonal, the determinant is the product of the diagonal entries: 4 0 3 3 ⋅ 2 0 1 6 2 0 1 6 = ( 3 7 ⋅ 1 0 9 ) ⋅ ( 2 5 ⋅ 3 2 ⋅ 7 ) 2 0 1 6 . It's well known that the number of positive divisors of an integer with factorization p 1 e 1 p 2 e 2 p 3 e 3 … is ( 1 + e 1 ) ( 1 + e 2 ) ( 1 + e 3 ) … , so applying to this, the factorization is 3 7 1 ⋅ 1 0 9 1 ⋅ 2 1 0 0 8 0 ⋅ 3 4 0 3 2 ⋅ 7 2 0 1 6 and the number of positive divisors is 2 ⋅ 2 ⋅ 1 0 0 8 1 ⋅ 4 0 3 3 ⋅ 2 0 1 7 = 3 2 8 0 1 8 0 3 7 7 6 4 .