Difference between revisions of "Divisibility rules/Rule 2 for 7 proof"
| Line 8: | Line 8: | ||
==See also== | ==See also== | ||
[[Divisibility rules | Back to Divisibility Rules]] | [[Divisibility rules | Back to Divisibility Rules]] | ||
| + | [[Category:Divisibility Rules]] | ||
Revision as of 19:26, 6 March 2014
Truncate the last digit of 
, double that digit, and subtract it from the rest of the number (or vice-versa). is divisible by 7 if and only if the result is divisible by 7.
Proof
An understanding of basic modular arithmetic is necessary for this proof.
The divisibility rule would be 
, where 
, where 
is the nth digit from the right (NOT the left) and we have 
and since 2 is relatively prime to 7, 
. Then yet again 
, and this is equivalent to our original number.
