Does this Pattern Continue?

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 log 2 x \log_2 x digits of any number are divisible by x?

No Yes

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.

1 solution

Jordan Cahn
Dec 21, 2018

Let x = 2 n x=2^n . Let a a be a number for which we want to test its divisibility by x x . The "last n n digits of a a " can be expressed as a m o d 1 0 n a \bmod 10^n . However, 1 0 n = 2 n 5 n 10^n = 2^n \cdot 5^n . So a 0 m o d 10 a 0 m o d 2 n a \equiv 0\bmod 10 \iff a\equiv 0\bmod 2^n

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...