Most elementary proof that a determinant is divisible by $m$

Question

So a challenge problem states that you have an $n \times n$ matrix, where each entry is an integer between $0$ and $9$, and when each row is read as a base-10 number the number is divisible by a common factor $m$. The problem is to prove that the determinant of the matrix is also divisible by $m$. So far I have two proofs: If $m$ is a power of a prime, then we can consider the field ${\mathbb F}_m$ and the vector $(10^{n-1}, 10^{n-2}, \ldots, 1)$ is a non-zero vector in the kernel of the matrix over ${\mathbb F}_m$ so the determinant is $0$ over the field by general linear algebra. Or, for arbitrary $m$, we can add $10^{n-1}$ times the first column and $10^{n-2}$ times the second column and so forth and add it all to the last column without changing the determinant, and then we get the the last column is all numbers divisible by $m$ so the determinant is divisible by $m$ by expanding the determinant along the last column. However are there any more elementary proofs, say that just use the basic full expansion formula of the determinant, without using so many properties of the determinant?

Answer 1

Take the matrix (unity matrix except for last column) $$Q=\pmatrix{1&0&\dots&&10^{n-1}\cr0&1&0&\dots&10^{n-2}\cr\dots&0\cr0&\dots&&&1\cr}$$Its determinant is obviously 1, and the last column of $A\,Q$ is obviously the rows of $A$ interpreted in base 10. If the whole last column of $A\,Q$ can be divided by $m$, so can its determinant, and since the determinant of Q is 1, the determinant of $A\,Q$ is the same as the determinant of $A$.