It has just occurred to me that there is a very simple test to check if an integer is divisible by 4: take twice its tens place and add it to its ones place. If that number is divisible by 4, so is the original number.
This result seems like something that anybody with an elementary knowledge of modular arithmetic could realize, but I have noticed that it is conspicuously missing on many lists of divisibility tests (for example, see here, here, here, or here). Is this divisibility test well-known?
Answer
Yes, it is well known; do you know modular arithmetic? Assuming you do, we have a number $abc=a\cdot 10^2+b\cdot 10^1+c\cdot 10^0$. Now $$a\cdot 10^2+b\cdot 10^1+c\cdot 10^0\equiv 2\cdot b+c\pmod{4}.$$ Many people know the multiples of $4$ for numbers less than $100$, so it is commonly just said if the last two digits (as a number) is divisible by $4$, then the number is divisible by $4$.
No comments:
Post a Comment