LCM & HCF II

Numbers is one of the most important topics for CAT and other management entrance exams, questions
from which have appeared consistently and in significant numbers in all these exams.

Key concepts discussed:

HCF of two or more numbers is the greatest number which completely divides the numbers. In other
words, it is the greatest factor common to the numbers.
The largest number N, which divides the numbers n1, n2 and n3 (n1 > n2 > n3) and leaves a remainder
of r in each case is given by N = HCF {(n1 n2 ), (n2 n3 )} .

The largest number N, which divides the numbers n1, n2 and n3 and leaves remainders of r1, r2 and r3
respectively is given by N = HCF {(n1 r1 ),(n2 r2 ),(n3 r3 )} .

If there are three types of items such that number of items of first type is n1, that of second type is
n2 and that of third type is n3, then the minimum number of groups (N) in which these items can be
slotted such that all the groups have same number of items and each of the groups has only one
type of item N =

n1 + n2 + n3
n3
n1
n2
=
.
+
+
HCF (n1, n2 , n3 ) HCF (n1, n2 , n3 ) HCF (n1, n2 , n3 ) HCF (n1, n2 , n3 )

The LCM of two or more numbers is the least number which is divisible by all the numbers.

If N = ap bq c r .... is a natural number such that N = LCM (x, y), then the number of distinct
pairs (P) of x and y is given by P =

(2p + 1)(2q + 1)(2r + 1)... + 1

.
2

LCM and HCF of fractions

a c e LCM (a, c, e)
LCM , , =
;
b d f HCF (b, d, f )
a c e HCF (a, c, e)
a c
e
HCF , , =
, where , and are the fractions in simplest form.
b d
f
b d f LCM (b, d, f )

LCM (N1, N2) HCF (N1, N2) = N1 N2

The above relation is true for more than two numbers if and only if each of numbers is co-prime to
rest of the numbers i.e. HCF of any two numbers is 1. Note that, if the HCF of a set of numbers is
equal to 1, the above relation is not necessarily valid.

HCF N1 + N2 , LCM (N1, N2 ) = HCF (N1, N2)

Session

Numbers

The number N, which when divided by n1, n2 and n3 leaves the same remainder of r in each case, is
given by N = k LCM(n1, n2 , n3 ) + r , where k is a whole number.

The number N, which when divided by n1, n2 and n3 leaves remainders of r1, r2 and r3 respectively such
that n1 r1 = n2 r2 = n3 r3 = d, is given by N = k LCM(n1, n2 , n3 ) d, where k is a natural number.

The number N, which when divided n1 and n2 leaves remainders of r1 and r2 such that r1 r2 and

n1 r1 n2 r2 , is given by N = k LCM(n1, n2 ) + NL , where k is a whole number and NL is the

smallest number which satisfies the aforementioned conditions.

Three bells B1, B2 and B3 chime at regular intervals of T1, T2 and T3 min respectively. These bells
chime for c1, c2 and c3 min respectively. If all the bells start chiming together, then the time interval
(I) between two successive occasions when they start chiming together again is given by
I = LCM (T1 + c1, T2 + c2, T3 + c3) min. If the bells chime for negligible amounts of time, then
I = LCM (T1, T2, T3) min.

Highlight: This session deals with application based questions of LCM & HCF which are of moderate
difficulty level.

Numbers

Session

The questions discussed in the session are given below along with their source.
Q1.

Number of students who have opted for subjects A, B and C are 60, 84 and 108 respectively. The
examination is to be conducted for these students such that only the students of the same subject
are allowed in one room. Also the number of students in each room must be same. What is the
minimum number of rooms that should be arranged to meet all these conditions?
(a) 28
(b) 60
(c) 12
(d) 21
(CAT 1998)

Q2.

A red light flashes three times per minute and a green light flashes five times in 2 min at regular
intervals. If both lights start flashing at the same time, how many times do they flash together in
each hour?
(a) 30
(b) 24
(c) 20
(d) 60
(CAT 2001)

DIRECTION for Question 3: The question is followed by two statements, I and II. Mark the answer as:
(a)
if the question can be answered with the help of statement I alone.
(b)
if the question can be answered with the help of statement II alone.
(c)
if both statement I and statement II are needed to answer the question.
(d)
if the question cannot be answered even with the help of both the statements.
Q3.

What is the number x?

I. The LCM of x and 18 is 36.
II. The HCF of x and 18 is 2.

(CAT 1995)

Q4.

21 mango trees, 42 apple trees and 56 orange trees have to be planted in rows such that each row
contains the same number of trees of one variety only. Minimum number of rows in which the trees
may be planted is:
(a) 20
(b) 17
(c) 15
(d) 4
(FMS 2005)

Q5.

Three Vice Presidents (VP) regularly visit the plant on different days. Due to labour unrest, VP (HR)
regularly visits the plant after a gap of 2 days. VP (Operations) regularly visits the plant after a gap
of 3 days. VP (Sales) regularly visits the plant after a gap of 5 days. The VPs do not deviate from
their individual schedules. CEO of the company meets the VPs when all the three VPs come to the
plant together. CEO is on leave from January 5th to January 28th, 2012. Last time CEO met the VPs
on January 3, 2012. When is the next time CEO will meet all the VPs?
(a) February 6, 2012
(b) February 7, 2012
(c) February 8, 2012
(d) February 9, 2012
(e) None of the above
(XAT 2012)

Q6.

At a bookstore, MODERN BOOK STORE is flashed using neon lights. The words are individually

5 17
41
s,
s and
s respectively, and each word is put off after a second.
2
4
8
The least time after which the full name of the bookstore can be read again is
(a) 49.5 s
(b) 73.5 s
(c) 1744.5 s
(d) 855 s
(CAT 2002)
flashed at the intervals of

Session

Numbers