7/12/2014 Divisibility rules/Rule 2 for 7 proof - AoPSWiki

http://www.artofproblemsolving.com/Wiki/index.php/Divisibility_rules/Rule_2_for_7_proof 1/1
Search Wiki
Go Search
Page Tools
Page
Discussion
View source
History
Personal tools
Log in
Navigation
Main page
Community portal
Recent changes
Random page
Help
Toolbox
What links here
Related changes
Special pages
Printable version
Permanent link
Art of Problem Solving
Divisibility rules/Rule 2 for 7 proof
From AoPSWiki
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.
See also
Back to Divisibility Rules
Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/Divisibility_rules/Rule_2_for_7_proof"
Category: Divisibility Rules
This page was last modified on 6 March 2014, at 20:26. This page has been accessed 3,477 times. Privacy
policy About AoPSWiki Disclaimers