Top Careers & You

_________________________________________________________________________________________________

Factors &

2
Multiples

L.C.M
Least Common Multiple (L.C.M) of numbers is defined as the least number, which
is exactly divisible by each one of the given numbers. Remember, L.C.M. is always
greater than or equal to the greatest of the given numbers. Also, there will be nos.
greater than the L.C.M. but it will be the lowest of them all.

H.C.F or G.C.D
Highest Common Factor or Greatest Common Divisor of two or more numbers
is the greatest number that divides each one of them exactly. H.C.F. denotes the
highest possible factor that will divide each of the other nos. in a group or in other
words there will be factors smaller than it, which will also divide the same set of
numbers. But H.C.F. will be the largest possible.

Methods of finding L.C.M

Methods of finding L.C.M
Factorisation Method:
Resolve each one of the given numbers into prime factors. Then the product of the
highest power of all the factors gives the L.C.M.

Find the L.C.M of 2, 4, 6, 8, 10.

Factorize all the numbers into their prime factors 2, 22, 2 × 3, 23, 2 × 5 and choose
the factors with highest power. Now, L.C.M. = 23 x 3 x 5 = 8 x 3 x 5 = 120. Again
recollect that there are other possibilities like 240, 360, 480, …or any other multiple
of 120 but LCM is the smallest.

Alternative (shortcut) Method

2 2-4-6-8-10
2 1-2-3-4-5
1-1-3-2-5

Now L.C.M = 2 x 2 x 3 x 2 x 5 = 120.

_________________________________________________________________________________________________
www.TCYonline.com Page : 1
 Top Careers & You
®

_________________________________________________________________________________________________

Methods of finding H.C.F

Factorisation method:
Express each number as the product of primes and take the product of the least
powers of common factors to get the H.C.F.

Ex. Find the H.C.F. of 2, 4, 6, 8, 10.

Factorise all the numbers into their prime factors 2, 22, 2 × 3, 23, 2 × 5 and choose
the common factors with lowest powers. ∴ H.C.F = 2. Remember that 1 is another
factor which divides all the given nos. but 2 is the largest possible in the given case.
In fact 1 will be a factor in all the cases but we are concerned with the largest
possible.

Division Method:
Divide the larger number by smaller one. Now divide the divisor by the remainder.
Repeat the process of dividing the preceding divisor by the remainder last obtained,
till the remainder zero is obtained. The last divisor is the required H.C.F.
Ex. Find the H.C.F of 24 and 36.
24) 36 (1
Always reduce
24
the fractions
12 ) 24 ( 2
into their 24
lowest or x ∴ H.C.F of the given numbers = 12.
simplest forms
before finding
their HCF or
LCM Toolkit

i) Product of two nos. = L.C.M. x H.C.F.

ii) Product of n nos. = L.C.M of n numbers. x (H.C.F. of each pair)n-1
iii) H.C.F. of given numbers always divides their L.C.M.
L.C.M. of Numerators.
iv) L.C.M. of a series of fractions =
H.C.F. of Denominators.
H.C.F. of Numerators.
V) H.C.F. of a series of fractions =
L.C.M. of Denominators.

Co-Prime Numbers
Two numbers are said to be co- prime if their H.C.F is 1 i.e. the divisor is 1 when
the remainder is 0.
e.g. (2, 3). These two numbers may or may not be always prime. e.g. (4, 9).

_________________________________________________________________________________________________
www.TCYonline.com Page : 2
 Top Careers & You
®

_________________________________________________________________________________________________

PRACTICAL APPLICATIONS OF L.C.M. & H.C.F.:

Ex. A bell tolls after every 2 s. A second bell tolls after every 3s, A third
every 4s, a fourth every 10s, when will all the bells toll together?
Sol. All the bells will toll together after the time, which is divisible by 2, 3, 4 and
10.
Therefore time must be equal to L.C.M of 2, 3, 4, 10.

2 2-3-4-10
2 1-3-2-5
1-3-1-5

∴ L.C.M. = 60 s.
Hence 4 bells will toll together after every 60s.

Ex. Find the greatest no that will divide 55, 127 & 175 so as to leave the
same remainder in each case. Do you know?
Sol. As 55, 127, 175 leave the same remainder when divided by certain number. When 2 or more
∴ Difference = 127 – 55, 175 – 127, 175 – 55 must be divisible by that numbers divided by a
number. certain number leave
∴ Greatest number = H.C.F. of (127 – 55), (175 – 127), (175 – 55) the same remainder
= HCF of 72, 48, 120
then the differences
By factorisation method:
of the given nos. are
72 = 23 × 32
always divisible by
48 = 24 × 3
that number.
120 = 23 × 3 × 5
HCF of 72, 48, 120 = 23 × 3 = 24.
Hence the greatest no that will divide 55, 127 & 175 leaving same remainder
= 24.

H.C.F. & L.C.M. of Decimals

In given numbers, make the same number of places of decimals by supplying zeros
in some numbers if necessary. Considering these numbers without decimal point,
find H.C.F. OR L.C.M. as the case may be. Now, in the result mark off as many
decimal places as there are in each of the numbers.

Ex. Find the H.C.F & L.C.M. of 1.8, 5.4 and 12.
Sol. Making the same place of decimals, the numbers may be written as 1.8, 5.4
and 12.0.
Without decimals they are 18, 54, 120.
H.C.F. of 18, 54, 120 is 6.
∴ H.C.F. of 1.8, 5.4 & 12 is 0.6.
Again L.C.M. of 18, 54 & 120 is 1080.
∴ L.C.M. of 1.8, 5.4, 12 is 108.0, i.e. 108.

_________________________________________________________________________________________________
www.TCYonline.com Page : 3
 Top Careers & You
®

_________________________________________________________________________________________________

IMPORTANT RESULTS
S.No. Type of Problem Approach of Problem
Find the GREATEST NUMBER that will Required number = H.C.F. of x, y, and z
1.
exactly divide x, y, z. (greatest divisor).
Find the GREATEST NUMBER that will divide Required number (greatest divisor)
2. x, y and z leaving remainders a, b and c = H.C.F. of (x – a), (y – b) and (z – c).
respectively.
Find the LEAST NUMBER which is exactly Required number = L.C.M. of x, y and
3.
divisible by x, y and z. z (least divided).
Then, it is always observed that
Find the LEAST NUMBER which when divided
(x – a) = (y – b) = (z – c) = K (say).
4. by x, y and z leaves the remainders a, b and c
∴ Required number
respectively.
= (L.C.M. of x, y and z) – (K).
Find the LEAST NUMBER which when divided Required number
5. by x, y and z leaves the same remainder ‘r’ = (L.C.M. of x, y and z) + r.
each case.
Find the GREATEST NUMBER that will divide Required number
6. x, y and z leaving the same remainder in each = H.C.F. of (x – y), (y – z) and (z – x).
case.
H.C.F of fractions
x a m
7. Find the H.C.F. of , and . H.C.F. of numerators
y b n = .
L.C.M. of deno min ators

L.C.M. of fractions
x a m
8. Find the L.C.M. of , and . L.C.M. of numerators
y b n = .
H.C.F. of deno min ators

Step 1: Find the H.C.F. of the given

numbers without decimal.
Step 2: Put the decimal point (in the
9. Find the H.C.F. of decimal numbers.
H.C.F. of Step 1) from right to left
according to the MAXIMUM decimal
places among the given numbers.
Step 1: Find the L.C.M. of the given
numbers without decimal.
Step 2: Put the decimal point (in the
10. Find the L.C.M. of decimal numbers.
L.C.M. of Step 1) from right to left at the
place equal to the MINIMUM decimal
places among the given numbers.

_________________________________________________________________________________________________
www.TCYonline.com Page : 4