Consider the 2 0 1 8 × 2 0 1 8 matrix A = [ a i j ] with a i j = i j if i = j and a i i = 1 + i 2 . What remainder is left after you divide det A by 2 0 1 8 ? (No calculator required)
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.
Nice solid solution! Thank you, Mark!
The symmetric matrix B = [ b i j ] with b i j = i j has rank 1, with eigenvalues 0 (with muliplicity n − 1 ) and tr B = ∑ i = 1 n i 2 . Thus the matrix A = B + I n has the eigenvalues 1 (with multiplicity n − 1 ) and 1 + ∑ i = 1 n i 2 so det A = 1 + ∑ i = 1 n i 2 . (We know that det A is the product of the eigenvalues and tr A is their sum.)
In the case of n = 2 0 1 8 we find det A = 6 1 × 2 0 1 8 × 2 0 1 9 × 4 0 3 7 + 1 = 1 0 0 9 × 6 7 3 × 4 0 3 7 + 1 , which leaves a remainder of 1 0 1 0 .
Wow, this is beautiful. I discovered a parttern, and I was trying to prove that det ( A n ) = 1 + ( 1 2 + 2 2 + ⋯ + n 2 ) via induction. And I then read up on block matrix identities. In particular, det [ A C B D ] = ( D + 1 ) det ( A ) − det ( A + B C ) . I even tried to see if Woodbury matrix identity can be applicable here.
I'm sure there is a much more elegant solution to this one. But here's my approach:
Observe that, det ( A n ) = tr ( A n ) − ( n − 1 ) = 1 − n + ∑ i = 1 n ( 1 + i 2 ) = 1 + ∑ i = 1 n i 2 = 1 + 6 n ( n + 1 ) ( 2 n + 1 ) .
For n = 2 0 1 8 , det ( A n ) mod 2 0 1 8 = 1 + 6 2 0 1 8 ( 2 0 1 8 + 1 ) ( 2 ⋅ 2 0 1 8 + 1 ) mod 2 0 1 8 = 1 + 1 0 0 9 = 1 0 1 0 , which is the answer we seek.
Very nicely done, Comrade! Just to clarify for the less experienced readers: How do we know that det ( A n ) = tr ( A n ) − ( n − 1 ) ?
You know, I came across this problem today when I needed to prove that the scaling factor of a graph in many variables is what it is.
Log in to reply
Thank you, Otto! It's an observation I made, but @Mark Hennings has written a detailed explanation which also shows why it is true.
Problem Loading...
Note Loading...
Set Loading...
Consider the n × n matrix A , where A i j = δ i j + i j 1 ≤ i , j ≤ n Then we note that A = I + x x T where x = ⎝ ⎜ ⎜ ⎜ ⎛ 1 2 ⋮ n ⎠ ⎟ ⎟ ⎟ ⎞ Thus we deduce that A x = ( ∥ x ∥ 2 + 1 ) x while A y = y x ⋅ y = 0 If we choose an orthogonal matrix P whose first column is a multiple of x , we deduce that A P = P ⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎛ ∥ x ∥ 2 + 1 0 0 0 ⋮ 0 0 1 0 0 ⋮ 0 0 0 1 0 ⋮ 0 0 0 0 1 ⋮ 0 … … … … ⋱ … 0 0 0 0 ⋮ 1 ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎞ and hence d e t A = d e t ( P T A P ) = ∥ x ∥ 2 + 1 = 6 1 n ( n + 1 ) ( 2 n + 1 ) + 1 For this problem we have n = 2 0 1 8 = 2 × 1 0 0 9 where 1 0 0 9 is prime. It is clear that d e t A ≡ 1 ( m o d 1 0 0 9 ) , and we also see that d e t A ≡ 0 ( m o d 2 ) . Thus we deduce that d e t A ≡ 1 0 1 0 ( m o d 2 0 1 8 ) .