Divisibility by 10

From ProofWiki
Jump to navigation Jump to search

Theorem

An integer $N$ expressed in decimal notation is divisible by $10$ if and only if the least significant digit of $N$ is $0$.


That is:

$N = \sqbrk {a_n \ldots a_2 a_1 a_0}_{10} = a_0 + a_1 10 + a_2 10^2 + \cdots + a_n 10^n$ is divisible by $10$

if and only if:

$a_0 = 0$


Proof

Let $N$ be divisible by $10$.

Then:

\(\ds N\) \(\equiv\) \(\ds 0 \pmod {10}\)
\(\ds \leadstoandfrom \ \ \) \(\ds \sum_{k \mathop = 0}^n a_k 10^k\) \(\equiv\) \(\ds 0 \pmod {10}\)
\(\ds \leadstoandfrom \ \ \) \(\ds a_0 + 10 \sum_{k \mathop = 1}^n a_k 10^{k - 1}\) \(\equiv\) \(\ds 0 \pmod {10}\)
\(\ds \leadstoandfrom \ \ \) \(\ds a_0\) \(\equiv\) \(\ds 0 \pmod {10}\) as $10 \equiv 0 \pmod {10}$

$\blacksquare$


Sources