HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes

UPSC Prelims Paper 2 CSAT - Quant, Verbal & Decision Making

Quant : HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes

The document HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes is a part of the Quant Course UPSC Prelims Paper 2 CSAT - Quant, Verbal & Decision Making.
All you need of Quant at this link: Quant

HCF & LCM

 

Highest Common Factor

Every number has some factors but if two or more numbers taken together can have one or more common
factors. Out of those common factors the greatest among them will be the highest common divisor or highest
common factor of those numbers. Such as 12 and 18 have 1, 2, 3 and 6 as common factors but among them
6 is the highest common factor. So H.C.F. of 12 and 18 is 6.


Least Common Multiple

When we write the multiples of any two or more numbers taken together, we find that they have some
common multiples. Out of those common multiples the smallest among them will be the least common
multiple of those numbers. Such as 12 and 18 have 36, 72, 108, 144….. as common multiples but 36 is the
least among them. So L.C.M. of 12 and 18 is 36.


Methods of finding L.C.M

(a) 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.
Methods of finding H.C.F

 

Methods of finding H.C.F

(a) 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.

(b) 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.1 Find the L.C.M of 2, 4, 6, 8, 10.

 Sol. Write the numbers as the product of primes.
 2, 22, 2× 3, 23, 2× 5

Take the highest powers of all the primes. i.e., 23 × 3 × 5 = 120.


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

Sol. For H.C.F, take the common prime factors. i.e., 2. (This is only the prime factor common in all the
numbers).

Funda

i) Product of two numbers = L.C.M. × H.C.F.

ii) Product of n numbers = L.C.M of n numbers × Product of the HCF of each possible pair

Or

If the HCF of all the possible pairs taken is same then we will have

Product of n numbers = L.C.M of n numbers × (H.C.F of each pair)(n – 1)

iii) If ratio of numbers is a : b and H is the HCF of the numbers Then
LCM of the numbers = H × a × b = HCF × Product of the ratios.

vi) H.C.F of fractions =  HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes

vii) L.C.M. of fractions = HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes

viii) If HCF (a, b) = H1 and HCF (c, d) = H2, then HCF (a, b, c, d) = HCF (H1, H2).

HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes

 

Important Results

HCF and LCM - Examples (with Solutions), Number Theory, Quantitative Reasoning | EduRev Notes


Ex.3 What is the greatest number which exactly divides 110, 154 and 242?

 Sol.
The required number is the HCF of 110, 154 & 242.
110 = 2 × 5 × 11
154 = 2 × 7 × 11
242 = 2 × 11 × 11
∴ HCF = 2 × 11 = 22

 

Ex.4 What is the greatest number, which when divides 3 consecutive odd numbers produces a
 remainder of 1.

Sol. If x, y, z be 3 consecutive odd numbers, then the required number will be the HCF of
x – 1, y – 1 and z – 1.

Since x-1, y-1 & z-1 are 3 consecutive even integers, their HCF will be 2. So answer is 2.

 

Ex.5 What is the highest 3 digit number, which is exactly divisible by 3, 5, 6 and 7?

Sol. The least no. which is exactly divisible by 3, 5, 6, & 7 is LCM (3, 5, 6, 7) = 210. So, all the multiples of
210 will be exactly divisible by 3, 5, 6 and 7. So, such greatest 3 digit number is 840. (210 × 4).


Ex.6 In a farewell party, some students are giving pose for photograph, If the students stand at 4
 students per row, 2 students will be left if they stand 5 per row, 3 will be left and if they stand 6
 per row 4 will be left. If the total number of students are greater than 100 and less than 150, how
 many students are there?

Sol. If ‘N’ is the number of students, it is clear from the question that if N is divided by 4, 5, and 6, it
produces a remainders of 2, 3, & 4 respectively. Since (4 – 2) = (5 – 3) = (6 – 4) = 2, the least possible
value of N is LCM (4, 5, 6) – 2 = 60 – 2, = 58.

But, 100 < N < 150. So, the next possible value is 58 + 60 = 118.


Ex.7 There are some students in the class. Mr.X brought 130 chocolates and distributed to the
 students equally, then he was left with some chocolates. Mr Y brought 170 chocolates and
 distributed equally to the students. He was also left with the same no of chocolates as MrX was
 left. Mr Z brought 250 chocolates, did the same thing and left with the same no of chocolates.
 What is the max possible no of students that were in the class?

Sol. The question can be stated as, what is the highest number, which divides 130, 170 and 250 gives the
same remainder, i.e. HCF ((170 −130),(250 −170),(250 −130)) .
I.e. HCF (40, 80, 120) = 40.

Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!

Dynamic Test

Content Category

Related Searches

pdf

,

Quantitative Reasoning | EduRev Notes

,

study material

,

shortcuts and tricks

,

past year papers

,

HCF and LCM - Examples (with Solutions)

,

Extra Questions

,

Number Theory

,

Objective type Questions

,

video lectures

,

MCQs

,

Previous Year Questions with Solutions

,

Sample Paper

,

Number Theory

,

HCF and LCM - Examples (with Solutions)

,

HCF and LCM - Examples (with Solutions)

,

Free

,

Quantitative Reasoning | EduRev Notes

,

ppt

,

Quantitative Reasoning | EduRev Notes

,

Exam

,

Number Theory

,

Summary

,

Viva Questions

,

Semester Notes

,

practice quizzes

,

mock tests for examination

,

Important questions

;