Divisibility by 7
Below is a short, purely “algebraic” argument (no explicit modular arithmetic) for the common test for divisibility by 7:
Take the last digit of the number, double it, and subtract that product from the remaining truncated part. If the result is divisible by 7, then the original number is also divisible by 7.
In a formula:
-
Let have last digit and truncated part .
So . -
The rule says:
We prove this equivalence purely via algebraic manipulation and the notion of “multiple of 7.”
Forward Direction
(If is divisible by 7, then is also divisible by 7.)
-
Assume is a multiple of 7.
That is, there exists some integer such that -
Rewrite “” as “.”
Since , we have:So
Subtract from both sides:
Hence is itself a multiple of 7.
Call that multiple , i.e. -
Express in terms of .
From , we get -
Check .
Substitute :Factor out 7:
Thus is a multiple of 7.
Therefore, whenever is divisible by 7, must also be divisible by 7.
Reverse Direction
(If is divisible by 7, then is divisible by 7.)
-
Assume is a multiple of 7.
That is, there exists an integer such thatRearrange it to solve for :
-
Substitute into .
Factor out 7:
Hence is also a multiple of 7.
Therefore, is divisible by 7 if and only if is divisible by 7.
Conclusion
Putting both parts together, we have shown purely by algebra that
In everyday language:
A decimal number is divisible by 7 if and only if, when you double its last digit and subtract that from the rest of the number, the result is divisible by 7.
Comments
Post a Comment