HCF & LCM

Facts / Formulae
 Find the greatest number that will exactly divide x,y,z
Req. no. = HCF of x,y and z
 Find the greatest number that will divide x,y and z leaving
reminders a,b and c respy
• Req. no.=HCF of (x-a), (y-b) and (z-c)
 Find the least number which is exactly divisible by x,y and z
• Req. no .=LCM of x,y and z
 Find the least number which when divided by x,y and z leaves the
reminders a,b and c
• Req. no.=(LCM of x,y and z)-K [if K=x-a=y-b=z-c]
 Find the least number which when divided by x,y and z leaves the
same reminder ‘r’ each case
• Req. no.=(LCM of x,y and z)+r
 Facts / Formulae
 Find the greatest number that will divide x,y an z leaving the same
reminder in each case
– Req.no.= HCF of (x-y), (y-z) and (z-x)
 Find the n-digit greatest number which when divided by x, y and z
(i) leaves no reminder (ii) leaves reminder K in each case
– LCM of x,y and z =L ---(1)
– L ) n-digit greatest no. (
Reminder =R
(i) Req no.=n-digit greatest no. – R
(ii) Req no.=(n-digit greatest no-R)+K
 Facts / Formulae
 Find the n-digit smallest number which when divided by x, y and z
(i) leaves no reminder (ii) leaves reminder K in each case
– LCM of x,y and z =L ---(1)
– L ) n-digit greatest no. (
Reminder =R
(i) Req no.=n-digit smallest no. +(L-R)
(ii) Req no.=(n-digit greatest no-R)+(L-R)+K
𝑥 𝑦 𝑚
 Find the HCF of , 𝑎𝑛𝑑
𝑎 𝑏 𝑛
𝐻𝐶𝐹 𝑜𝑓 𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝑠
• 𝐻𝐶𝐹 𝑜𝑓 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛𝑠 =
𝐿𝐶𝑀 𝑜𝑓 𝑑𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟𝑠
𝑥 𝑦 𝑚
 Find the LCM of 𝑎 , 𝑏 𝑎𝑛𝑑 𝑛
𝐿𝐶𝑀 𝑜𝑓 𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝑠
• 𝐿𝐶𝑀 𝑜𝑓 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛𝑠 =
𝐻𝐶𝐹 𝑜𝑓 𝑑𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟𝑠
 Facts / Formulae
 Find the HCF of decimal numbers
Step 1: find the HCF of given nos. without decimal point
Put the decimal point from right to left according to the max. decimal
places among the given nos.
 Find the LCM of decimal numbers
Step 1: find the LCM of given nos. without decimal point
Put the decimal point from right to left according to the min. decimal
places among the given nos.
 Problem
Find the greatest number that will exactly divide 200 and 320
 Problem
Find the greatest number that will exactly divide 200 and 320
Solution: HCF of 200 and 320
200)320(1
200
120)200(1
120
80)120(1
80
40)80(2
80
HCF of 200 and 300 is 40
 Problem
Find the greatest number that will exactly divide 148, 246 and 623
leaving reminders 4,6 and 11 respy.
 Problem
Find the greatest number that will exactly divide 148, 246 and 623
leaving reminders 4,6 and 11 respy.
Solution:

HCF of 144, 240 and 612

HCF of 144, 240 and 612 is 12

 Problem
Find the least number which when divided by 27,35, 45 and 49
leaves the reminder 6 in each case.
 Problem
Find the least number which when divided by 27,35, 45 and 49
leaves the reminder 6 in each case.
Solution:

(LCM of 27, 35, 45 and 49)+6

LCM of 27, 35, 45 and 49 is 6615

The required answer is 6621

 Problem
Find the least number which when divided by 36, 48 and 64 leaves
reminders 25, 37 and 53 respy.
 Problem
Find the least number which when divided by 36, 48 and 64 leaves
reminders 25, 37 and 53 respy.
Solution:
36-25=11=48-37=64-53=11
(LCM of 36, 48 and 64) -11

LCM of 36, 48 and 64 is 576

The required answer is 565

 Problem
Find the greatest possible length of a scale that can be used to
measure exactly the following lengths of cloth; 3m, 5m 10 cm and
12m 90 cm.
 Problem
Find the greatest possible length of a scale that can be used to
measure exactly the following lengths of cloth; 3m, 5m 10 cm and
12m 90 cm.
Solution:
The lengths of cloth to be measured are 300 cm, 510 cm and 1290
cm.
The required length of the scale is HCF of 300,510 and 1290

HCF of 300, 510 and 1290 is 30

The required length of the scale is 30 cm.

 Problem
Find the smallest number which when
(a) increased by 8 (or added by 8)
(b) Decreased by 8 (or subtracted by 8)
is exactly divisible by 15,21,30.
 Problem
Find the smallest number which when
(a) increased by 8 (or added by 8)
(b) Decreased by 8 (or subtracted by 8)
is exactly divisible by 15,21,30.
Solution:
(a)Required no. = (LCM of 15,21,30) -8
= 210-8 = 202
(b) Req no. = (LCM of 15,21, 30)+8
=210+8 = 218
 Problem
(a) Find the greatest number of 4 digits and
(b) Find the smallest number of 4 digits
Such that they are exactly divisible by 12,15, 20 and 35.
 Problem
(a) Find the greatest number of 4 digits and
(b) Find the smallest number of 4 digits
Such that they are exactly divisible by 12,15, 20 and 35.
Solution:
(a) LCM of 12,15,20 and 35 = 420
420)9999(23
9960
339
Req. no = 9999-339=9663
(a) LCM of 12,15,20 and 35 = 420
420)1000(2
840
160
Req. no = 1000+(420-160)=1260
THANK YOU