Rs Aggarwal 2018 Solutions for Class 10 Math Chapter 1 Real Numbers are provided here with simple step-by-step explanations. These solutions for Real Numbers are extremely popular among Class 10 students for Math Real Numbers Solutions come handy for quickly completing your homework and preparing for exams. All questions and answers from the Rs Aggarwal 2018 Book of Class 10 Math Chapter 1 are provided here for you for free. You will also love the ad-free experience on Meritnation’s Rs Aggarwal 2018 Solutions. All Rs Aggarwal 2018 Solutions for class Class 10 Math are prepared by experts and are 100% accurate.
Page No 9:
Question 1:
What do you mean by Euclid's division algorithm.
Answer:
Euclid's division algorithm states that for any two positive integers a and b, there exist unique integers q and r, such that a = bq + r, where 0 ≤ r < b.
Page No 9:
Question 2:
A number when divided by 61 gives 27 as quotient and 32 as remainder.
Find the number.
Answer:
We know, Dividend = Divisor Quotient + Remainder
Given: Divisor = 61, Quotient = 27, Remainder = 32
Let the Dividend be x.
∴ x =
= 1679
Hence, the required number is 1679.
Page No 9:
Question 3:
By what number should 1365 be divided to get 31 as quotient and 32 as remainder?
Answer:
Given: Dividend = 1365, Quotient = 31, Remainder = 32
Let the divisor be x.
Dividend = Divisor Quotient + Remainder
1365 = x 31 + 32
⇒ 1365 − 32 = 31x
⇒ 1333 = 31x
⇒ x = = 43
Hence, 1365 should be divided by 43 to get 31 as quotient and 32 as remainder.
Page No 9:
Question 4:
Using Euclid's algortihm, find the HCF of
(i) 405 and 2520
(ii) 504 and 1188
(iii) 960 and 1575
Answer:
(i)
On applying Euclid's algorithm, i.e. dividing 2520 by 405, we get:
Quotient = 6, Remainder = 90
∴ 2520 = 405 6 + 90
Again on applying Euclid's algorithm, i.e. dividing 405 by 90, we get:
Quotient = 4, Remainder = 45
∴ 405 = 90 4 + 45
Again on applying Euclid's algorithm, i.e. dividing 90 by 45, we get:
∴ 90 = 45 2 + 0
Hence, the HCF of 2520 and 405 is 45.
(ii)
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)
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.
Page No 9:
Question 5:
Show that every positive integer is either even or odd.
Answer:
Let us assume that there exist a smallest positive integer that is neither odd nor even, say n. Since n is the least positive integer which is neither even nor odd, n − 1 must be either odd or even.
Case 1: If n − 1 is even, n − 1 = 2k for some k.
But this implies n = 2k + 1
this implies n is odd.
Case 2: If n − 1 is odd, n − 1 = 2k + 1 for some k.
But this implies n = 2k + 2 = 2(k + 1)
this implies n is even.
In both ways we have a contradiction.
Thus, every positive integer is either even or odd.
Page No 9:
Question 6:
Show that any positive odd integer is of the form (6m + 1) or (6m + 3) or (6m + 5), where m is some integer.
Answer:
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 interger 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.
Page No 9:
Question 7:
Show that any positive odd integer is of the form (4m + 1) or (4m + 3), where m is some integer.
Answer:
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.
As 0 ≤ r < 4 and r is an integer, r can take values 0, 1, 2, 3.
⇒ n = 4m or n = 4m + 1 or n = 4m + 2 or n = 4m + 3
But n ≠ 4m or n ≠ 4m + 2 (∵ 4m, 4m + 2 are multiples of 2, so an even interger whereas n is an odd integer)
⇒ n = 4m + 1 or n = 4m + 3
Thus, any positive odd integer is of the form (4m + 1) or (4m + 3), where m is some integer.
Page No 16:
Question 1:
Using prime factorization, find the HCF and LCM of
(i) 36, 84
(ii) 23, 31
(iii) 96, 404
(iv) 144, 198
(v) 396, 1080
(vi) 1152, 1664
Answer:
(i) 36, 84
Prime factorisation:
36 = 22 ⨯ 32
84 = 22 ⨯ 3 ⨯ 7
HCF = product of smallest power of each common prime factor in the numbers = 22 ⨯ 3 = 12
LCM = product of greatest power of each prime factor involved in the numbers = 22 ⨯ 32 ⨯ 7 = 252
(ii) 23, 31
Prime factorisation:
23 = 23
31 = 31
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 = 23 ⨯ 31 = 713
(iii) 96, 404
Prime factorisation:
96 = 25 ⨯ 3
404 = 22 ⨯ 101
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 = 25 ⨯ 3 ⨯ 101 = 9696
(iv) 144, 198
Prime factorisation:
144 =
198 =
HCF = product of smallest power of each common prime factor in the numbers = = 18
LCM = product of greatest power of each prime factor involved in the numbers = = 1584
(v) 396, 1080
Prime factorisation:
396 =
1080 =
HCF = product of smallest power of each common prime factor in the numbers = = 36
LCM = product of greatest power of each prime factor involved in the numbers = = 11880
(vi) 1152 , 1664
Prime factorisation:
1152 =
1664 =
HCF = product of smallest power of each common prime factor involved in the numbers = = 128
LCM = product of greatest power of each prime factor involved in the numbers = = 14976
Page No 16:
Question 2:
Using prime factorization, find the HCF and LCM of
(i) 8, 9, 25
(ii) 12, 15, 21
(iii) 17, 23, 29
(iv) 24, 36, 40
(v) 30, 72, 432
(vi) 21, 28, 36, 45
Answer:
(i) 8 = 2 ⨯ 2 ⨯ 2 = 23
9 = 3 ⨯ 3 = 32
25 = 5 ⨯ 5 = 52
HCF = Product of smallest power of each common prime factor in the numbers = 1
LCM = Product of the greatest power of each prime factor involved in the numbers = 23 ⨯ 32 ⨯ 52 = 1800
(ii) 12 = 2 ⨯ 2 ⨯ 3 = 22 ⨯ 3
15 = 3 ⨯ 5
21 = 3 ⨯ 7
HCF = Product of smallest power of each common prime factor in the numbers = 3
LCM = Product of the greatest power of each prime factor involved in the numbers = 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 the greatest power of each prime factor involved in the numbers = 17 ⨯ 23 ⨯ 29 = 11339
(iv) 24 = 2 =
36 = =
40 = 2 =
∴ HCF = Product of smallest power of each common prime factor in the numbers = = 4
∴ LCM = Product of the greatest power of each prime factor involved in the numbers =
(v)
=
=
∴ HCF = Product of smallest power of each common prime factor in the numbers =
∴ LCM = Product of the greatest power of each prime factor involved in the numbers =
(vi)
28 = =
=
=
∴ HCF = Product of smallest power of each common prime factor in the numbers = 1
∴ LCM = Product of the greatest power of each prime factor involved in the numbers =
Page No 17:
Question 3:
The HCF of two numbers is 23 and their LCM is 1449. If one of the numbers is 161, find the other.
Answer:
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
⇒ ∴ b = 23 × 1449 = 33327 = 207
161 161
Hence, the other number b is 207.
Page No 17:
Question 4:
The HCF of two numbers is 145 and their LCM is 2175. If one of the numbers is 725, find the other.
Answer:
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
x =
= 435
Hence, the other number is 435.
Page No 17:
Question 5:
The HCF of two numbers is 18 and their product is 12960. Find their LCM.
Answer:
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
x =
= 720
Hence, their LCM is 720.
Page No 17:
Question 6:
Is it possible to have two numbers whose HCF is 18 and LCM is 760? Give reason.
Answer:
No, it is not possible to have two numbers whose HCF is 18 and LCM is 760.
Since, HCF must be a factor of LCM, but 18 is not a factor of 760.
Page No 17:
Question 7:
Find the simplest form of:
(i)
(ii)
(iii)
(iv)
Answer:
(i) Prime factorisation of 69 and 92 is:
69 = 3 × 23
92 = 22 × 23
Therefore,
Thus, simplest form of is .
(ii) Prime factorisation of 473 and 645 is:
473 = 11 × 43
645 = 3 × 5 × 43
Therefore,
Thus, simplest form of is .
(iii) Prime factorisation of 1095 and 1168 is:
1095 = 3 × 5 × 73
1168 = 24 × 73
Therefore,
Thus, simplest form of is .
(iv) Prime factorisation of 368 and 496 is:
368 = 24 × 23
496 = 24 × 31
Therefore,
Thus, simplest form of is .
Page No 17:
Question 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 = 23 × 3 = 24
Thus, the largest number which divides 438 and 606, leaving remainder 6 is 24.
Page No 17:
Question 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
Therefore, the HCF of 315 and 450 is 45.
Hence, the required number is 45.
Page No 17:
Question 10:
Find the least number which when divided by 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.
Page No 17:
Question 11:
Find the smallest number which when divided by 28 and 32 leaves 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.
Page No 17:
Question 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 = 23 × 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.
Page No 17:
Question 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 = 23 × 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.
Page No 17:
Question 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 =
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 = 22 × 3 = 12
Total number of paricipants = 60 + 84 + 108 = 252
Therefore, minimum number of rooms required =
Thus, minimum number of rooms required is 21.
Page No 17:
Question 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 higher 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 factorisation:
336 =
240 =
96 =
∴ HCF = Product of the smallest power of each common prime factor involved in the numbers = = 48
Hence, we made stacks of 48 books each.
∴ Number of stacks = = (7 + 5 + 2) = 14
Page No 17:
Question 16:
Three pieces of timber 42 m, 49 m and 63 m long have to be divided into planks of the same length. What is the greatest possible length of each plank?
Answer:
The lengths of three pieces of timber are 42 m, 49 m and 63 m, respectively.
We have to divide the timber into equal length of planks.
∴ Greatest possible length of each plank = HCF(42, 49, 63)
Prime factorisation:
42 =
49 =
63 =
∴ HCF = Product of smallest power of each common prime factor in the numbers = 7
Hence, the greatest possible length of each plank is 7 m.
Page No 17:
Question 17:
Find the greatest possible length which can be used to measure exactly the length 7 m, 3 m 85 cm and 12 m 95 cm.
Answer:
The three given lengths are 7 m (700 cm), 3 m 85 cm (385 cm) and 12 m 95 cm (1295 cm). (∵ 1 m = 100 cm)
∴ Required length = HCF (700, 385, 1295)
Prime factorisation:
700 =
385 =
1295 =
∴ HCF = = 35
Hence, the greatest possible length is 35 cm.
Page No 18:
Question 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 of pencils = 910
∴ Maximum number of students who get the same number of pens and pencils = HCF (1001, 910)
Prime factorisation:
1001 =
910 =
∴ HCF = 91
Hence, 91 students receive same number of pens and pencils.
Page No 18:
Question 19:
Find the leash number of square tiles required to pave the ceiling of a room 15 m 17 cm long and 9 m 2 cm broad.
Answer:
It is given that:
Length of a tile = 15 m 17 cm = 1517 cm [∵ 1 m = 100 cm]
Breadth of a tile = 9 m 2 cm = 902 cm
∴ Side of each square tile = HCF (1517, 902)
Prime factorisation:
1517 =
902 =
∴ HCF = Product of smallest power of each common prime factor in the numbers = 41
∴ Required number of tiles = = = = 814
Page No 18:
Question 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 64 cm, 80 cm and 96 cm, respectively.
∴ Length of cloth that can be measured an exact number of times = LCM (64, 80, 96)
Prime factorisation:
64 =
80 =
96 =
∴ LCM = Product of greatest power of each prime factor involved in the numbers = = 960 cm = 9.6 m
Hence, the required length of cloth is 9.6 m.
Page No 18:
Question 21:
An electronic device makes a beep after every 60 seconds. Another device makes a beep after 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 factorisation:
60 =
62 =
∴ LCM = seconds = = 31 min
Hence, they will beep together again at 10 : 31 a.m.
Page No 18:
Question 23:
Six bells commence tolling together and toll at intervals of 2, 4, 6, 8, 10, 12, minutes respectively. How many times do they toll together in 30 hours?
Answer:
Six bells toll together at intervals of 2, 4, 6, 8, 10 and 12 minutes, respectively.
Prime factorisation:
∴ =
Hence, after every 120 minutes (i.e. 2 hours), they will toll together.
∴ Required number of times =
Page No 18:
Question 24:
Find the missing numbers in the following factorisation:
Answer:
Page No 25:
Question 1:
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form:
(i)
(ii)
(iii)
(iv)
(v)
(vi)
Answer:
(i) =
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 .
Hence, the given rational is terminating.
(ii)
We know 5 is not a factor of 23, so it is in its simplest form.
Moreover, it is in the form of .
Hence, the given rational is terminating.
(iii) =
We know either 2 or 5 is not a factor of 171, so it is in its simplest form.
Moreover, it is in the form of .
Hence, the given rational is terminating.
(iv)
We know either 2 or 5 is not a factor of 15, so it is in its simplest form.
Moreover, it is in the form of .
Hence, the given rational is terminating.
(v) = =
We know either 2 or 5 is not a factor of 17, so it is in its simplest form.
Moreover, it is in the form of .
Hence, the given rational is terminating.
(vi) =
We know either 2 or 5 is not a factor of 19, so it is in its simplest form.
Moreover, it is in the form of .
Hence, the given rational is terminating.
Page No 25:
Question 2:
Without actual division, show that each of the following rational numbers is a non-terminating repeating decimal:
(i)
(ii)
(iii)
(iv)
(v)
(vi)
(vii)
(viii)
Answer:
(i)
We know either 2 or 3 is not a factor of 11, so it is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
(ii)
We know 2, 3 or 5 is not a factor of 73, so it is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
(iii)
We know 2, 5 or 7 is not a factor of 129, so it is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
(iv)
We know either 5 or 7 is not a factor of 9, so it is in its simplest form.
Moreover, () ≠
Hence, the given rational is non-terminating repeating decimal.
(v)
We know 2, 3 or 5 is not a factor of 11, so is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
(vi)
We know either 3 or 7 is not a factor of 32, so it is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
(vii)
We know 7 is not a factor of 29, so it is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
(viii)
We know 5, 7 or 13 is not a factor of 64, so it is in its simplest form.
Moreover, ≠
Hence, the given rational is non-terminating repeating decimal.
Page No 25:
Question 3:
Express each of the following as a fraction in simplest form:
(i)
(ii)
(iii)
(iv)
(v)
(vi)
Answer:
(i) Let x = 0.8
∴ x = 0.888 ...(1)
10x = 8.888 ...(2)
On subtracting equation (1) from (2), we get
9x = 8 ⇒ x =
∴ 0.8 =
(ii) Let x = 2.4
∴ x = 2.444 ...(1)
10x = 24.444 ...(2)
On subtracting equation (1) from (2), we get
9x = 22 ⇒ x =
∴ 2.4 =
(iii) Let x = 0.24
∴ x = 0.2424 ...(1)
100x = 24.2424 ...(2)
On subtracting equation (1) from (2), we get
99x = 24 ⇒ x =
∴ 0.24 =
(iv) Let x = 0.12
∴ x = 0.1212 ...(1)
100x = 12.1212 ...(2)
On subtracting equation (1) from (2), we get
99x = 12 ⇒ x =
∴ 0.12 =
(v) Let x = 2.24
∴ x = 2.2444 ...(1)
10x = 22.444 ...(2)
100x = 224.444 ...(3)
On subtracting equation (2) from (3), we get
90x = 202 ⇒ x ==
Hence, 2.24 =
(vi) Let x = 0.365
∴ x = 0.3656565 ...(1)
10x = 3.656565 ...(2)
1000x = 365.656565 ...(3)
On subtracting (2) from (3), we get
990x = 362 ⇒ x =
Hence, 0.365 =
Page No 35:
Question 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.
Example:
Irrational numbers: The numbers which when expressed in decimal form are expressible as non-terminating and non-repeating decimals are called irrational numbers.
Example:
Real numbers: The numbers which are positive or negative, whole numbers or decimal numbers and rational number or irrational number are called real numbers.
Example: 2, , , −3 etc.
Page No 35:
Question 2:
Classify the following numbers as rational or irrational:
(i)
(ii) 3.1416
(iii) π
(iv)
(v) 5.636363...
(vi) 2.040040004...
(vii) 1.535335333...
(viii) 3.121221222...
(ix)
(x)
Answer:
(i) is a rational number because it is of the form of ≠ 0.
(ii) 3.1416 is a rational number because it is a terminating decimal.
(iii) is an irrational number because it is a non-repeating and non-terminating decimal.
(iv) 3.142857 is a rational number because it is a repeating decimal.
(v) 5.636363... is a rational number because it is a non-terminating, repeating decimal.
(vi) 2.040040004... is an irrational number because it is a non-terminating and non-repeating decimal.
(vii) 1.535335333... is an irrational number because it is a non-terminating and non-repeating decimal.
(viii) 3.121221222... is an irrational number because it is a non-terminating and non-repeating decimal.
(ix) is an irrational number because are irrational and prime numbers.
(x) is an irrational number because 3 is a prime number. So, is an irrational number.
Page No 35:
Question 3:
Prove that each of the following numbers is irrational:
(i)
(ii)
(iii)
(iv)
(v)
(vi)
(vii)
(viii)
(ix)
Answer:
(i) Let be rational.
Hence, are both rational.
This contradicts the fact that are irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(ii) Let be rational.
Hence, and are rational.
∴ = rational [∵ Difference of two rational is rational]
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(iii) Let be rational.
Hence, and are rational.
∴ = rational [∵ Difference of two rational is rational]
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(iv) Let be rational.
Hence, and are rational.
∴ = rational [∵ Difference of two rational is rational]
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(v) Let, be rational.
Hence, and are rational.
∴ = rational [∵ Difference of two rational is rational]
∴ = rational [∵ Product of two rational is rational]
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(vi) Let be rational.
∴ = rational [∵ Product of two rational is rational]
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(vii) Let be rational.
∴ = rational [∵ Product of two rational is rational]
This contradicts the fact that is irrational.
∴
So, if is rational, then is rational.
∴ = rational [∵ Product of two rational is rational]
Hence, is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(viii) Let be rational.
Hence and are rational.
∴ = rational [∵ Difference of two rational is rational]
∴ = rational [∵ Product of two rational is rational]
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
(ix) Let be rational.
∴ , where is rational
∴ ... (1)
On squaring both sides of equation (1), we get
⇒
This is impossible because right-hand side is rational, whereas the left-hand side is irrational.
This is a contradiction.
Hence, is irrational.
Page No 35:
Question 4:
Prove that is irrational.
Answer:
Let be rational.
∴ = , where are positive integers having no common factor other than 1
∴ ...(1)
Since are non-zero integers, is rational.
Thus, equation (1) shows that is rational.
This contradicts the fact that is rational.
The contradiction arises by assuming is rational.
Hence, is irrational.
Page No 35:
Question 5:
(i) Give an example of two irrationals whose sum is rational.
(ii) Give an examples of two irrationals whose product is rational.
Answer:
(i) Let be two irrationals.
∴ = rational number
(ii) Let be two irrationals.
∴ = 18 = rational number
Page No 35:
Question 6:
State whether the given statement is true of false:
(i) The sum of two rationals is always rational.
(ii) The product of two rationals is always rational.
(iii) The sum of two irrationals is an irrational.
(iv) The product of two irrationals is an irrational.
(v) The sum of a rational and and irrational is irrational.
(vi) The product of a rational and an irrational is irrational.
Answer:
(i) True
(ii) True
(iii) False
Counter example: are two irrational numbers. But their sum is 4, which is a rational number.
(iv) False
Counter example:
(v) True
(vi) True
Page No 36:
Question 7:
Prove that () is an irrational number.
Answer:
Let x = be a rational number.
Since x is a rational number, x2 is also a rational number.
⇒ 13 − x2 is a rational number
⇒ is a rational number
⇒ is a rational number
But is an irrational number, which is a contradiction.
Hence, our assumption is wrong.
Thus, () is an irrational number.
Page No 36:
Question 8:
Prove that () is an irrational number.
Answer:
Let x = be a rational number.
Since x is a rational number, x2 is also a rational number.
⇒ 66 − x2 is a rational number
⇒ is a rational number
⇒ is a rational number
But is an irrational number, which is a contradiction.
Hence, our assumption is wrong.
Thus, () is an irrational number.
Page No 36:
Question 9:
Prove that () is an irrational number.
Answer:
Let x = be a rational number.
Since x is a rational number, x2 is also a rational number.
⇒ 37 − x2 is a rational number
⇒ is a rational number
⇒ is a rational number
But is an irrational number, which is a contradiction.
Hence, our assumption is wrong.
Thus, () is an irrational number.
Page No 36:
Question 10:
Prove that is irrational.
Answer:
Let is a rational number.
∴ , where p and q are some integers and HCF(p, q) = 1 ....(1)
⇒ p2 is divisible by 2
⇒ p is divisible by 2 .....(2)
Let p = 2m, where m is some integer.
∴
⇒ 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.
Thus, is irrational.
Page No 36:
Question 11:
Prove that is irrational.
Answer:
Let is a rational number.
∴ , where p and q are some integers and HCF(p, q) = 1 ....(1)
⇒ q2 is divisible by 7
⇒ q is divisible by 7 .....(2)
Let q = 7m, where m is some integer.
∴
⇒ 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.
Thus, is irrational.
Page No 36:
Question 1:
State Euclid's division lemma.
Answer:
Euclid's division lemma, states that for any two positive integers a and b, there exist unique whole numbers q and r, such that
a = b × q + r where 0 ≤ r < b
Page No 36:
Question 2:
State fundamental theorem of arithmatic.
Answer:
The fundamental theorem of arithmetic, states that every integer greater than 1 either is prime itself or is the product of prime numbers, and this product is unique.
Page No 36:
Question 3:
Express 360 as product of its prime factors.
Answer:
Prime factorization:
360 = 23 × 32 × 5
Page No 36:
Question 4:
If a and b are two prime numbers then find HCF(a, b).
Answer:
Prime factorization:
a = a
b = b
HCF = product of smallest power of each common prime factor in the numbers = 1
Thus, HCF(a, b) = 1
Page No 36:
Question 5:
If a and b are two prime numbers then find LCM(a, b).
Answer:
Prime factorization:
a = a
b = b
LCM = product of greatest power of each prime factor involved in the numbers = a × b
Thus, LCM(a, b) = ab.
Page No 36:
Question 6:
If 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
x =
= 42
Hence, their LCM is 42.
Page No 36:
Question 7:
What is a composite number?
Answer:
A composite number is a positive integer which is not prime (i.e., which has factors other than 1 and itself).
Page No 36:
Question 8:
If a and b are relatively prime then what is their HCF?
Answer:
If two numbers are relatively prime then their greatest common factor will be 1.
Thus, HCF(a, b) = 1.
Page No 36:
Question 9:
If the rational number has a terminating decimal expansion, what is the condition to be 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.
Page No 36:
Question 10:
Simplify: .
Answer:
Thus, simplified form of is 6.
Page No 36:
Question 11:
Write the decimal expansion of .
Answer:
Decimal expansion:
Thus, the decimal expansion of is 0.0365.
Page No 37:
Question 12:
Show that there is no value of n for which (2n × 5n) ends in 5.
Answer:
We can write:
(2n × 5n) = (2 × 5)n
= 10n
For any value of n, we get 0 in the end.
Thus, there is no value of n for which (2n × 5n) ends in 5.
Page No 37:
Question 13:
Is it possible to have two numbers whose HCF is 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.
Page No 37:
Question 14:
Give an example of two irrationals whose sum is rational.
Answer:
Let the two irrationals be .
Thus, sum (i.e., 8) is a rational number.
Page No 37:
Question 15:
Give an example of two irrationals whose product is rational.
Answer:
Let the two irrationals be .
Thus, product (i.e., 60) is a rational number.
Page No 37:
Question 16:
If a and b are relatively prime, what is their LCM?
Answer:
If two numbers are relatively prime then their greatest common factor will be 1.
∴ HCF(a, b) = 1
Using the formula, Product of two numbers = HCF × LCM
we conclude that,
a × b = 1 × LCM
∴ LCM = ab
Thus, LCM(a, b) is ab.
Page No 37:
Question 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.
Page No 37:
Question 18:
Express as a rational number in simplest form.
Answer:
Let x be .
.....(1)
Multiplying both sides by 10, we get
.....(2)
Subtracting (1) from (2), we get
Thus, simplest form of as a rational number is .
Page No 37:
Question 19:
Express as a rational number in simplest form.
Answer:
Let x be .
.....(1)
Multiplying both sides by 100, we get
.....(2)
Subtracting (1) from (2), we get
Thus, simplest form of as a rational number is .
Page No 37:
Question 20:
Explain why 0.15015001500015 ... is an irrational number.
Answer:
Irrational numbers are non-terminating non-recurring decimals.
Thus, 0.15015001500015 ... is an irrational number.
Page No 37:
Question 21:
Show that is irrational.
Answer:
Let is a rational number.
∴ , where p and q are some integers and HCF(p, q) = 1 ....(1)
⇒ p2 is divisible by 2
⇒ p is divisible by 2 ....(2)
Let p = 2m, where m is some integer.
∴
⇒ 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.
Thus, is irrational.
Page No 37:
Question 22:
Write a rational number between
Answer:
Since, = 1.732....
So, we may take 1.8 as the required rational number between
Thus, the required rational number is 1.8
Page No 37:
Question 23:
Explain why is a rational number.
Answer:
Since, is a non-terminating repeating decimal.
Hence, is a rational number.
Page No 38:
Question 1:
Which of the following rational numbers is expressible as a now terminating repeating decimal?
(a)
(b)
(c)
(d)
Answer:
(c)
We know 2 and 5 are not the factors of 1351.
So, the given rational is in its simplest form.
And it is of the form for some integers .
So, the given number is a terminating decimal.
∴
=
We know 2 and 5 are not the factors of 2017.
So, the given rational number is in its simplest form.
And it is of the form for some integers .
So, the given rational number is a terminating decimal.
∴
We know 2, 3 and 5 are not the factors of 3219.
So, the given rational number is in its simplest form.
∴ ≠
Hence, is not a terminating decimal.
Thus, it is a repeating decimal.
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 .
Hence, is not a terminating decimal.
Page No 38:
Question 2:
If a = (22 × 33 × 54) and b = (23 × 32 × 5), then HCF (a, b) = ?
(a) 90
(b) 180
(c) 360
(d) 540
Answer:
(b) 180
It is given that:
a = and b = ()
∴ HCF (a, b) = Product of smallest power of each common prime factor in the numbers
=
= 180
Page No 38:
Question 3:
HCF of (23 × 32 × 5), (22 × 33 ×52) and (24 ×3 × 53 × 7) is
(a) 30
(b) 48
(c) 60
(d) 105
Answer:
(c) 60
HCF = (, , )
HCF = Product of smallest power of each common prime factor in the numbers
=
= 60
Page No 38:
Question 4:
LCM of (23 × 3 × 5) and (24 × 5 × 7) is
(a) 40
(b) 560
(c) 1680
(d) 1120
Answer:
(c) 1680
LCM (, )
∴ LCM = Product of greatest power of each prime factor involved in the numbers
=
=
= 1680
Page No 38:
Question 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
54y = 4374
∴ y = = 81
Page No 38:
Question 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
⇒ ∴ LCM = = 320
Page No 38:
Question 7:
What is the largest number that divides each one of 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 =
1164 =
∴ HCF = = 128
Page No 38:
Question 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 =
117 =
∴ HCF = 13
Page No 38:
Question 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 =
1024 =
∴ HCF = = 16
Page No 38:
Question 10:
The simplest form of is
(a)
(b)
(c)
(d)
Answer:
(d)
Hence, HCF of 1095 and 1168 is 73.
Page No 38:
Question 11:
Euclid's division lemma sates 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 < b
(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
Page No 39:
Question 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 ) + 5 = 13 (11x + 2) + 5
Thus, the remainder will be 5 when the same number is divided by 13.
Page No 39:
Question 13:
Which of the following is an irrational number?
(a)
(b) 3.1416
(c)
(d) 3.141141114...
Answer:
(d) 3.141141114...
3.141141114 is an irrational number because it is a non-repeating and non-terminating decimal.
Page No 39:
Question 14:
π is
(a) an integer
(b) a rational number
(c) an irrational number
(d) none of these
Answer:
(c) an irrational number
is an irrational number because it is a non-repeating and non-terminating decimal.
Page No 39:
Question 15:
is
(a) an integer
(b) a rational number
(c) an irrational number
(d) none of these
Answer:
(b) a rational number
2.35 is a rational number because it is a repeating decimal.
Page No 39:
Question 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.
Page No 39:
Question 17:
3.24636363...is
(a) an integer
(b) a rational number
(c) an irrational number
(d) none of these
Answer:
(b) a rational number
It is a rational number because it is a repeating decimal.
Page No 39:
Question 18:
Which of the following rational numbers is expressible as a terminating decimal?
(a)
(b)
(c)
(d)
Answer:
(c)
; we know 5 and 33 are not the factors of 124. It is in its simplest form and it cannot be expressed as the product of for some non-negative integers .
So, it cannot be expressed as a terminating decimal.
= ; we know 5 and 6 are not the factors of 131. Its is in its simplest form and it cannot be expressed as the product of ( ) for some non-negative integers .
So, it cannot be expressed as a terminating decimal.
; as it is of the form , where are non-negative integers.
So, it is a terminating decimal.
; we know 2, 7 and 33 are not the factors of 1625. It is in its simplest form and cannot be expressed as the product of for some non-negative integers .
So, it cannot be expressed as a terminating decimal.
Page No 39:
Question 19:
The decimal expansion of the rational number will terminate after
(a) one decimal place
(b) two decimal places
(c) three decimal places
(d) four decimal places
Answer:
(b) two decimal places
So, the decimal expansion of the rational number will terminate after two decimal places.
Page No 39:
Question 20:
The decimal expansion of the number will terminate after
(a) one decimal place
(b) two decimal place
(c) three decimal place
(d) four decimal place
Answer:
(d) four decimal places
=
So, the decimal expansion of the number will terminate after four decimal places.
Page No 39:
Question 21:
The number 1.732 is
(a) an irrational number
(b) a rational number
(c) an integer
(d) a whole number
Answer:
Clearly, 1.732 is a terminating decimal.
Hence, a rational number.
Hence, the correct answer is option (b).
Page No 40:
Question 22:
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.
If a + b is a prime number greater than 2, then a + b must be an odd number. So, either a or b must be an even number. If a is even, then the least prime factor of a is 2, which is not 3 or 5. So, neither a nor b can be an even number. Hence, a + b cannot be a prime number greater than 2 if the least prime factor of a is 3 or 5.
Page No 40:
Question 23:
is
(a) a rational number
(b) an irrational number
(c) a terminating decimal
(d) a nonterminating repeating decimal
Answer:
Let is a rational number.
∴ , where p and q are some integers and HCF(p, q) = 1 .... (1)
⇒ p2 is divisible by 2
⇒ p is divisible by 2 .... (2)
Let p = 2m, where m is some integer.
∴
⇒ 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.
Thus, is an irrational number.
Hence, the correct answer is option (b).
Page No 40:
Question 24:
is
(a) a fraction
(b) a rational number
(c) an irrational number
(d) none of these
Answer:
(c) an irrational number
is an irrational number.
Page No 40:
Question 25:
is
(a) an integer
(b) a rational number
(c) an irrational number
(d) none of these
Answer:
(c) an irrational number
is an irrational number.
if it is rational, then the difference of two rational is rational
∴ = = irrational
Page No 40:
Question 26:
What is the least number that divisible by all the natural numbers from 1 to 10 (both inclusive)?
(a) 100
(b) 1260
(c) 2520
(d) 5040
Answer:
(c) 2520
We have to find the least number that is divisible by all numbers from 1 to 10.
∴ LCM (1 to 10) =
Thus, 2520 is the least number that is divisible by every element and is equal to the least common multiple.
Page No 43:
Question 1:
The decimal representation of is
(a) a terminating decimal
(b) a non-terminating, repeating decimal
(b) a non-terminating and non-repeating decimal
(d) none of these
Answer:
(b) a non-terminating, repeating decimal
We know that 2, 3 or 5 are not factors of 71.
So, it is in its simplest form.
And, ≠
∴
Hence, it is a non-terminating, repeating decimal.
Page No 43:
Question 2:
Which of the following has terminating decimal expansion?
(a)
(b)
(c)
(d)
Answer:
(b)
We know 2 and 5 are not factors of 19, so it is in its simplest form.
And
Hence, is a terminating decimal.
Page No 43:
Question 3:
On dividing a positive integer n by 9, we get 7 as remainder. What will be the remainder if (3n − 1) is divided by 9?
(a) 1
(b) 2
(c) 3
(d) 4
Answer:
(b) 2
Let q be the quotient.
It is given that:
remainder = 7
On applying Euclid's algorithm, i.e. dividing n by 9, we have
n = 9q + 7
⇒ 3n = 27q + 21
⇒ 3n − 1 = 27q + 20
⇒ 3n − 1 = 9 3q + 9 2 + 2
⇒ 3n − 1 = 9 (3q + 2) + 2
So, when (3n − 1) is divided by 9, we get the remainder 2.
Page No 43:
Question 4:
(a)
(b)
(c)
(d) None of these
Answer:
(b)
Page No 43:
Question 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 factorisation of each number is unique.
Hence, 4n can never end with the digit 0.
Page No 43:
Question 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 .
It is given that:
x = 81
HCF = 27 and LCM = 162
We know, Product of two numbers = HCF LCM
⇒ = 27 162
⇒ 81 = 4374
⇒ = 54
Hence, the other number y is 54.
Page No 43:
Question 7:
Examine whether is a terminating decimal.
Answer:
We know that 2, 3 and 5 are not the factors of 17.
So, is in its simplest form.
Also, 30 = ≠
Hence, is a non-terminating decimal.
Page No 43:
Question 8:
Find the simplest form of .
Answer:
(∵ HCF of 148 and 185 is 37)
Hence, the simplest form is .
Page No 43:
Question 9:
Which of the following numbers are irrational?
(a)
(b)
(c) 3.142857
(d)
(e) π
(f)
(g) 0.232332333...
(h)
Answer:
(a) is irrational (∵ if is prime, then is irrational).
(b) is irrational.
(c) 3.142857 is rational because it is a terminating decimal.
(d) 2.3 is rational because it is a non-terminating, repeating decimal.
(e) is irrational because it is a non-repeating, non-terminating decimal.
(f) is rational because it is in the form of ≠ 0.
(g) 0.232332333... is irrational because it is a non-terminating, non-repeating decimal.
(h) 5.2741 is rational because it is a non-terminating, repeating decimal.
Page No 44:
Question 10:
Prove that is irrational.
Answer:
Let be rational.
Then, both and 2 are rational.
∴ is rational [∵ Difference of two rational is rational]
⇒ is rational.
This contradicts the fact that is irrational.
The contradiction arises by assuming is rational.
Hence, is irrational.
Page No 44:
Question 11:
Find the HCF and LCM of 12, 15, 18, 27.
Answer:
Prime factorisation:
12 = =
15 =
18 = =
27 = =
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
= = 540
Page No 44:
Question 12:
Give an example of two irrationals whose sum is rational.
Answer:
Let be two irrational numbers.
Sum = , which is a rational number.
Page No 44:
Question 13:
Give prime factorisation of 4620.
Answer:
Prime factorisation:
4620 =
Page No 44:
Question 14:
Find the HCF of 1008 and 1080 by prime factorization method.
Answer:
Prime factorisation:
1008 =
1080 =
HCF = Product of smallest power of each common prime factor in the number
= = 72
Page No 44:
Question 15:
Find the HCF and LCM of and .
Answer:
Prime factorisation of the numbers given in the numerators are as follows:
=
Prime factorisation of numbers given in the denominators are as follows:
∴
∴
Page No 44:
Question 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 factorisation:
540 =
756 =
∴ HCF =
Hence, the largest number is 108.
Page No 44:
Question 17:
Prove that is an irrational number.
Answer:
Let be rational and its simplest form be .
Then, are integers with no common factors other than 1 and ≠ 0.
Now ⇒ [on squaring both sides]
⇒ ... (1)
⇒ divides [since 3 divides 3]
⇒ divides [since 3 is prime, 3 divides ⇒ 3 divides ]
Let for some integer .
Putting in equation (1), we get
⇒
⇒ 3 divides [since 3 divides 3]
⇒ 3 divides [since 3 is prime, 3 divides ⇒ 3 divides ]
Thus, 3 is a common factor of both
But this contradicts the fact that have no common factor other than 1.
The contradiction arises by assuming is rational.
Hence, is rational.
Page No 44:
Question 18:
Show that every positive odd integer is of the form (4q + 1) or (4q + 3) 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.
Page No 44:
Question 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(3q + 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 + 1) and (n + 2) is divisible by 3.
Page No 44:
Question 20:
Show that is irrational.
Answer:
Let (4 + 3√2) be a rational number.
Then both (4 + ) and 4 are rational.
⇒ ( 4 + − 4) = = rational [∵ Difference of two rational numbers is rational]
⇒ is rational.
⇒ is rational. [∵ Product of two rational numbers is rational]
⇒ is rational.
This contradicts the fact that is irrational (when 2 is prime, is irrational).
Hence, is irrational.
View NCERT Solutions for all chapters of Class 10