Divisibility by 13
Divisibility “rule” for 13 (subtract 9 times the last digit)
A known test for divisibility by works by taking the last digit, multiplying it by , and then subtracting that product from the remaining truncated part of the number. If the result is divisible by , then the original number is divisible by . Here’s how it looks for :
-
Split off the last digit () and the rest of the number ().
-
Multiply the last digit by : .
-
Subtract that from the truncated part: .
-
Since is divisible by (i.e., ), is also divisible by .
Either approach quickly confirms that .
Proof:
Below is a short, purely “algebraic” proof of the rule
A decimal number is divisible by 13 if and only if “take its last digit , multiply it by 9, and subtract that from the truncated part .” The resulting number, , must also be divisible by .
We never explicitly mention “modular arithmetic” or “congruences”; we only use the idea that “ is divisible by ” means “ is a multiple of .”
Setting Up the Problem
Let be a decimal number with last digit and “truncated part” .
In other words,
where and is the integer we get by removing the final digit of .
We want to show:
Forward Direction (if divides , it divides )
-
Assume is a multiple of .
That is, there exists an integer such that -
Rewrite “10” as “(13 - 3).”
Since , we haveHence
Rearrange to get
So is also a multiple of .
Write as -
Check .
Substituting , we getFactor out :
Thus is a multiple of .
Hence, if divides , then it must also divide
Reverse Direction (if divides , it divides )
-
Assume is a multiple of .
That is, there exists an integer such thatRearrange to get
-
Substitute into .
Factor out :
So is a multiple of .
Thus, if divides , then it must also divide .
Conclusion
Putting both directions together shows
In words: A number is divisible by 13 exactly if, after you remove its last digit , multiply that digit by 9, and subtract from the remaining part , you get a multiple of 13.
Comments
Post a Comment