Let $A$ be an $n\times n$ nonsingular matrix with integer entries.
Prove that the inverse matrix $A^{-1}$ contains only integer entries if and only if $\det(A)=\pm 1$.
Add to solve later Let $A$ be an $n\times n$ matrix.
The $(i, j)$ cofactor $C_{ij}$ of $A$ is defined to be
\[C_{ij}=(-1)^{ij}\det(M_{ij}),\]
where $M_{ij}$ is the $(i,j)$ minor matrix obtained from $A$ removing the $i$-th row and $j$-th column.
Then consider the $n\times n$ matrix $C=(C_{ij})$, and define the $n\times n$ matrix $\Adj(A)=C^{\trans}$.
The matrix $\Adj(A)$ is called the adjoint matrix of $A$.
When $A$ is invertible, then its inverse can be obtained by the formula
For each of the following matrices, determine whether it is invertible, and if so, then find the invertible matrix using the above formula.
(a) $A=\begin{bmatrix}
1 & 5 & 2 \\
0 &-1 &2 \\
0 & 0 & 1
\end{bmatrix}$.
(b) $B=\begin{bmatrix}
1 & 0 & 2 \\
0 &1 &4 \\
3 & 0 & 1
\end{bmatrix}$.
Add to solve later Calculate the determinants of the following $n\times n$ matrices.
\[A=\begin{bmatrix}
1 & 0 & 0 & \dots & 0 & 0 &1 \\
1 & 1 & 0 & \dots & 0 & 0 & 0 \\
0 & 1 & 1 & \dots & 0 & 0 & 0 \\
\vdots & \vdots & \vdots & \dots & \dots & \ddots & \vdots \\
0 & 0 & 0 &\dots & 1 & 1 & 0\\
0 & 0 & 0 &\dots & 0 & 1 & 1
\end{bmatrix}\]
The entries of $A$ is $1$ at the diagonal entries, entries below the diagonal, and $(1, n)$-entry.
The other entries are zero.
\[B=\begin{bmatrix}
1 & 0 & 0 & \dots & 0 & 0 & -1 \\
-1 & 1 & 0 & \dots & 0 & 0 & 0 \\
0 & -1 & 1 & \dots & 0 & 0 & 0 \\
\vdots & \vdots & \vdots & \dots & \dots & \ddots & \vdots \\
0 & 0 & 0 &\dots & -1 & 1 & 0\\
0 & 0 & 0 &\dots & 0 & -1 & 1
\end{bmatrix}.\]
The entries of $B$ is $1$ at the diagonal entries.
The entries below the diagonal and $(1,n)$-entry are $-1$.
The other entries are zero.
Add to solve later 
