CHP 1
CHP 1
______________________________________________________________________________
Exercise - 1A
2. A number when divided by 61 gives 27 as quotient and 32 as remainder. Find the number.
Sol:
We know, Dividend = Divisor × Quotient + Remainder
Given: Divisor = 61, Quotient = 27, Remainder = 32
Let the Dividend be x.
∴ x = 61 × 27 + 32
= 1679
Hence, the required number is 1679.
(ii)
504 ) 1188 ( 2
- 1008
180 ) 504 ( 2
- 360
144 ) 180 ( 1
- 144
36 ) 144 ( 4
- 144
0
On applying Euclid’s algorithm, i.e. dividing 1188 by 504, we get:
Quotient = 2, Remainder = 180
∴ 1188 = 504 × 2 + 180
Again on applying Euclid’s algorithm, i.e. dividing 504 by 180, we get:
Quotient = 2, Remainder = 144
∴ 504 = 180 × 2 + 144
Again on applying Euclid’s algorithm, i.e. dividing 180 by 144, we get:
Quotient = 1, Remainder = 36
∴ 180 = 144 × 1 + 36
Again on applying Euclid’s algorithm, i.e. dividing 144 by 36, we get:
∴ 144 = 36 × 4 + 0
Hence, the HCF of 1188 and 504 is 36.
(iii)
960 ) 1575 (1
- 960
615) 960 (1
- 615
345) 615 (1
- 345
270 ) 345 (1
- 270
75 ) 270 (3
- 225
45 ) 75 (1
- 45
30) 45 (1
- 30
15 ) 30 (2
- 30
0
On applying Euclid’s algorithm, i.e. dividing 1575 by 960, we get:
Quotient = 1, Remainder = 615
∴ 1575 = 960 × 1 + 615
Again on applying Euclid’s algorithm, i.e. dividing 960 by 615, we get:
Quotient = 1, Remainder = 345
∴ 960 = 615 × 1 + 345
Again on applying Euclid’s algorithm, i.e. dividing 615 by 345, we get:
Quotient = 1, Remainder = 270
∴ 615 = 345 × 1 + 270
Again on applying Euclid’s algorithm, i.e. dividing 345 by 270, we get:
Quotient = 1, Remainder = 75
∴ 345 = 270 × 1 + 75
Again on applying Euclid’s algorithm, i.e. dividing 270 by 75, we get:
Quotient = 3, Remainder = 45
∴ 270 = 75 × 3 + 45
Again on applying Euclid’s algorithm, i.e. dividing 75 by 45, we get:
Quotient = 1, Remainder = 30
∴ 75 = 45 × 1 + 30
Again on applying Euclid’s algorithm, i.e. dividing 45 by 30, we get:
Quotient = 1, Remainder = 15
∴ 45 = 30 × 1 + 15
Again on applying Euclid’s algorithm, i.e. dividing 30 by 15, we get:
Quotient = 2, Remainder = 0
∴ 30 = 15 × 2 + 0
Hence, the HCF of 960 and 1575 is 15.
6. Show that every positive even integer is of the form (6m+1) or (6m+3) or (6m+5)where m
is some integer.
Sol:
Let n be any arbitrary positive odd integer.
On dividing n by 6, let m be the quotient and r be the remainder. So, by Euclid’s division
lemma, we have
n = 6m + r, where 0 ≤ r ˂ 6.
As 0 ≤ r ˂ 6 and r is an integer, r can take values 0, 1, 2, 3, 4, 5.
⇒ n = 6m or n = 6m + 1 or n = 6m + 2 or n = 6m + 3 or n = 6m + 4 or n = 6m + 5
But n ≠ 6m or n ≠ 6m + 2 or n ≠ 6m + 4 ( ∵ 6m, 6m + 2, 6m + 4 are multiples of 2, so an
even integer whereas n is an odd integer)
⇒ n = 6m + 1 or n = 6m + 3 or n = 6m + 5
Thus, any positive odd integer is of the form (6m + 1) or (6m + 3) or (6m + 5), where m is
some integer.
7. Show that every positive even integer is of the form 4m and that every positive odd integer
is of the form 4m + 1 for some integer m.
Sol:
Let n be any arbitrary positive odd integer.
On dividing n by 4, let m be the quotient and r be the remainder. So, by Euclid’s division
lemma, we have
n = 4m + r, where 0 ≤ r ˂ 4.
Exercise - 1B
144 = 24 × 32
198 = 2 × 32 × 11
HCF = product of smallest power of each common prime factor in the numbers
= 2 × 32 = 18
LCM = product of greatest power of each prime factor involved in the numbers
= 24 × 32 × 11 = 1584
(v) Prime factorization:
396 = 22 × 32 × 11
1080 = 23 × 33 × 5
HCF = product of smallest power of each common prime factor in the numbers
= 22 × 32 = 36
LCM = product of greatest power of each prime factor involved in the numbers
= 23 × 33 × 5 × 11 = 11880
(vi) Prime factorization:
1152 = 27 × 32
1664 = 27 × 13
HCF = product of smallest power of each common prime factor in the numbers
= 27 = 128
LCM = product of greatest power of each prime factor involved in the numbers
= 27× 32 × 13 = 14976
= 22 × 3 × 5 × 7 = 420
(iii) 17 = 17
23 = 23
29 = 29
HCF = product of smallest power of each common prime factor in the numbers = 1
LCM = product of greatest power of each prime factor involved in the numbers
= 17 × 23 × 29 = 11339
(iv) 24 = 2 × 2 × 2 × 3 = 23 × 3
36 = 2 × 2 × 3 × 3 = 22 × 32
40 = 2 × 2 × 2 × 5 = 23 × 5
HCF = product of smallest power of each common prime factor in the numbers
= 22 = 4
LCM = product of greatest power of each prime factor involved in the numbers
= 23 × 32 × 5 = 360
(v) 30 = 2 × 3 × 5
72 = 2 × 2 × 2 × 3 × 3 = 23 × 32
432 = 2 × 2 × 2 × 2 × 3 × 3 × 3 = 24 × 33
HCF = product of smallest power of each common prime factor in the numbers
=2×3=6
LCM = product of greatest power of each prime factor involved in the numbers
= 24 × 33 × 5 = 2160
(vi) 21 = 3 × 7
28 = 2 × 2 × 7 = 22 × 7
36 = 2 × 2 × 3 × 3 = 22 × 32
45 = 5 × 3 × 3 = 5 × 32
HCF = product of smallest power of each common prime factor in the numbers = 1
LCM = product of greatest power of each prime factor involved in the numbers
= 22 × 32 × 5 × 7 = 1260
3. The HCF of two numbers is 23 and their LCM is 1449. If one of the numbers is 161, find the
other.
Sol:
Let the two numbers be a and b.
Let the value of a be 161.
Given: HCF = 23 and LCM = 1449
We know, a × b = HCF × LCM
⇒ 161 × b = 23 × 1449
23 ×1449 33327
⇒ ∴b= = = 207
161 161
Hence, the other number b is 207.
4. The HCF of two numbers is 145 and their LCM is 2175. If one of the numbers is 725, find
the other.
Sol:
HCF of two numbers = 145
LCM of two numbers = 2175
Let one of the two numbers be 725 and other be x.
Using the formula, product of two numbers = HCF × LCM
we conclude that
725 × x = 145 × 2175
145 ×2175
x= 725
= 435
Hence, the other number is 435.
5. The HCF of two numbers is 18 and their product is 12960. Find their LCM.
Sol:
HCF of two numbers = 18
Product of two numbers = 12960
Let their LCM be x.
Using the formula, product of two numbers = HCF × LCM
we conclude that
12960 = 18 × x
12960
x= 18
= 720
Hence, their LCM is 720.
8. Find the largest number which divides 438 and 606 leaving remainder 6 in each case.
Answer:
Largest number which divides 438 and 606, leaving remainder 6 is actually the largest
number which divides 438 – 6 = 432 and 606 – 6 = 600, leaving remainder 0.
Therefore, HCF of 432 and 600 gives the largest number.
Now, prime factors of 432 and 600 are:
432 = 24 × 33
600 = 23 × 3 × 52
HCF = product of smallest power of each common prime factor in the numbers = 2 3 × 3 =
24
Thus, the largest number which divides 438 and 606, leaving remainder 6 is 24.
9. Find the largest number which divides 320 and 457 leaving remainders 5 and 7 respectively.
Answer:
We know that the required number divides 315 (320 – 5) and 450 (457 – 7).
∴ Required number = HCF (315, 450)
On applying Euclid’s lemma, we get:
315 ) 450 ( 1
- 315
135 ) 315 ( 2
- 270
45 ) 135 ( 3
- 135
0
10. Find the least number which when divides 35, 56 and 91 leaves the same remainder 7 in each
case.
Answer:
Least number which can be divided by 35, 56 and 91 is LCM of 35, 56 and 91.
Prime factorization of 35, 56 and 91 is:
35 = 5 × 7
56 = 23 × 7
91 = 7 × 13
LCM = product of greatest power of each prime factor involved in the numbers = 23 × 5 × 7
× 13 = 3640
Least number which can be divided by 35, 56 and 91 is 3640.
Least number which when divided by 35, 56 and 91 leaves the same remainder 7 is 3640 +
7 = 3647.
Thus, the required number is 3647.
11. Find the smallest number which when divides 28 and 32, leaving remainders 8 and 12
respectively.
Answer:
Let the required number be x.
Using Euclid’s lemma,
x = 28p + 8 and x = 32q + 12, where p and q are the quotients
⇒28p + 8 = 32q + 12
⇒28p = 32q + 4
⇒7p = 8q + 1….. (1)
Here p = 8n – 1 and q = 7n – 1 satisfies (1), where n is a natural number
On putting n = 1, we get
p = 8 – 1 = 7 and q = 7 – 1 = 6
Thus, x = 28p + 8
= 28 × 7 + 8
= 204
Hence, the smallest number which when divided by 28 and 32 leaves remainders 8 and 12 is
204.
12. Find the smallest number which when increased by 17 is exactly divisible by both 468 and
520.
Answer:
The smallest number which when increased by 17 is exactly divisible by both 468 and 520
is obtained by subtracting 17 from the LCM of 468 and 520.
Prime factorization of 468 and 520 is:
468 = 22 × 32 × 13
520 = 23 × 5 × 13
LCM = product of greatest power of each prime factor involved in the numbers = 22 × 32 ×
5 × 13 = 4680
The required number is 4680 – 17 = 4663.
Hence, the smallest number which when increased by 17 is exactly divisible by both 468 and
520 is 4663.
13. Find the greatest number of four digits which is exactly divisible by 15, 24 and 36.
Answer:
Prime factorization:
15 = 3 × 5
24 = 23 × 3
36 = 22 × 32
LCM = product of greatest power of each prime factor involved in the numbers = 2 3 × 32 ×
5 = 360
Now, the greatest four digit number is 9999.
On dividing 9999 by 360 we get 279 as remainder.
Thus, 9999 – 279 = 9720 is exactly divisible by 360.
Hence, the greatest number of four digits which is exactly divisible by 15, 24 and 36 is 9720.
14. In a seminar, the number of participants in Hindi, English and mathematics are 60, 84 and
108 respectively. Find the minimum number of rooms required, if in each room, the same
number of participants are to be seated and all of them being in the same subject.
Answer:
𝑇𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑎𝑟𝑡𝑖𝑐𝑖𝑝𝑎𝑛𝑡𝑠
Minimum number of rooms required = 𝐻𝐶𝐹 (60,84,108)
Prime factorization of 60, 84 and 108 is:
60 = 22 × 3 × 5
84 = 22 × 3 × 7
108 = 22 × 33
HCF = product of smallest power of each common prime factor in the numbers = 2 2 × 3 =
12
Total number of participants = 60 + 84 + 108 = 252
252
Therefore, minimum number of rooms required = = 21
12
Thus, minimum number of rooms required is 21.
15. Three sets of English, Mathematics and Science books containing 336, 240 and 96 books
respectively have to be stacked in such a way that all the books are stored subject wise and
the height of each stack is the same. How many stacks will be there?
Answer:
Total number of English books = 336
Total number of mathematics books = 240
Total number of science books = 96
∴ Number of books stored in each stack = HCF (336, 240, 96)
Prime factorization:
336 = 24 × 3 × 7
240 = 24 × 3 × 5
96 = 25 × 3
∴ HCF = Product of the smallest power of each common prime factor involved in the
numbers = 24 × 3 = 48
Hence, we made stacks of 48 books each.
336 240 96
∴ Number of stacks = + + 48 = (7+5+2) = 14
48 48
16. Three pieces of timber 42m, 49m and 63m long have to be divided into planks of the same
length. What is the greatest possible length of each plank? How many planks are formed?
Answer:
The lengths of three pieces of timber are 42m, 49m and 63m respectively.
We have to divide the timber into equal length of planks.
∴ Greatest possible length of each plank = HCF (42, 49, 63)
Prime factorization:
42 = 2 × 3 × 7
49 = 7 × 7
63 = 3 × 3 × 7
∴HCF = Product of the smallest power of each common prime factor involved in the numbers
=7
Hence, the greatest possible length of each plank is 7m.
17. Find the greatest possible length which can be used to measure exactly the lengths 7m, 3m
85cm and 12m 95cm.
Answer:
The three given lengths are 7m (700cm), 3m 85cm (385cm) and 12m 95m (1295cm). (∵1m
= 100cm).
∴ Required length = HCF (700, 385, 1295)
Prime factorization:
700 = 2 × 2 × 5 × 5 × 7 = 22 × 52 × 7
385 = 5 × 7 ×11
1295 = 5 × 7 × 37
∴HCF = 5 × 7 = 35
Hence, the greatest possible length is 35cm.
18. Find the maximum number of students among whom 1001 pens and 910 pencils can be
distributed in such a way that each student gets the same number of pens and the same
number of pencils.
Answer:
Total number of pens = 1001
Total number pencils = 910
∴ Maximum number of students who get the same number of pens and pencils = HCF (1001,
910)
Prime factorization:
1001 = 11 × 91
910 = 10 × 91
∴ HCF = 91
Hence, 91 students receive same number of pens and pencils.
19. Find the least number of square tiles required to pave the ceiling of a room 15m 17cm long
and 9m 2cm broad.
Answer:
It is given that:
Length of a tile = 15m 17m = 1517cm [∵ 1m = 100cm]
Breadth of a tile = 9m 2m = 902cm
∴ Side of each square tile = HCF (1517, 902)
Prime factorization:
1517 = 37 × 41
902 = 22 × 41
∴ HCF = product of smallest power of each common prime factor in the numbers = 41
𝐴𝑟𝑒𝑎 𝑜𝑓 𝑐𝑒𝑖𝑙𝑖𝑛𝑔 1517 × 902
∴ Required number of tiles = = = 37 × 22 = 814
𝐴𝑟𝑒𝑎 𝑜𝑓 𝑜𝑛𝑒 𝑡𝑖𝑙𝑒 41 × 41
20. Three measuring rods are 64 cm, 80 cm and 96 cm in length. Find the least length of cloth
that can be measured an exact number of times, using any of the rods.
Answer:
Length of the three measuring rods are 64cm, 80cm and 96cm, respectively.
∴ Length of cloth that can be measured an exact number of times = LCM (64, 80, 96)
Prime factorization:
64 = 26
80 = 24 × 5
96 = 25 × 3
∴ LCM = product of greatest power of each prime factor involved in the numbers = 26 × 3 ×
5 = 960cm = 9.6m
Hence, the required length of cloth is 9.6m.
21. An electronic device makes a beep after every 60 seconds. Another device makes a beep
after every 62 seconds. They beeped together at 10 a.m. At what time will they beep together
at the earliest?
Answer:
Beep duration of first device = 60 seconds
Beep duration of second device = 62 seconds
∴ Interval of beeping together = LCM (60, 62)
Prime factorization:
60 = 22 × 3 × 5
62 = 2 × 31
1860
∴ LCM = 22 × 3 × 5 × 31 = 1860 seconds = = 31min
60
Hence, they will beep together again at 10 : 31 a.m.
22. Six bells commence tolling together and toll at intervals of 2, 4, 6, 8, 10, 12 minutes
respectively. In 30 hours, how many times do they toll together?
Answer:
Six bells toll together at intervals of 2,4, 6, 8, 10 and 12 minutes, respectively.
Prime factorization:
2=2
4=2×2
6=2×3
8=2×2×2
10 = 2 × 5
12 = 2 × 2 × 3
∴ LCM (2, 4, 6, 8, 10, 12) = 23 × 3 × 5 = 120
Hence, after every 120minutes (i.e. 2 hours), they will toll together.
30
∴ Required number of times = ( 2 + 1) = 16
660
2 330
2 165
3 55
5 11
Exercise - 1C
1. Without actual division, show that each of the following rational numbers is a terminating
decimal. Express each in decimal form.
23 24 171 15 17
(i) 23 × 52 (ii) 125 (iii) 800 (iv) (v)
1600 320
19
(vi) 3125
Answer:
23 23 × 5 115
(i) = = = 0.115
23 × 52 23 × 53 1000
We know either 2 or 5 is not a factor of 23, so it is in its simplest form
Moreover, it is in the form of (2m × 5n).
Hence, the given rational is terminating.
24 24 24 × 23 192
(ii) 125 = 53 = 53 × 23 = 1000 = 0.192
We know 5 is not a factor of 23, so it is in its simplest form.
Moreover, it is in the form of (2m × 5n).
Hence, the given rational is terminating.
171 171 171 × 53 21375
(iii) 800 = 25 × 52 = = 100000 = 0.21375
25 × 55
We know either 2 or 5 is not a factor of 171, so it is in its simplest form.
2. Without actual division show that each of the following rational numbers is a non-
terminating repeating decimal.
11 73 129 9
(i) (ii) (iii) (iv)
23 × 3 23 × 33 × 5 22 × 57 × 75 35
77 32 29 64
(v) 210 (vi) 147 (vii) 343 (viii) 455
Answer:
11
(i) 23 × 3
We know either 2 or 3 is not a factor of 11, so it is in its simplest form.
Moreover, (23 × 3) ≠ (2m × 5n)
Hence, the given rational is non – terminating repeating decimal.
73
(ii) 23 × 33 × 5
We know 2, 3 or 5 is not a factor of 73, so it is in its simplest form.
Moreover, (22 × 33 ×5) ≠ (2m × 5n)
Hence, the given rational is non-terminating repeating decimal.
129
(iii) 22 × 57 × 75
We know 2, 5 or 7 is not a factor of 129, so it is in its simplest form.
Moreover, (22 × 57 × 75 ) ≠ (2m × 5n)
Hence, the given rational is non-terminating repeating decimal.
9 9
(iv) =
35 5 ×7
We know either 5 or 7 is not a factor of 9, so it is in its simplest form.
Moreover, (5 × 7) ≠ (2m × 5n)
Hence, the given rational is non-terminating repeating decimal.
Exercise 1D
1. Define (i) rational numbers (ii) irrational numbers (iii) real numbers
Answer:
𝑝
Rational numbers: The numbers of the form 𝑞 where 𝑝, 𝑞 are integers and 𝑞 ≠ 0 are called
rational numbers.
2
Example: 3
Irrational numbers: The numbers which when expressed in decimal form are expressible as
non-terminating and non-repeating decimals are called irrational numbers.
Example: √2
Real numbers: The numbers which are positive or negative, whole numbers or decimal
numbers and rational numbers or irrational number are called real numbers.
1
Example: 2, ,√2 , -3 etc.
3
1 1
So, if is irrational, then 5 is rational
√5 5
1
4. Prove that is irrational.
√3
Answer:
1
Let be rational.
√3
1 𝑎
∴ = 𝑏, where a, b are positive integers having no common factor other than 1
√3
𝑏
∴√3 = 𝑎 ….(1)
𝑏
Since a, b are non-zero integers, 𝑎 is rational.
Thus, equation (1) shows that √3 is rational.
This contradicts the fact that √3 is rational.
The contradiction arises by assuming √3 is rational.
⇒ x2 – 13 = - 4 √3
13− 𝑥2
⇒ = √3
4
Since x is rational number, x2 is also a rational number.
⇒ 13 - x2 is a rational number
13− 𝑥2
⇒ is a rational number
4
⇒ √3 is a rational number
But √3 is an irrational number, which is a contradiction.
Hence, our assumption is wrong.
Thus, (2 √3 – 1) is an irrational number.
37− 𝑥2
⇒ = √3
20
Since x is a rational number, x2 is also a rational number.
⇒ 37 - x2 is a rational number
37− 𝑥2
⇒ is a rational number
20
⇒√3 is a rational number
But √3 is an irrational number, which is a contradiction.
Hence, our assumption is wrong.
Thus, (5 - 2√3) is an irrational number.
2
11. Show that is irrational.
√7
Answer:
2 2 √7 2
= × = 7 √7
√7 √7 √7
2
Let 7 √7 is a rational number.
2 𝑝
∴7 √7 = 𝑞, where p and q are some integers and HCF(p,q) = 1 ….(1)
⇒2√7q = 7p
⇒(2√7q) 2 = (7p) 2
⇒7(4q2) = 49p2
⇒4q2 = 7p2
⇒ q2 is divisible by 7
⇒ q is divisible by 7 …..(2)
Let q = 7m, where m is some integer.
∴2√7q = 7p
⇒ [2√7 (7m)]2 = (7p)2
⇒343(4m2) = 49p2
⇒ 7(4m2) = p2
⇒ p2 is divisible by 7
⇒ p is divisible by 7 ….(3)
From (2) and (3), 7 is a common factor of both p and q, which contradicts (1).
Hence, our assumption is wrong.
2
Thus, is irrational.
√7
Exercise 1E
6. The product of two numbers is 1050 and their HCF is 25. Find their LCM.
Answer:
HCF of two numbers = 25
Product of two numbers = 1050
Let their LCM be x.
Using the formula, Product of two numbers = HCF × LCM
We conclude that,
1050 = 25 × x
1050
x= 25
= 42
Hence, their LCM is 42.
a
9. If the rational number has a terminating decimal expansion, what is the condition to be
b
satisfied by b?
Answer:
Let x be a rational number whose decimal expansion terminates.
𝑎
Then, we can express x in the form 𝑏, where a and b are coprime, and prime factorization
of b is of the form (2m × 5n), where m and n are non-negative integers.
2√45+3√20
10. Find the simplest form of 2√5
Answer:
2√45+3√20 2√3×3×5 +3√2×2×5
=
2√5 2√5
2×3√5 + 3 ×2√5
= 2√5
6√5+6√5
= 2√5
12√5
= 2√5
=6
2√45+3√20
Thus, simplified form of is 6.
2√5
73
11. Write the decimal expansion of (24 ×53 )
Answer:
Decimal expansion:
73 73 ×5
= 24 × 54
(24 ×53 )
365
= (2×5)4
365
= (10)4
365
= 10000
= 0.0365
73
Thus, the decimal expansion of (24 ×53 ) is 0.0365.
13. Is it possible to have two numbers whose HCF if 25 and LCM is 520?
Answer:
No, it is not possible to have two numbers whose HCF is 25 and LCM is 520.
Since, HCF must be a factor of LCM, but 25 is not a factor of 520.
17. The LCM of two numbers is 1200, show that the HCF of these numbers cannot be 500.
Why ?
Answer:
If the LCM of two numbers is 1200 then, it is not possible to have their HCF equals to 500.
Since, HCF must be a factor of LCM, but 500 is not a factor of 1200.
⇒9x = 4
4
⇒x = 9
4
Thus, simplest form of 0.4 as a rational number is 9.
√2
21. Show that is irrational.
3
Answer:
√2
Let is a rational number.
3
√2 𝑝
∴ = where p and q are some integers and HCF(p,q) = 1 …..(1)
3 𝑞
⇒√2q = 3p
⇒(√2q)2 = (3p)2
⇒2q2 = 9p2
⇒p2 is divisible by 2
⇒p is divisible by 2 ….(2)
Let p = 2m, where m is some integer.
∴√2q = 3p
⇒√2q = 3(2m)
⇒(√2q)2 = [ 3(2m) ]2
⇒ 2q2 = 4 (9p2)
⇒ q2 = 2 (9p2)
⇒ q2 is divisible by 2
⇒ q is divisible by 2 …(3)
From (2) and (3), 2 is a common factor of both p and q, which contradicts (1).
Hence, our assumption is wrong.
√2
Thus, is irrational.
3
Exercise MCQ
2017 2017
= 53 × 2
250
We know 2 and 5 are not the factors of 2017.
So, the given rational is in its simplest form.
And it is of the form (2m × 5n) for some integers m, n.
So, the given rational number is a terminating decimal.
2017 2017 × 22 8068
∴53 × 2 = = 1000 = 8.068
53 × 23
3219 3219
=
1800 23 × 52 × 32
We know 2, 3 and 5 are not the factors of 3219.
So, the given rational is in its simplest form.
∴ (23 × 52 × 32 ) ≠ (2m × 5n) for some integers m, n.
3219
Hence, 1800 is not a terminating decimal.
3219
= 1.78833333….
1800
Thus, it is a repeating decimal.
1723 1723
=
625 54
We know 5 is not a factor of 1723.
So, the given rational number is in its simplest form.
And it is not of the form (2m × 5n)
1723
Hence, is not a terminating decimal.
625
∴ LCM = Product of greatest power of each prime factor involved in the numbers
= 24 × 3 × 5 × 7
= 16 × 3 × 5 × 7
= 1680
5. The HCF of two numbers is 27 and their LCM is 162. If one of the numbers is 54, what is the
other number?
(a) 36 (b) 45 (c) 9 (d) 81
Answer:
(d) 81
Let the two numbers be x and y.
It is given that:
x = 54
HCF = 27
LCM = 162
We know,
x × y = HCF × LCM
⇒ 54 × y = 27 × 162
⇒ 54 y = 4374
4374
⇒ ∴y= = 81
54
6. The product of two numbers is 1600 and their HCF is 5. The LCM of the numbers is
(a) 8000 (b) 1600 (c) 320 (d) 1605
Answer:
(c) 320
Let the two numbers be x and y.
It is given that:
x × y = 1600
HCF = 5
We know,
HCF × LCM = x × y
⇒ 5 × LCM = 1600
1600
⇒ ∴ LCM = = 320
5
7. What is the largest number that divided each one of the 1152 and 1664 exactly?
(a) 32 (b) 64 (c) 128 (d) 256
Answer:
(c) 128
Largest number that divides each one of 1152 and 1664 = HCF (1152, 1664)
We know,
1152 = 27 × 32
1664 = 27 × 13
∴ HCF = 27 = 128
8. What is the largest number that divides 70 and 125, leaving remainders 5 and 8 respectively?
(a) 13 (b) 9 (c) 3 (d) 585
Answer:
(a) 13
We know the required number divides 65 (70 – 5) and 117 (125 – 8)
∴ Required number = HCF (65, 117)
We know,
65 = 13 × 5
117 = 13 × 3 × 3
∴ HCF = 13
9. What is the largest number that divides 245 and 1029, leaving remainder 5 in each case?
(a) 15 (b) 16 (c) 9 (d) 5
Answer:
(b) 16
We know that the required number divides 240 (245 – 5) and 1024 (1029 – 5).
∴ Required number = HCF (240, 1024)
240 = 2 × 2 × 2 × 2 × 3 × 5
1024 = 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2
∴ HCF = 2 × 2 × 2 × 2 = 16
1095
10. The simplest form of 1168
17 25 13 15
(a) (b) (c) (d)
26 26 16 16
Answer:
15
(d) 16
1095 1095 ÷ 73 15
= 1168 = 16
1168 ÷ 73
Hence, HCF of 1095 and 1168 is 73.
11. Euclid’s division lemma states that for any positive integers a and b, there exist unique
integers q and r such that a = bq + r, where r must satisfy
(a) 1 ˂ r ˂ v (b) 0 ˂ r ≤ b (c) 0 ≤ r ˂ b (d) 0 ˂ r ˂ b
Answer:
(c) 0 ≤ r ˂ b
Euclid’s division lemma, states that for any positive integers a and b, there exist unique
integers q and r, such that a = bq + r
where r must satisfy 0 ≤ r ˂ b
12. A number when divided by 143 leaves 31 as remainder. What will be the remainder when the
same number is divided by 13?
(a) 0 (b) 1 (c) 3 (d) 5
Answer:
(d) 5
We know,
Dividend = Divisor × Quotient + Remainder.
It is given that:
Divisor = 143
Remainder = 13
So, the given number is in the form of 143x + 31, where x is the quotient.
∴ 143x + 31 = 13 (11x) + (13 × 2) + 5 = 13 (11x + 2) + 5
Thus, the remainder will be 5 when the same number is divided by 13.
14. π is
(a) an integer (b) a rational number
(c) an irrational number (d) none of these
Answer:
(c) π is an irrational number
π is an irrational number because it is a non-repeating and non-terminating decimal.
15. 2.35 is
(a) an integer (b) a rational number
(c) an irrational number (d) none of these
Answer:
(b) 2.35 is a rational number
2.35 is a rational number because it is a repeating decimal.
16. 2.13113111311113…… is
(a) an integer (b) a rational number
(c) an irrational number (d) none of these
Answer:
(c) an irrational number
It is an irrational number because it is a non-terminating and non-repeating decimal.
17. 1.2348 is
(a) an integer (b) a rational number
(c) an irrational number (d) none of these
Answer:
(b) 1.2348 a rational number
It is a rational number because it is a repeating decimal.
37
19. The decimal expansion of the rational number 25 × 5 will terminate after
(a) one decimal place (b) two decimal places
(c) three decimal places (d) four decimal places
Answer:
(b) two decimal places.
14753
20. The decimal expansion of the number will terminate after
1250
(a) one decimal place (b) two decimal places
(c) three decimal places (d) four decimal places
Answer:
(d) four decimal places
14753 14753 14753 × 23 118024
= 54 × 2 = = = 11.8024
1250 54 × 24 1000
So, the decimal expansion of the number will terminate after four decimal places.
22. If a and b are two positive integers such that the least prime factor of a is 3 and the least
prime factor of b is 5. Then, the least prime factor of (a + b) is
(a) 2 (b) 3 (c) 5 (d) 8
Answer:
(a) 2
Since 5 + 3 = 8, the least prime factor of a + b has to be 2, unless a + b is a prime number
greater than 2.
23. √2 is
(a) an integer (b) an irrational number
(c) a rational number (d) none of these
Answer:
Let √2 is a rational number.
𝑝
∴ √2 = 𝑞, where p and q are some integers and HCF(p,q) = 1 ….(1)
⇒ √2𝑞 = p
⇒ (√2𝑞)2 = p2
⇒2q2 = p2
⇒ p2 is divisible by 2
⇒ p is divisible by 2 …..(2)
1
24. is
√2
(a) a fraction (b) a rational number
(c) an irrational number (d) none of these
Answer:
(c) an irrational number.
1
is an irrational number.
√2
25. (2 + √2) is
(a) an integer (b) a rational number
(c) an irrational number (d) none of these
Answer:
(c) an irrational number
2 + √2 is an irrational number.
if it is rational, then the difference of two rational is rational.
∴ (2 + √2) – 2 = √2 = irrational.
26. What is the least number that is divisible by all the natural numbers from 1 to 10 (both
inclusive)?
Answer:
(c) 2520
We have to find the least number that is divisible by all numbers from 1 to 10.
∴ LCM (1 to 10) = 23 × 32 × 5 × 7 = 2520
Thus, 2520 is the least number that is divisible by every element and is equal to the least
common multiple.
⇒ 3n – 1 = 9 × (3q + 2) + 2
So, when (3n-1) is divided by 9, we get the remainder 2.
4. 0. 68 + 0. 73 = ?
(a) 1. 41 (b) 1. 42 (c) 0. 141 (d) none of these
Answer:
(b) 1. 42
5. Show that any number of the form 4n, n ϵ N can never end with the digit 0.
Answer:
If 4n ends with 0, then it must have 5 as a factor.
But we know the only prime factor of 4n is 2.
Also we know from the fundamental theorem of arithmetic that prime factorization of each
number is unique.
Hence, 4n can never end with the digit 0.
6. The HCF of two numbers is 27 and their LCM is 162. If one of the number is 81, find the
other.
Answer:
Let the two numbers be x and y
It is given that:
x = 81
HCF = 27 and LCM = 162
We know, Product of two numbers = HCF × LCM
⇒ x × y = 27 × 162
⇒ 81 × y = 4374
4374
⇒ y= = 54
81
Hence, the other number is y is 54.
17
7. Examine whether 30 is a terminating decimal.
Answer:
17 17
=
30 2 × 3 × 5
We know that 2,3 and 5 are not the factors of 17.
17
So, 30 is in its simplest form.
Also, 30 = 2 × 3 × 5 ≠ (2m × 5n)
17
Hence, 30 is a non-terminating decimal.
148
8. Find the simplest form of 185.
Answer:
148 148 ÷ 37 4
= 185 ÷ = 5 (∵HCF of 148 and 185 is 37)
185 37
4
Hence, the simplest form is 5.
11. Find the HCF and LCM of 12, 15, 18, 27.
Answer:
Prime factorization:
12 = 2 × 2 × 3 = 22 × 3
15 = 3 × 5
18 = 2 × 3 × 3 = 2 × 32
27 = 3 × 3 × 3 = 33
Now,
HCF = Product of smallest power of each common prime factor in the number
=3
LCM = Product of greatest power of each prime factor involved in the number
= 22 × 33 × 5 = 540
14. Find the HCF of 1008 and 1080 by prime factorization method.
Answer:
Prime factorization:
1008 = 2 × 2 × 2 × 2 × 3 × 3 × 7 = 24 × 32 × 7
1080 = 2 × 2 × 2 × 3 × 3 × 3 × 5 = 23 × 33 × 5
HCF = Product of smallest power of each common prime factor in the number.
= 23 × 32 = 72
8 10 16
15. Find the HCF and LCM of 9, 27 and 81.
Answer:
𝐻𝐶𝐹 𝑜𝑓 𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝑠
HCF of fractions = 𝐿𝐶𝑀 𝑜𝑓 𝑑𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟𝑠
𝐿𝐶𝑀 𝑜𝑓 𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝑠
LCM of fractions = 𝐻𝐶𝐹 𝑜𝑓 𝑑𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟𝑠
Prime factorization of the numbers given in the numerators are as follows:
8=2×2×2
10 = 2 × 5
16 = 2 × 2 × 2 × 2
HCF of numerators = 2
LCM of numerators = 24 × 5 = 80
Prime factorization of numbers given in the denominators are as follows:
9=3×3
27 = 3 × 3 × 3
81 = 3 × 3 × 3 × 3
HCF of denominators = 3 × 3 = 9
LCM of denominators = 34 = 81
𝐻𝐶𝐹 𝑜𝑓 𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝑠 2
∴ HCF of fractions = 𝐿𝐶𝑀 𝑜𝑓 𝑑𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟𝑠 = 81
𝐿𝐶𝑀 𝑜𝑓 𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝑠 80
∴ LCM of fractions = 𝐻𝐶𝐹 𝑜𝑓 𝑑𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟𝑠 = 9
16. Find the largest number which divides 546 and 764, leaving remainders 6 and 8 respectively.
Answer:
We know the required number divides 540 (546 – 6) and 756 (764 – 8), respectively.
∴ Required largest number = HCF (540, 756)
Prime factorization:
540 = 2 × 2 × 3 × 3 × 3 × 5 = 22 × 32 × 5
756 = 2 × 2 × 3 × 3 × 3 × 7 = 22 × 32 × 7
∴ HCF = 22 × 33 = 108
Hence, the largest number is 108.
18. Show that every positive odd integer is of the form (4q+1) or (4q+2) for some integer q.
Answer:
Let a be the given positive odd integer.
On dividing a by 4, let q be the quotient and r the remainder.
Therefore, by Euclid’s algorithm we have
a = 4q + r 0≤r˂4
⇒ a = 4q + r r = 0, 1, 2, 3
⇒ a = 4q, a = 4q + 1, a = 4q + 2, a = 4q + 3
But, 4q and 4q + 2 = 2 (2q + 1) = even
Thus, when a is odd, it is of the form (4q + 1) or (4q + 3) for some integer q.
19. Show that one and only one out of n, (n+2) and (n+4) is divisible by 3, where n is any
positive integer.
Answer:
Let q be quotient and r be the remainder.
On applying Euclid’s algorithm, i.e. dividing n by 3, we have
n = 3q + r 0≤r˂3
⇒ n = 3q + r r = 0, 1 or 2
⇒ n = 3q or n = (3q + 1) or n = (3q + 2)
Case 1: If n = 3q, then n is divisible by 3.
Case 2: If n = (3q+1), then (n+2) = 3q + 3 = 3(q + 1), which is clearly divisible by 3.
In this case, (n+2) is divisible by 3.
Case 3: If n = (3q+2), then (n+4) = 3q + 6 = 3(q + 2), which is clearly divisible by 3.
In this case, (n+4) is divisible by 3.
Hence, one and only one out of n, (n+2) and (n+4) is divisible by 3.