2. Suppose that A is an n×n matrix with integer entries, and that A is invertible. Since
A is invertible, we can compute the matrix A^−1. The computations seem much cleaner
(and friendlier) when A^−1 also has only integer entries. The purpose of this question is
to figure out when that can happen.
Prove: That (if A is an invertible n × n matrix, with only integer entries) A^−1 has
integer entries if and only if det(A) = ±1 (where “= ±1” means equals 1 or equals −1).
Reminder: Since this is an “if and only if”, don’t forget that means that you have two
directions to prove.

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Hey james once you are done with this please help me....

Hey turn towards Unanswered question james....
Adherent points

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.