Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
21 views3 pages

Number System-4 Solution

The document discusses various mathematical problems related to number systems, focusing on concepts like HCF, LCM, and perfect squares. It provides step-by-step solutions to problems involving calculations of HCF and LCM, as well as determining necessary adjustments to achieve specific numerical properties. The document is structured as a series of problems and solutions, demonstrating the application of number theory principles.

Uploaded by

pushkargupta183
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views3 pages

Number System-4 Solution

The document discusses various mathematical problems related to number systems, focusing on concepts like HCF, LCM, and perfect squares. It provides step-by-step solutions to problems involving calculations of HCF and LCM, as well as determining necessary adjustments to achieve specific numerical properties. The document is structured as a series of problems and solutions, demonstrating the application of number theory principles.

Uploaded by

pushkargupta183
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Number System - 4 But it is not a perfect square

120 = 23  31  51
1. (a) So, it should be multiplied by (2  3  5) to become a
a  b = HCF (a, b)  LCM (a, b) perfect square
210  b = 30  2310 So, required value = 120  30 = 3600
Alternate Method:
30 × 2310 Use options & check which value is divisible by the given
b= = 330
210 numbers and is a perfect square.
2. (b) 8. (b)
Let HCF = x LCM of (8, 11, 24) = 264
So, LCM= 12x Required number = 264 – 5 = 259
Sum = 403 9. (b)
x + 12x = 403 LCM of (7, 12 & 16) is 336
13x = 403 Now, 1856 when divided by 336, the remainder is 176
x = 31 So, 336 – 176 i.e. 160 must be added to 1856 to make it
So, HCF = 31 & LCM = 12  31 = 372 divisible by 336
Now, a  b = HCF (a, b)  LCM (a, b) 10. (c)
93  b = 31  372 LCM of (5, 8, 12, 16, 20) = 240
least sin digit number (which is a multiple of 240) = 100080
31 × 372 To get remainder 3, 100080 + 3 = 100083
b= = 124
93 11. (d)
3. (a) HCF of (191– 4, 216– 7, 266– 13) = HCF of (187, 209, 243)= 11
LCM of (9, 12, 18) = 180 12. (a)
So, they will to 11 after 180 minutes or 3 hours Difference = 1110 – 864 = 246
So, Time is 8 + 3 = 11 AM The number should be a factor of 246
4. (a)
HCF of (403, 465 & 496) = 31 Type -1
So, capacity of each bottle = 31 1.1. (b)
Now, number of bottles required LCM should always be the multiple of HCF because HCF is
406 465 496 contained in LCM.
= + + Or we can say that HCF should always be the factor of LCM.
31 31 31
Here, 35 is not the factor of 120
= 13 + 15 + 16 = 44 1.2. (c)
5. (c) HCF of all the four numbers is the HCF of 48 & 36 i.e. 12
The size of the largest possible square slab should be the
1.3. (c)
HCF of the dimensions.
LCM (a, b)  HCF (a, b) = a  b
HCF (250 & 150) = 50
So, slab size should be 50  50  b = 35
Difference = 35 – 21 = 14
250 × 150 1.4. (c)
Number of slabs required = = 5 × 3 = 15
50 × 50 LCM (a, b) = 576 = 26  32
6. (b)
a = 22  32
Let the numbers be 6x & 6y where x & y are coprime to each
other. for LCM = 576, min value of b = 26 = 64
6x + 6y = 60 1.5. (b)
x + y = 10 HCF + LCM = 1150
Now, we have to find the pairs of the values of x & y which LCM = 45 HCF
are coprime to each other.  46 HCF = 1150
Possible pairs are (1, 10) & (3, 7)
 HCF = 25
So, only two set of numbers exists.
and LCM = 1125
Pair Number Now,
(1, 10) 6, 60 (6  1, 6  10) HCF (a, b)  LCM (a, b) = a  b
(3, 7) 18, 42 (6  3, 6  7)
25  1125 = 125  b
7. (d)  b = 225
LCM of (3, 4, 5, 6, 8) = 120 1.6. (a)
HCF = 11

1
LCM = 385 = 5  7  11 X=?
11 is common to both the numbers. So, the number between LCM  2424  272  324
75 and 125  11  7 = 77.
1.7. (d) X must contain 324 and contain anything from 20 to 272
m  n = 6  210 1.15. (d)
m + n = 72 X` 23  32
1 1 m+n 72 2
Now, + = = = Y  2a  3b
m n mn 6 × 210 35
LCM  23  33
1.8. (d)
HCF = x a  can be anything from 0 to 3  4 values
LCM= 20x b  should be 3  1 value.
LCM + HCF = 2520 1.16. (c)
20x + x = 2520 66 = 26  36
21x = 2520 88 = 224
x = 120 LCM = 224  312
So, HCF = 120 & LCM = 20  120 = 2400 The third number should contain 312. Also in the third num-
Now, a  b = HCF (a, b)  LCM (a, b) ber the power of 2 can vary from 0 to 24.
480  b = 120  2400 So, 25 values for the third number are possible.
120 × 2400 (312  20, 312  21, 312  22, ......... 312  224)
b= 1.17. (b)
480
Need to check only prime numbers from 101 to 105, which
b = 600 are 101 and 103.
Required value = 3b = 3(600) = 1800 So, LCM (1 to 105) = 101  103  N = 10403 N
1.9. (b) 1.18. (b)
 2 4 4  HCF  2, 4, 4  2 1 Let the numbers be 6x & 6y such that x & y are coprime to
HCF  , ,     each other
 3 8 5  LCM 3, 8, 5  120 60
6x  6y = 432
1.10. (a) xy = 12
Possible pairs are (1  12) & (3  4)
 2 6 4  LCM  2, 6, 4  12
LCM  , ,     12 So, two pairs of numbers exists.
 3 5 7  HCF  3, 5, 7  1 1.19. (b)
1.11. (d) Let numbers be 6a and 6b with a, b being co-prime.
4
1200 = 2  3  5 1 2 6a × 6b = 6 × 216
Ratio is 3 : 4 : 5 Possible pairs = (1, 36)/(4, 9)
4 2
To get 2 and 5 in LCM we need to multiply each term by 2 2 Only two pairs are possible.
and 5. So, the numbers will be 60, 80 and 120. 1.20. (a)
Hence, the HCF is 20. LCM of (30 & 31) = 930 (15 min 30 seconds)
1.12. (c) They will beap after 15 min and 30 seconds.
3
3240 = 2  3  5 4 1 1.21. (c)
4
3600 = 2  3  5 2 2 LCM of (9, 6, 4, 10 & 8) = 360 sec or 6 minutes
2
HCF = 2  3 2 They will toll after every 6 minutes.
4 5 2 2
LCM = 2  3  5  7 60
The third number should contain 72  35 and it should also In 1 hrs. or 60 minutes, they will toll = = 10 times.
6
contain the HCF i.e. 22  32
So, third number is 22  35  72 1.22. (c)
Alternate Method: LCM of (42, 56 & 63) = 504
Use options. They all will came at the starting point after 504 seconds.
1.13. (a) 1.23. (a)
161 = 7  23 60
Numver are 7 and 23. Hence x = 23, y = 7 and remainder 2. Time interval for red light = = 20 sec.
3
1.14. (a)
120
1212  224  312 Time interval for green light = = 24 sec.
9 72
5
256  2 LCM of (20 & 24) = 120 sec. i.e. 2 mins.

2
So, the two lights will flash together after every 2 min. Alternate Method:
Use options.
60
In an hour they will flash i.e. 30 times 1.30. (c)
2 Samllest number divisible by 12, 18, 21 & 28 is 252
1.24. (c) Now 9999 when divided by 252 the remainder is 171
60 36 24 So, the required number is 9999 – 171 i.e. 9828
Time for one revolution = sec., sec., sec. Alternate Method:
60 60 60
Use options & check.
3 2 1.31. (c)
= 1, ,
5 5 LCM (4, 6, 10, 15) = 60
Time of red dot coming at same time Least number of sin digits divisible by 60 = 10020
To get remainder 2  1--20 + 2 = 10022
 3 2 6
= LCM  1, ,  = = 6 seconds 1.32. (a)
 5 5 1 HCF (254 – 6, 479 – 14, 354 – 13)
1.25. (c) = HCF (248, 465, 341)
LCM of (10, 15 & 18) = 180 = 31
180 = 22  32  51 1.33. (d)
To draw up the soldiers in the farm of a solid square, the LCM (7, 12, 16) = 336
total number of soldiers should be a perfect square. Multiple of 336 closest to 1852 is 1680
(K  K = K2) So, 1852 – 1689  172 is to be substracted.
Now, in perfect square the power of prime base should be 1.34. (c)
even. LCM of (6, 9 & 12) = 36
So, it should be multiplied by 5, so that the power of 5 So the number will be of the form 36K + 3
becomes even. 999 when divided by 36, the remainder is 27
Number of soldiers = (22  32  51)  51 So, the required number = 999 – 27 + 3
= 22  32  52 = 975
= 900 Alternate Method:
1.26. (d) Use options & check.
2002 = 2  7  11  13 1.35. (c)
1820 = 2  2  5  13  7 LCM of (4, 5, 6, 7) is 420
The H.C.F of 2002 and 1820 is 2  7  13 = 182 Negative remainder = – 2
So, maximum number of students will be 182. So the number should be of the from 420K – 2
1.27. (a) 10000 when divided by 420, the remainder is 340.
HCF of (96, 240, 336) = 48 So, the required number = 10000 + 420 – 340 – 2
So, number of books in each stock = 48 = 10078
336 240 96 Alternate Method:
Total number of stocks = + + Use options & check.
48 48 48
1.36. (b)
=7+5+2 LCM (2, 3, 4, 5, 6) – 1 = 60 – 1 = 59
= 14 Next number will be = 59 + 60 = 119
1.28. (d) So, there is only number in set A = 59
 9 27 36  HCF  9, 27, 36  9 1.37. (d)
HCF  , ,   lbs Difference = 34041 – 32506 = 1535
 2 4 5  LCM 2, 4, 5  20
The number shall be a factor of 1535, given is 307.
Number of peices = no. of guests entertained 1.38. (a)
9 2 27 4 26 5 Difference = (1805 – 1475) and (1475 – 705)
    330 and 770
9 20 9 20 9 20
HCF (330 and 770) = 110
9  20 27  20 36  20
  
2 9 4 9 5 9
= 10 + 15 + 16 = 41
1.29. (c)
HCF of (210, 315, 147 & 168) is 21
So, the largest number that divides the given number is 21.

You might also like