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
Taking mod gives