Vous êtes sur la page 1sur 5

LCM/HCF

Factors: Factors of a number are the numbers which will divide the given number exactly without
leaving any reminders.
Eg) Factors of 6 are 1, 2, 3, 6
Multiples: Multiple of a number are generated by multiplying other integers with the given number.
Eg) multiples of 6 are 6, 12,18,24 etc.
LEAST COMMON MULTIPLE(LCM)
The least common multiple of two numbers is the lowest number that is a multiple of both the
numbers.
Patterns of LCM/HCF
1. LCM: Division Method
Step:1 Given numbers are written in a line separated by comma.
Step 2 Divide by any one of the prime numbers 2,3,5,7,11, which will divide at least any two numbers
exactly. The quotient and the undivided numbers are written in a line below the first .
Step 3: ( step 2) is repeated until a line of numbers ( prime to each other) appears.
Step 4: Find the product of all divisors and numbers in the last line which is required LCM.
HIGHEST COMMON FACTOR:
HCF of two or more numbers is the greatest number that divides each one of them exactly.
2.HCF: Continuous Division Method until the reminder comes zero:
Step 1: Greater number is divided by the smaller one.
Step 2: Divisor of (1) is divided by the reminder.
Step 3: Divisor of (2) is divided by its reminder. This is continued until no reminder is left.
3.LCM/HCF of Fractions:
LCM of fractions = LCM of numerators / HCF of denominators.
HCF of fractions = HCF of numerators / LCM of denominators.
4.Product of two numbers:
Product of two numbers = LCM * HCF


5.Applications of LCM & HCF:
S.No Patterns Methods
1. Find the greatest number that will exactly
divide a,b,c
HCF (a,b,c)
2. Find the greatest number that will divide
a,b,c leaving reminders of x,y,z.
HCF (a-x, b-y , c-z)
3. Find the greatest number which when id divides
a,b,c will leave the same reminder in each case
If reminder value is not given
Then HCF (a-b, b-c, c-a).
If reminder value is given
HCF( a-r,b-r,c-r)
4. Find the least number which is exactly divisible
by a,b,c
LCM of(a,b,c)
5 Find the least number which when divided by
a,b,c leaves the same reminder r in each case
LCM (a,b,c)=r
6 Find the least number which when divided by
a,b,c leaves the reminders x,y,z
It is a-x=b-y=c-z=K(say), then
LCM(a,b,c) - K

6. To find n- digit greatest number which when divided by x,y,z
a) Leaves no reminder
1. LCM of x,y,z = L
2. L divideds n digit greatest number , find reminder
3. Req no= n digit greastest number - R
b) Leaves reminder K in each case . Req no=(n digit greatest number R)+ K
7. To find the n digit smallest number which when divided by x,y,z
a) Leaves no reminder
1. LCM of x,y,z = L
2. L divideds n digit Smallest number , find reminder
3. Req no= n digit Smallest number +(L R)
b) Leaves reminder K in each case . Req no=(n digit Smallest number + (L R)+ K)



1. Find the LCM of 12,27,40
a) 1880 b)1080 c) 1750 d) none
Solution: 2 12, 27, 40
2 6, 27, 20
3 3, 27, 10
1, 9, 10

LCM= 2x2x3x9x10 = 1080.
2. Find the HCF of 777 and 1147
a) 47 b) 49 c)37 d)59
777)1147(1
777
370)777(2
740
37)370(10
370
0
Therefore HCF= 37
3.Find the LCM of 1/3, 5/6, 5/9, 10/27?
a) 3/4 b) 10/3 c) 60/3 d) 7/5
solution: option b: 10/3
In the above LCM of Nrs 1,5,5,10 is 10.
HCF of Drs 3,6,9,27 is 3.
Hence answer is 10/3
4)Find the HCF of 1/2, 3/4,5/6,7/8,9/10?
a) 2/127 b) 1/120 c) 3/130 d)none
Solution: Option b: 1/120
In the above, HCF of Nrs is 1 and LCM of Drs is 120.
Hence answer is 1/120.
5)LCM of two number is 2310. Its HCF is 30. If one number is 210 find the other number?
a) 40 b)60 c)30 d)50
solution: option c:30
Second number= (2310*30)/210
Hence answer= 30
6) LCM of two numbers is 495 and their HCF is 5. IF the sum of the two numbers is 100, then difference
is? A) 20 b) 10 c)30 d)50
Solution: Option b: 10
Since LCM*HCF= Product of two nos
495*5= x(100-x) x
2
-100x+2475=0 Hence x=45 and 55
Difference is 10
7) Find the least number which when divided by 5,6,7,8 gives the reminder 3 but is divisible by 9?
a) 1782 b)1683 c)1825 d)none
Solution: Option b: 1683
LCM = 840 , hence rem no= 840x +3 which is exactly divisible by 9. If x=2 req no= 840*2 +3=1683

8)The smallest positive number x, which leaves a reminder 1 when divided by 2,3,4 and 5?
a) 71 b)11 c)7 d)61
Solution: option d:61
LCM= 60, Hence small no is 60+1=61.

9)Find the greatest number of five digits which when divided by 8,9 and 10 leaves 3 as reminder in each
case? A) 99620 b)99825 c)99723 d)99743
Solution: option c: 99723
LCM = 360
Greatest 5 digit number is 99999. Divide 99999/360 .
Rem = 99720 hence required no= 99720+3 = 99723

10) Find the greatest number of 4 digits which is exactly divisible by 24, 28, 30, and 35?
a) 9720 b)9240 c)9840 d)9540
Solution: option b: 9240
LCM= 840 Rem = 759
Req no = 9999-759=9240

11) Find the greatest number of Four digits which must be added 5231 so that the final number becomes
exactly divisible by 12,15,27,32,40?
a) 7729 b)8720 c)9782 d)8569
Solution: option a: 7729
LCM of 12,15,27,32,40 is 4320.
9999+5231= 15230; 15230/4320 rem =2270
Hence 9999-759= 7729
PROBLEMS BASED ON BELLS
12) Six bells commence tolling together and tolls at intervals of 2s,4s,6s,8s,10s,12s. In 30 min, how
many times do they toll together?
a) 16 b)15 c)20 21
Solution: Option a: 16
LCM = 120
Total no of times = (30x60)/120 = 15. Hence 15+1= 16
13)The three traffic lights at three different road crossing change after every 48s,72s and 108s. If they all
change simultaneously at 8.20 h, Then they will again change simultaneously at?
a) 8 h 27 min b 9 h 25 m 16s c)8. 27h 12 sec d) 5.27hr 12 sec
Solution: Option c: 8h 27min 12 sec
LCM= 432s, hence 8.20+ 7 min+12 sec = 8.27 h and 12 sec

14) Three rings complete 60,36 and 24 revolutions in a minute.. They start from a certain point in their
circumference downwards. By what time , they come together again in same position?
a) 10s b)15s c)5s d)25s
Solution: option c: 5s
Time taken by each ring = 60/60,60/36,60/24 is 1,5/3,5/2 sec
LCM (1,1/5,5/2) = 5 sec