Let $A$ be a $n \times n$ matrix with integer entries. Prove that all entries of $A^{-1}$ are integer if and only if $\det (A) = \pm 1$.
I know that $$A^{-1}= \frac{\operatorname{adj}(A)}{\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 $\frac{\operatorname{adj}(A)}{\det (A)}$. So, I know that $A^{-1} = \pm \operatorname{adj}(A)$. Then I said that because the ${\rm adj}(A)$ is simply the matrix of co-factors of $A$, and because $\operatorname{adj}(A)$ has all integer entries, then $\operatorname{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?