Difference between revisions of "Divisibility rules/Rule for 2 and powers of 2 proof"
(No difference)
|
Revision as of 23:01, 15 August 2006
A number is divisible by
if the last
digits of the number are divisible by
.
Proof
An understanding of basic modular arithmetic is necessary for this proof.
Let where the
are base-ten numbers.
Thus
![$N = 10^k a_k + 10^{k-1} a_{k-1} + \cdots + 10 a_1 + a_0.$](http://latex.artofproblemsolving.com/2/9/8/298c376ff3a0f4ffb08ae3357165f9f92c517586.png)
Taking mod
gives
![]() |
![]() |
![]() | |
![]() |