So, $A$ is a $n \times n$ matrix with integer entries. The question is to prove that $A^{-1}$ has all integer entries if and only if ${\rm det}\ (A) =\pm 1$.
I know that $A^{-1}= {\rm adj}(A)/{\rm det}(A)$, but I have no idea where to go from there for the forward direction. Any help here would be greatly appreciated.
For the backwards direction, I think I am okay. I plugged the 1 and the -1 options into $ {\rm adj}(A)/{\rm det}(A)$. So, I know that $A^{-1}= {\rm adj}(A)$ or $-{\rm adj}(A)$. Then I said that because the ${\rm adj}(A)$ is simply the matrix of co-factors of $A$, and because $A$ has all integer entries, then ${\rm adj}(A)$ will have all integer entries, which will mean that $A^{-1}$ will have all integer entries. Is that okay? Or am I missing something else?
Thank you!!