X hits on this document

63 views

0 shares

4 / 15

# 1 (mod 5) we have

3243847

( 1)3847

=

14

(mod 5)

and so the remainder is 4.

# The Divisibility Tests

In our base 10 number system, the number a composed of the digits a , a , a1, a0 read from left to right can be written as the sum

1,

a = 10 a + 10

1a

1

• +

· · · + 10a1 + a0

(1)

Our standard method for testing the divisibility of a by d is to reduce the above sum modulo d and see what information we get.

# For ease of notation, we will write [a a

whose (base 10) digits are a , a

1,

, a1

1 a 1 a 0 ] t o d e n o t e t h e n u m b e r , a0 from left to right. In other

w o r d s , t h e s u m i n e q u a t i o n ( 1 ) . T h u s , i f a = 2 7 1 8 = [ a 3 a 2 a 1 a 0 ] , t h e n [ a 3 a 2 ] =

27. We will often use the fact that [a a

1

a 1 a 0 ] = 1 0 n [ a a

1

an] +

[an

1

a0].

3.1

Examine the Ending Digits

It is exceedingly easy to test if a number a is divisible by 2; simply see if the last digit of a is divisible by 2. The same test works when determining divisibility by 5 or 10. As another example, it turns out that if you want to test divisibility of a by 8, you only need to check if the last three digits of a are divisible by 8.

4

 Document views 63 Page views 67 Page last viewed Thu Jan 19 01:08:44 UTC 2017 Pages 15 Paragraphs 695 Words 3760