CIARA C.

LADROMA BSM-3
EXERCISES
1. Use shortcut method to determine the product of the following:

a)







b)







c)







d)







e)
 




 Both 90

f)




g)





 Both 186


h)




2. Determine the divisibility of the following statements:

a) 3 divides 839,223?
 839,223 is divisible by 3 since and 3 divides 27.

b) 6 divides 839, 223?

 To determine if a number is divisible by 6, the sum of the digits of the number
must first be divisible by both 3 and 2.
 839, 223 is divisible by 3 since and 3 divides 27.
 839, 223 is not divisible by 2 since it does not end with 0, 2, 4, 6 or 8.
  Since 839, 223 is divisible only by 3 but not with 2, it is not divisible by 6.

c) 9 divides 9,645,174?
 Since 9 is just , any number divisible by 3 is also divisible by 9.
 9,645,174 is divisible by 3 since and 3 divides
36.
 Hence, 9,645,174 is also divisible by 9.

d) 11 divides 19,472,530?
 To determine if a number is divisible by 11, the sum of the even numbers of n
(from right) must be subtracted from the sum of the odd numbers of n. Check,
then, if the difference is divisible by 11.
 The odd numbers are 0, 5, 7, and 9; their sum is 21.
 The even numbers are 3, 2, 4, and 1; their sum is 10.

 19,472,530 is divisible by 11 since 11 divides itself.

e) 13 divides 1,570,855?
 ( )
 ( )
 ( )
 ( )
 ( )
 ( ) and
 So 1,570,855 is divisible by 13.

f) 17 divides 541,008?
 ( )
 ( )
 ( )
 ( ) and
 So 541,008 is divisible by 17.

g) 19 divides 10,809,556?
 ( )
 ( )
 ( )
 ( )
 ( )
 ( ) and
 So 10,809,556 is divisible by 19.

h) 31 divides 833,556,024?
  ( )
 ( )
 ( )
 ( )
 ( )
 ( )
 ( ) and
 So 833,556,024 is divisible by 31.

3. Find the least value of w of the following:

a) 5 divides 1234
 A number is divisible by 5 if it ends with either 0 or 5.
 So the possible values of are 0 and 5.
 Since we are tasked to find the least possible value of and 0<5, the value of
in this case is 0. Hence, the number given here is 12340.

b) 6 divides 12w318
 We need to find a digit to make the number divisible by both 3 and 2.
 . The sum of must be divisible by 2. So to
find the possible values of , we need to think of possible numbers that ends
with even numbers that is greater than or equal to 15 since we do not want a
negative value for .
 Therefore the possible values of the sum of that are also greater than 15
are 16, 18, 20, 22, 24 and the list goes on.
 Substituting 16, 18, 20, 22 and 24 as the sum of , we will find that the
possible values of are 1, 3, 5, 7 and 9.
 Next, we need possible sum of that is a multiple of 3 that is also greater
than or equal to 15, which are 15, 18, 21, 24, 27 and the list goes on.
 Substituting 15, 18, 21, 24, and 27 as the sum of , we will find that the
possible values of are 0, 3, 6, 9 and 12.
 We need to find values that are common in both arrays of possible values of
which are 3 and 9.
 Since we are tasked to find the least possible value of and 3<9, the value of
in this case is 3. Hence, the number given here is 123318.

c) 8 divides 99w08
 The divisibility by 8 rule states that any large number is divisible by 8 if the last
3 digits of the number are divisible by 8.
 So we need to substitute with possible values of which ranges from 0-9.
 Assume that is equal to 0, the last three digits of the number is then 008 which
is basically just 8, and 8 divides itself.
 No natural number is lesser than 0, therefore the value of
 Hence, the number given here is 99008.

d) 3 divides 4w936
  The number is divisible by 3, if the sum of its digits is divisible by 3.
 . So to find the value of , we need to figure out the
smallest possible sum of the digits which is a multiple of 3 and must be greater
than or equal to 22 to evade getting a negative value of .
 The smallest possible sum is 24. Substituting 24 as the sum of the digits get us
the value of .
 Hence, the number given here is 42936.

4. Prove the divisibility of 13.

Proof:
Let and so
where are integers

( ) ( )
Let so
( ) ( )

is a multiple of 13 and is
therefore divisible by 13
If ( ), then

Explanation:
So is divisible by 13 if and only if the sum of 4 times or the unit digit and (or the
remaining number where /the unit digit is omitted) is divisible by 13. The operation
may be repeated until the sum is small enough so that the divisibility by 13 is obvious.

5. State and prove the divisibility of 23.

Explanation:
Any number is divisible by 23 if and only if the sum of 7 times or the unit digit and abc
(or the remaining number where /the unit digit is omitted) is divisible by 23. The
operation may be repeated until the sum is small enough so that the divisibility by 23 is
obvious.

Proof:
Let and so
where are integers

( ) ( )
Let so
( ) ( )

is a multiple of 23 and is
therefore divisible by 23
If ( ), then