E

UI
l-
Q
{rr

t
r
ri'

Factors and Multiples

i{,;t.i i"l ; l'd aii il:-'. ;"...i

; Li

These are counting numbers excluding the number '0', e .g. 1,2,3, ...

Fi';*ri': idt= **i':-. :

These are natural numbers that are greater than 1 and have only two
factors: '1' and the number itself, e.g. 2,3,5,7 , ...

{, ll rr l,:1.,,:;li,r: i"" r : il-, ilr,: l'}

These are natural numbers that are greater than 1 and are not
prime numbers.

lr.; Ilr,l i r:i .,-: l': l i f',.j :.: li.i l, i r: r-r

For natural numbers a, b and c, where a = b x c,

then
b and c are factors of a,
a is a multiple of b,
c is also a multiple of c.

j
:-,i:tr ir.l,-,1.;i it-r:',

If a number N has n factors a,

N=aXaxa...xa,
z times
-#
then it can be expressed as a",
where a is known as the l:a.rr and the power n is known as the irrrlg"r
(or exponent).

i]1 CHAP'TEtr 1
;--r..i r; I :l l"- i i.lit;i"t-.:,,:ji.i i,ai

It is the process of expressinga composite number into products of 2

or more prime factors, which is usually expressed in index notation.

The two methods commonly used to obtain the prime factorisation of

a composite number are:

Method 1: 'Ladder method' / Repeated division

Method 2: Factor tree

)' EXAMPLE 1 iirf:*i'r'l :'i r:': i"l:'.;'lr'ii::i"il"-' li

''i'!'r-'*
i I,i il j i-l
i, L:i"rl ili-l:i !'Lr-- i il i' :

Find the prime factorisation of 360.

>ts SOLUTION
Method 1" j': ;,:r.:rir,rl i;..':r:l.'ri.ril

i :oo
,$ r80
90
45
l5

.'.360=23x32x5

Method 2 ::-r:,:,--i,'..r'' l'i'l:'l I

/ ./ It is not necessarv to start the tree

'q.
ii
with a prime factor.

4 ei*

&l it $ ,Sl

.'.360=23x32x5

CHAFtrTl:N 1 NE
- The HCF of two or more natural numbers is the greatest natural number
that is a factor of each of these numbers.

The three methods commonly used to obtain the HCF of two or more
natural numbers are:

Method l: Listing
Method 2: 'Ladder method'
Method 3: Grouping

F"i" EXAMPLE2i,.;:,1.,; '-:'r: 1: ', . ''' .,,..r1,,;-1::.::i

Find the HCF of 30. 60 and 126.

};+. SOLUTION
Method | ' 1.,.:1' ,:'. 1:

Factors of 30: 1,2,3,5,'6,10, 15,30

60: 1, 2,3,4.5,6. 10, 12,15.20, 30,60
126: 1,2,3,6.7.9. 14.18. 21, 42, 63, 126

.'. HCF of 30, 60 and 126 is 6

Method 2i : 1::, '1 .1r: 11 ,

l'ei:o
'!

r-t-
60126
L J*i*51021
lq_ql

.'. HCF of 30.60 and 126 is 2 x 3 = 6

Method31.,', i,.r,',i
30=2x 3x -5
f In each group ol lhctors ol the
60=22 x 3 x 5 same base, extract the factor thal
has the least index: omit thtrse
126=2 x 3r x7 u hich have no common faclors
il i
ve and multiplythemto gettheHCF.

23
.'. HCF of 30.60 and 126 is 2 x 3 = 6
i.-f:**i" .1,:;:t::-,::'"r. : i..,:: ,ii.ii.,;11 lL .lff ]

The LCM of two or more natural numbers is the smallest natural number
that is a multiple of each of them.

>F EXAMPLE 3 lrrri:t::-:q il::: i"-i-li\'l i-:i ii rriri.r"'i:':-'l 1;;11-1i;i:r'fi

Find the LCM of 20,28 and 30.

>tr SOLUTION
Method 1 f l-.ii:i,;t,g j
Multiples of 20: 20, 40, 60,80, .. ., 380, 400, ffi , 440, ...
This method is rot the most
{ ethcrent as rt ls ttme consumlng.
28 28, 56, 84, 112, ..., 364, 392, E
!)

30: 30, 60, 90, 120, ... , 360, 390,

.'. LCM of 20,28 and 30 is 420

Method 2 i'L=t*ii*r rn*t'**ri'J

Ifa number is not divisible by

the divisor, it is copied to the
next row. Continue the process
until all the numbers become l.

.'. LCM of 20,28 and 30 is 22 x 3 x 5 x7 =420

Method 3 iGlr..*Pir1;J

i+ s ii
!11 *6 i!r!i:!dr+i:

2o =i22'i xl, ; In each group of factors of the

E:
same base. extract the factor
28 =i22 : ix i
"i\7 i
t'l
that has the largest index as

3O=i2 lxl3 xl5l! :

well as those which have no

+ I
2'357
tl common factors and multiPlY
them to get the LCM.

.'. LCM of 20.28 and 30 is22 x 3 x 5 x 7 =420

CHAPTEFI 1 . A4
 :-l;:" ir:,i.1.i::','.: I #::i.
- This is a test to discover if a given number is divisible by another number,
usually by observing the digits and without performing the division. This
can also be used to determine if a given number is prime or composite.

2 The last digit of the given 62,410

number is 0, 2,4, 6 or 8
J The sum of all the digits of the 135
given number is divisible by 3 (1 + 3 + 5 = 9, which is divisible
bv 3)
4 The number formed by the tz*4
last two digits ol- the given (24 is divisible by 4)
number is divisible by 4
5 The last digit of the given I 45. 630
number is either 0 or 5
6 The given number is divisible 732
by 2 and3 (its last digit is 2;7 + 3 + 2 =
12, which is divisible by 3)
l The difference between twice #tz
the last digit of the given flE#-z x2= 63,whichis
number and the rest of the divisible by 7)
number is either 0 or divisible
bv7
(this rule can be applied again
to the answer first derived)
8 The last 3 digits of the given 2l$4
number is divisible by 8 (104 is divisible by 8)
9 The sum of all the digits of the 3897
given number is divisible by 9 (3 + 8 + 9 +7 =27;2+7 =9,
(this rule can be applied again which is divisible by 9)
to the answer first derived)
10 The last digit of the given 32b
number is 0
1t The difference of the sum of 60 819
the odd numbered digits and ((6+8+9)-(0+l)=22,
the sum of the even numbered which is divisible by 11)
digits is either 0 or divisible
by l1
t2 The given number is divisible 216
bv3and4 (2 + I + 6 = 9 is divisible by
3; l6 is divisible by 4)

il5 CH,AF]TrFI ,1
1-;:::.:,:,l^:l: t::i.: ll r;i iii:-i.l ilt-:L,Ll;
In general, if a number a can be expressed as a = b' ,
then
a is the square of b and
b is a square root of a.

A number is a perfect square if b is a whole number.

In general, if a number a canbe expressed as a = b',

then
a is the cube of b and
b is a cube root ofa.

A number is a perfect cube if b is a whole number.

>"F EXAMPLE 4 i:,r:il:riil ;"; i{l -ia:l: Irr l i.-i-,l:l r.:i i;ir1r,:*rli.r ;:r:i-+r::,ri.:r-;s j

Find the HCF and the LCM of 4x3-v and l2x2y3 .

>*b SOLUTION
22 xxtxy
22x3xx'xy'
HCF=22 x.r'x y =4xty
LCM = 22 x 3 x.rt x y3 = 12xt)'

>:s EXAMPLE $ i,,,,.* :.r:'irl:i: r-,r:r::;ii:riir,'; :-r,ir',,]

(a) Use the divisibility test to determine if 4 is a factor of 349 630.
(b) What is the value of A if 349 63A is both divisible by 4 and 9?

>*b, SOLUTION
(a) The number formed by the last two digits, i.e. '30', is not divisible
bv 4.
.'. 349 630 is not divisible by 4, i.e. 4 is not a factor.

(b) For 349 63A to be divisible by 4, the value of digit A is either 2

or 6.
In the divisibility test of 9, the sum of all the digits must be divisible
bv 9.
3+4+9+6+3+A=25+A
If A =2.25 + 2 = 27 (which is divisible by 9)
If A= 6,25 + 6= 31 (which is not divisible by 9)
. A _a
..n-L

I*HAF]TEF] 1 N6
>ts EXAMPLE 6 i:-:i:1.!:ir'. i-:;i:iii:i:;.:i-i;; *; ili-.;ilj
A rectangular piece of aluminium sheet measuring 450 cm by 350 cm is
cut into identical small squares such that no material is left or wasted. Find
(i) the largest possible length of the side of each small square,
(ii) the number of small squares cut out.

SOLUTION

HCF=5x10
=50
The length of the side of each small square is 50 cm.

450 x 350
(ii) ,0 r 50 =9 x7
=63
The number of small squares cut out is 63.

>b EXAMPLET i:'*i*liiir *;:piir,itii*i: r:l L,f,lJl

Three types of colour markings, done on lamp posts, are found at 15 m,
20 m and 30 m intervals respectively along a straight road. At the beginning
of the straight road, all three colour markings are on the same lamp post.
(i) At what distance from the beginning of the straight road will
the three colour markings next appear on a lamp post again?
(iD If the straight road is half a kilometre long, how many times do
all the three colour markings appear on a lamp post?

SOLUTION
15= 3x5
20=22 x5
30=2 x3x5
LCM=22x3x5=60
The three colour markings will next appear 60 m from the beginning
of the road.

(ii) I##= 11
The three colour markings appear on a lamp post 8 times.

t]7 . CHAF]TER 1 iff ii:i::j .-:\i--, i..1: I:.- i":::;, l:r';r: