The divisibility rule of 2 is that the last digit of a number is divisible by 2.
The divisibility rule of 4 is that the last 2 digits of a number are divisible by 4.
The divisibility rule of 8 is that the last 3 digits of a number are divisible by 8.
Is it true that for any number x that is a power of 2, the divisibility rule of x is that the last digits of any number are divisible by x?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let x = 2 n . Let a be a number for which we want to test its divisibility by x . The "last n digits of a " can be expressed as a m o d 1 0 n . However, 1 0 n = 2 n ⋅ 5 n . So a ≡ 0 m o d 1 0 ⟺ a ≡ 0 m o d 2 n