Level - 1

Exercise – 2
No. of Question: 25 Time : 10 Min

1. The H.C.F. of two numbers is 99 and their l.c.m. og lcls NksVh la[;k Kkr djks ftls 15] 27] 35
is 2772. The numbers are rFkk 42 ls foHkkftr djus ij izR;sd fLFkfr esa 7
nks la[;kvks dk e-l 99 rFkk y-l- 2772 gS rks oks 'ks"kQy izkIr gks
la[;k, gS (a) 1883 (b) 1897
(a) 198, 1386 (b) 297, 924 (c) 1987 (d) 2007
(c) 396, 693 (d) 693, 11088 6. The least number which when divided by 35,
2. The product of H.C.F. and L.C.M. of 18 and 16 is 45 and 55 leaves the remainder 18, 28 and 38
respectively is
18 rFkk 16 dk e-l- o y-l- dk xq.kuQy gSA
og lcls NksVh la[;k Kkr djks ftls 35] 45 rFkk
(a) 2 (b) 48 55 ls foHkkftr djus ij Øe'k% 18] 28 vkSj 38
(c) 144 (d) 288 'ks"kQy izkIr gks
3. If p is a prime number, then the L.C.M. of p and (a) 2468 (b) 3265
(p + 1) is:
(c) 3448 (d) 3482
;fn p ,d vHkkT; la[;k gS rks p o (p+1) dk y- 7. The product of two number is 12960 and their
l- gksxk\ HCF is 36. How many pairs such number can
p  p  1 be formal.
(a) p2 (b)
2 nks la[;kvksa dk xq.kuQy 12960 gS rFkk mudk e-
2
l-i- 36 gS rks ,slh la[;kvksa ds ;qXe cuk;s tkrs gSA
(c)  p  1 (d) p  p  1 
(a) 3 (b) 4
4. The product of two 2-digit numbers is 2028
(c) 5 (d) 2
and their GCM is 13. The numbers are:
8. The HCF of two numbers is 12 and their
nks 2&vadh; la[;kvksa dk xq.kuQy 2028 gS rFkk
difference is 12. The numbers are :
mudk e-l- 13 gS rks oks la[;k, gS&
nks la[;kvksa dk e-l-i- 12 gS rFkk mudk vUrj 12
(a) 49,62 (b) 39,52
gS rks oks la[;k,s gSA
(c) 20,28 (d) 36,63
(a) 66, 78 (b) 70, 82

(c) 94, 106 (d) 84, 96

5. The least number which when divided by 15,
9. Five bells begin to toll together and toll
27, 35 and 42 leaves in each case a remainder
respectively at intervals of 6, 7, 8, 9 and 12
7, is
seconds. How many times they will toll
 together in one hour, excluding the one at the 14. 21 mango trees, 42 apple trees and 56 orange
start? trees have to be planted in rows such that each
row contains the same number of trees of one
ikWp ?kafV;k¡ ,d lkFk ctuk izkajHk djrh gS oks lHkh
variety only. Minimum number of rows in
Øe’k% 6] 7] 8] 9 rFkk 12 lSd.M ds vUrjky ij
which the above trees may be planted is
ctrh gS rks os ,d ?kaVs esa fdruh ckj ,d lkFk
ctsxh ¼izFke fLFkfr dks lfEefyr ugh djds½ 21 vke ds isM] 42 lsc ds isM rFkk 56 ukajxh ds
isM dks iafDr;ks esa bl rjg yxkuk gS fd izR;sd
(a) 3 (b) 5
iafDr esa leku la[;k es leku izdkj ds isM gks rks
(c) 7 (d) 9 de ls de ifDr;ks dh la[;k Kkr djks
10. The least number of square tiles required to (a) 3 (b) 15
pave the ceiling of a room 15 m 17 cm long and
(c) 17 (d) 20
9 m -2 cm broad, is:
15. About the number of pairs which have 16 as
,d dejs dh Nr ftldk vkdkj yEckbZ 15 ehVj
their H.C.F. and 136 as their L.C.M., we can
17 lseh rFkk pkSMkbZ 9 eh- 2 lseh- gS dks <dus ds
definitely say that
fy, vko';d oxkZdkj VkbZyksa dh U;wure la[;k gSA
la[;kvksa dk ;qXe ftudk e-l- 16 rFkk mudk y-l-
(a) 902 (b) 656
136 gS rks ge dg ldrs gS fd
(c) 738 (d) 814
(a) only one such pair exists/ ,slk ,d ;qXe gS
11. The sum of two numbers is 216 and their HCF
(b) only two such pairs exist/ ,sls nks ;qXe gS
is 27. The numbers are:

nks la[;kvksa dk ;ksxQy 216 rFkk mudk e-l-i- 27 (c) Many such pairs exist/ dbZ ;qXe gS
gS rks oks la[;k, gSA (d) No such pair exists/ dksbZ ;qXe ugha gS
(a) 27, 189 (b) 154, 162 16. How many pairs of numbers exist such that
(c) 108, 108 (d) 81, 189 their HCF is 4 & LCM is 48?

12. The product of two numbers is 1600 and their Lak[;kvksa ds ,sls fdrus tksM+s gS ftudk e-l-i- 4 o
H.C.F. is 5. The L.C.M. of the numbers is y-l-i- 48 gSA

nks la[;kvks dk xq.kuQy 1600 rFkk mudk e-l- 5 (a) 2 (b) 4

gS rks la[;kvksa dk y-l- gS (c) 0 (d) 1
(a) 8000 (b) 1600 17. If the HCF of two numbers is 2 and their LCM is
(c) 320 (d) 1605 70, then the numbers are : (CDS 1991)

13. The product of two two-digit numbers is 2160 ;fn nks la[;kvksa dk e-l-i- 2 gS rFkk mudk y-l-
and their G.C.M. is 12. The numbers are i- 70 gS rks oks la[;k,s gSA

nks vadh; nks la[;kvks dk xq.kuQy 2160 gS rFkk (a) 2, 35 (b) 6, 70

mudk e-l- 12 gS rks os la[;k, gSA (c) 4, 70 (d) 14, 10
(a) 72, 30 (b) 36, 60 18. How many pairs of two digit numbers exists
(c) 96, 25 (d) None such that their HCF is 8 & LCM is 120?
 nks vadks dh la[;k ds ,sls fdrus tksMs gS ftudk e- 23. Find the largest 3 digit number which when
l-i- 8 o y-l-l- 120 gSA divided by 5 or 8 it leaves a remainder 4 in
each case.
(a) 3 (b) 4
cMh ls cMh 3 vadks dh la[;k ftls 5 o 8 ls Hkkx
(c) 2 (d) 1
nsus ij izR;sd fLFkfr esa 3 'ks"kQy nsrh gSA
(a) 469 (b) 478
19. If two numbers a and b are in the ratio of 6 : 7
(c) 964 (d) 963
and their LCM is 168 then find their HCF.

;fn nks a la[;k b vkSj 6 % 7 ds vuqikr esa gS

mudk y-l-i- 168 gS rks mudk e-l-i- gksxkA 24. Find the largest 3 digit number that gives 3
and 6 when divided by 5 and 8 respectively.
(a) 5 (b) 4

(c) 6 (d) 8
3 vadks dh cMh ls cMh la[;k ftls 5 o 8 ls Hkkx
nsus ij Øe’k% 3 o 6 'ks"kQy nsrh gSA
20. Find the largest 3 digit numbers that gives (a) 899 (b) 978
remainder 3 when divided by 5 or 8.
(c) 799 (d) 998
3 vadks dh cMh ls cMh la[;k tks 5 ;k 8 ls Hkkx
nsus ij 3 'ks"kQy nsrh gSA
25. Find the smallest 4 digit number that when
(a) 693 (b) 396
divided by 3, 5 or 7 gives remainder 1, 3, and 5
(c) 963 (d) 936 respectively.

4 vadks dh NksVh ls NksVh la[;k ftls 3] 5] ;k 7

21. Find the smallest 3 digit number that gives ls Hkkx nsus ij Øe’k% 1] 3] o 5 'ks"kQy nsrh gSA
remainder 1 when divided by 2, 5, or 7. (a) 1480 (b) 1048
3 vadks dh NksVh ls NksVh la[;k tks 2] 5 ;k 7 ls (c) 1042 (d) 1408
Hkkx nsus ij 1 'ks"kQy nsrh gSA
(a) 141 (b) 151

(c) 171 (d) 142

22. Find the smallest number greater than 6 and 8

which when divided by 6 or 8 leaves a
remainder 3 in each case.

6 o 8 ls cMh og NksVh ls NksVh la[;k ftls 6 o

8 ls Hkkx nsus ij 3 'ks"kQy nsrh gSA
(a) 26 (b) 27

(c) 47 (d) 37
 360
LCM = pq × HCF ⟹ pq  10
36

Answer Key ∴ (p, q) can be (1,10), (2, 5). Hence, there can
1 a 2 d 3 d 4 b 5 b be two pairs.
6 c 7 d 8 d 9 c 10 d
11 a 12 c 13 b 14 c 15 d 8.(d) Let the numbers be ax and bx. HCF = x = 12
16 a 17 d 18 d 19 b 20 c Difference = (a – b)x = (a – b) 12 = 12 ⟹ (a –
21 a 22 b 23 c 24 d 25 b
12
b) = 1
12
SOLUTION ∴ 12a and 12b are the consecutive multiples of
12.

Alternate method : By choosing the given

1.(a) Clearly, HCF of 198, 13896 is 99.
options.
198  1386
And, their LCM =  2772. 9.(c) LCM of 6, 7, 8, 9, 12 is 504.
99
So, the bells will toll together after 504 sec.
So, the numbers are 198 & 1386.

2.(d) product of HCF & LCM = Product of given  60  60 

In 1 hour, they will toll together =  
numbers = 18 × 16 =288.  504 
times
3.(d) Since p is prime, so p & (p+1) are co-prime.
= 7 times
∴ HCF of p and (p+1) = 1.
10.(d) Size of largest square tile
their product p(P+1)
∴ LCM = = =p(p+1). = HCF of 1517 & 902 cm = 41 cm.
HCF 1

4.(b) HCF ×LCM = product of two numbers Least number of tiles required =
 1517  902 
2028  41  41   814.
∴ LCM =  156  
13
11.(a) HCF = x = 27.
Choose the options now which have HCF = 13
and LCM = 156 Sum = (a + b) x = ( a + b)27 =216

216
⟹ a+b = 8
27
5.(b) Required number = (LCM of 15, 27, 35, 42)+7=
1890+7m = 1897. ∴ (a, b) can be (1, 7), (2, 6) and (3, 5) But (2, 6)
is omitted because (2, 6) are not co – prime.
6.(c) Note that the difference between any divisor
and the corresponding remainder is the same, ∴ The numbers can be (27, 189) and (81, 135)
which is 17.

∴ Required number = (LCM of 35, 45, 550) – 17 Product 1600

= (3465-17) = 3448 12.(c) LCM = = =320.
HCF 5
Product of numbers 12960 13.(b) Let the numbers be 12a and 12b.
7.(d) LCM= = =360
HCF 36
 Then, 12a×12b = 2160 ⟹ab=15. So pair of a & b is 3 & 5 that will give numbers
as 24 & 40.
Values of co – prime a & b with product 15 are
(1, 15), (3, 5). If we take a & b as 1 & 15 then we will get the
numbers as 8 & 120 but here one of them 8 is
So, the two – digit numbers are 12×3 & 12 × 5
not a two digit number. Here only one such
i.e. 36 & 60 pair exists
14.(c) HCF of 21, 42, 56, = 7. 19.(b) Let the HCF of two numbers is x then two
Number of rows of mango trees, apple trees numbers are 6x and 7x then their LCM is 42x =
and orange trees are: 168 or x = 4.

21 42 56 20.(c) As per the given condition the number must be

 3, 6 &  8. (LCM of 5 and 8)k+3
7 7 7

∴ Required number of rows = (3+6+8)=17. So N = 40k+3)

15.(d) Since HCF of given numbers always divides the The largest 3 digit number in the form of 40k
LCM. i.e. 960.

So no such a pair of numbers exists which has Hence the largest 3 digit number that satisfy
16 as their HCF and 136 as their LCM. this condition = 960+3=963.

16.(a) Since HCF of two numbers 4. Hence we can 21.(a) The number that satisfies above condition
assume two numbers as 4a & 4b. (Here a and b must be in the form of
are co-prime to each other) k(LCM of 2, 5 and 7) +1
We know for two numbers: the number must be in the form of 70k + 1.
HCF × LCM = Product of two numbers Smallest 3 digit number will be 141.

Hence 4× 48=4a× 4b 22.(b) Any number or group of numbers that satisfies

the above condition can be given by
Or ab = 12 = 3× 22
k(LCM of 6 & 8) +3= 24k+3
Now in how many ways we can express 12 as a
product of two of its co-prime factors = 22- smallest number when k = 1
1=21=2.
smallest number is 27.
So total 2 pairs of numbers that satisfy the 23.(c) Any number or group of numbers that satisfies
above condition. the above condition can be given by
pairs are (4,48) and (16,12) K(LCM of 5 & 8) +4= 40k+4
17.(d) HCF of the two numbers is 2 ⟹ 2. Ab = 70 ⟹ When we divide largest 3 digit number 999 by
ab = 35 40 then we will get a remainder 39. So largest
This gives that a = 7 b = 5. Thus, the numbers 3 digit number that is divisible by 40 is is 999-
are 2a = 14 and 2b = 10. 39 = 960.

18.(d) Let numbers be 8a & 8b then 8a× 8b= 8× 120 So, largest 3 digit number in the form of
40k+4=964.
Or ab= 15
24.(d) Here in this case the difference between
divisor and remainder i.e. 5 – 3 = 8- 6 = 2, since
this difference is same.

So, The number must be in the form of

(LCM of 5 and 8)k-2=40k-2

The largest 3 digit number in the form of 40k –

2= 998.

25.(b) Here 3 – 1 = 5 – 3 =7 -5 = 2 that means the

difference between divisor and remainder is
same hence any such number that satisfies the
above condition must be in the form of

K (LCM of 3, 5 & 7) – 2, =105k – 2.

We need to find smallest 4 digit number in the

form of 105k-2. When smallest 4 digit number
that is 1000 divided by 105 we will get a
remainder 55 that means 1000-55=945 is
divisible by 105 but that is the largest 3 digit
number, and the next multiple of 105 is
smallest 4 digit number that is divisible by
105, hence smallest 4 digit number that is
divisible by 105 is 945+105=1050

Here in this case it is easy to visualize that

1050 is divisible by 105 so the required
number is 1050-2 = 1048.

6 Like Our FB Page : @neon.classes