Chapter 1: Real Numbers (NCERT Solutions)
Exercise 1.1: Fundamental Theorem of Arithmetic
Solution:
(i) 140
140 = 2 × 70
= 2 × 2 × 35
= 2 × 2 × 5 × 7
= 22 × 5 × 7
(ii) 156
156 = 2 × 78
= 2 × 2 × 39
= 2 × 2 × 3 × 13
= 22 × 3 × 13
(iii) 3825
3825 = 3 × 1275
= 3 × 3 × 425
= 3 × 3 × 5 × 85
= 3 × 3 × 5 × 5 × 17
= 32 × 52 × 17
(iv) 5005
5005 = 5 × 1001
= 5 × 7 × 143
= 5 × 7 × 11 × 13
= 5 × 7 × 11 × 13
(v) 7429
7429 = 17 × 437
= 17 × 19 × 23
= 17 × 19 × 23
Solution:
(i) 26 and 91
26 = 2 × 13
91 = 7 × 13
HCF = 13
LCM = 2 × 7 × 13 = 182
Verification:
Product of numbers = 26 × 91 = 2366
HCF × LCM = 13 × 182 = 2366
Hence Verified.
(ii) 510 and 92
510 = 2 × 3 × 5 × 17
92 = 2 × 2 × 23 = 22 × 23
HCF = 2
LCM = 22 × 3 × 5 × 17 × 23 = 23460
Verification:
Product = 510 × 92 = 46920
HCF × LCM = 2 × 23460 = 46920
Hence Verified.
(iii) 336 and 54
336 = 24 × 3 × 7
54 = 2 × 33
HCF = 2 × 3 = 6
LCM = 24 × 33 × 7 = 3024
Verification:
Product = 336 × 54 = 18144
HCF × LCM = 6 × 3024 = 18144
Hence Verified.
Solution:
(i) 12, 15 and 21
12 = 22 × 3
15 = 3 × 5
21 = 3 × 7
HCF = 3
LCM = 22 × 3 × 5 × 7 = 420
(ii) 17, 23 and 29
All are prime numbers.
HCF = 1
LCM = 17 × 23 × 29 = 11339
(iii) 8, 9 and 25
8 = 23
9 = 32
25 = 52
No common factors other than 1.
HCF = 1
LCM = 23 × 32 × 52 = 8 × 9
× 25 = 1800
Solution:
We know that LCM × HCF = Product of two numbers
LCM × 9 = 306 × 657
LCM = (306 × 657) / 9
LCM = 34 × 657
LCM = 22338
Solution:
If a number ends with digit 0, it must be divisible by 10, meaning it must have 2 and 5 as prime
factors.
Prime factorization of 6n = (2 × 3)n = 2n ×
3n.
It contains the prime factor 2 but not 5.
By the Fundamental Theorem of Arithmetic, this factorization is unique.
Therefore, 6n cannot end with the digit 0 for any natural number n.
Solution:
Case 1: 7 × 11 × 13 + 13
= 13 (7 × 11 + 1)
= 13 (77 + 1)
= 13 × 78
Since it has factors other than 1 and itself (13 and 78), it is a composite number.
Case 2: 7 × 6 × 5 × 4 × 3 × 2 × 1 + 5
= 5 (7 × 6 × 4 × 3 × 2 × 1 + 1)
= 5 (1008 + 1)
= 5 × 1009
Since it has factors other than 1 and itself (5 and 1009), it is a composite
number.
Solution:
They will meet again at the LCM of their times.
LCM of 18 and 12:
18 = 2 × 32
12 = 22 × 3
LCM = 22 × 32 = 4 × 9 = 36
Therefore, they will meet again after 36 minutes.
Exercise 1.2: Irrational Numbers
Solution:
Let us assume, to the contrary, that √5 is rational.
Then we can find coprime integers a and b (b ≠ 0) such that √5 = a/b.
So, √5 b = a.
Squaring both sides:
5b2 = a2 ... (i)
Therefore, 5 divides a2. By Fundamental Theorem, 5 divides a.
Let a = 5c for some integer c.
Substituting a = 5c in (i):
5b2 = (5c)2
5b2 = 25c2
b2 = 5c2
Therefore, 5 divides b2, which means 5 divides b.
Thus, a and b have at least 5 as a common factor.
This contradicts the fact that a and b are coprime.
This contradiction has arisen because of our incorrect assumption that √5 is rational.
So, we conclude that √5 is irrational.
Solution:
Let us assume that 3 + 2√5 is rational.
So we can find coprime integers a and b (b ≠ 0) such that:
3 + 2√5 = a/b
2√5 = a/b - 3
2√5 = (a - 3b)/b
√5 = (a - 3b) / 2b
Since a and b are integers, (a - 3b)/2b is rational.
So, √5 is rational.
But this contradicts the fact that √5 is irrational.
Therefore, our assumption is false.
Hence, 3 + 2√5 is irrational.
Solution:
(i) 1/√2
Assume 1/√2 is rational, say a/b.
b/a = √2.
Since a,b are integers, b/a is rational, so √2 is rational, which is a contradiction.
Thus, 1/√2 is irrational.
(ii) 7√5
Assume 7√5 is rational, say a/b.
√5 = a/7b.
Since a/7b is rational, √5 is rational, which is a contradiction.
Thus, 7√5 is irrational.
(iii) 6 + √2
Assume 6 + √2 is rational, say a/b.
√2 = a/b - 6 = (a-6b)/b.
Since RHS is rational, √2 is rational, which is a contradiction.
Thus, 6 + √2 is irrational.
Real Numbers - RD Sharma Important Questions
96 = 25 × 3
404 = 22 × 101
HCF = 22 = 4
LCM = (96 × 404) / 4 = 96 × 101 = 9696.
Let x = 2m + 1 and y = 2n + 1.
x2 + y2 = (2m+1)2 + (2n+1)2
= 4m2 + 4m + 1 + 4n2 + 4n + 1
= 4(m2 + m + n2 + n) + 2
= 4k + 2.
Clearly, it is even (divisible by 2) but leaves a remainder 2 when divided by 4, so not divisible by
4.
By Euclid's division lemma, a = bq + r.
Let b = 4, then r = 0, 1, 2, 3.
a can be 4q, 4q+1, 4q+2, 4q+3.
Since a is odd, it cannot be 4q or 4q+2 (as they are divisible by 2).
Therefore, any odd integer is of the form 4q + 1 or 4q + 3.
Numbers are 70 - 5 = 65 and 125 - 8 = 117.
65 = 5 × 13
117 = 32 × 13
HCF = 13.
The required largest number is 13.
LCM = Product / HCF = 1800 / 12 = 150.
4n = (22)n = 22n.
The only prime factor is 2. To end with 0, it needs 2 and 5.
Since 5 is missing, it cannot end with 0.
(Similar to √5 proof)
Assume √3 = a/b.
3b2 = a2 ⇒ 3 divides a ⇒ a = 3c.
3b2 = 9c2 ⇒ b2 = 3c2 ⇒ 3 divides b.
Common factor 3 makes a,b not coprime. Contradiction.
Let 2√3 - 1 = r (rational).
2√3 = r + 1
√3 = (r + 1)/2
RHS is rational, LHS is irrational. Contradiction.
We need HCF of 850 and 680.
850 = 2 × 52 × 17
680 = 23 × 5 × 17
HCF = 2 × 5 × 17 = 170.
Max capacity = 170 litres.
We need LCM of 12, 15, 18.
12 = 4 × 3, 15 = 3 × 5, 18 = 2 × 9.
LCM = 180 minutes = 3 hours.
= 7(3 × 5 + 1) = 7(16). Factors are 1, 7, 16, etc. Composite.
Let n = 4q + 1 or 4q + 3.
If n = 4q+1: n2-1 = (4q+1)2-1 = 16q2+8q = 8(2q2+q).
Divisible by 8.
If n = 4q+3: n2-1 = (4q+3)2-1 = 16q2+24q+9-1 =
16q2+24q+8 = 8(2q2+3q+1). Divisible by 8.
Standard proof: p|a2 ⇒ p|a. Lead to contradiction.
378 = 2 × 33 × 7
180 = 22 × 32 × 5
420 = 22 × 3 × 5 × 7
HCF = 2 × 3 = 6.
LCM(48, 72, 108) = 432 seconds.
432 sec = 7 min 12 sec.
Time = 7:07:12 a.m.
LCM(520, 468) - 17.
LCM = 4680.
Ans = 4680 - 17 = 4663.
Let a = 3q, 3q+1, 3q+2.
(3q)2 = 9q2 = 3(3q2) = 3m.
(3q+1)2 = 3(3q2+2q)+1 = 3m+1.
(3q+2)2 = 9q2+12q+4 = 3(3q2+4q+1)+1 = 3m+1.
HCF(144, 180) = 36.
13m - 3 = 36 ⇒ 13m = 39 ⇒ m = 3.
LCM(24, 15, 36) = 360.
Greatest 6 digit no = 999999.
999999 / 360 leaves remainder 279.
Ans = 999999 - 279 = 999720.
n, n+1, n+2.
If n=3k, n is divisible.
If n=3k+1, n+2=3k+3 is divisible.
If n=3k+2, n+1=3k+3 is divisible.
Real Numbers - Formulas & PYQs
Key Formulas & Concepts
Every composite number can be expressed (factorized) as a product of primes, and this factorization is unique, apart from the order in which the prime factors occur.
Composite Number = Product of Primes
For any two positive integers a and b:
HCF(a, b) × LCM(a, b) = a × b
Note: This applies only to two numbers, not three.
A number is called irrational if it cannot be written in the form p/q, where p and q are integers and q ≠ 0.
Theorem: Let p be a prime number. If p divides a2, then p divides a, where a is a positive integer.
Examples: √2, √3, √5, π, 0.1010010001...
Previous Year Questions (CBSE/JKBOSE)
Least composite number = 4.
Least prime number = 2.
LCM(4, 2) = 4.
HCF(4, 2) = 2.
Ratio = LCM : HCF = 4 : 2 = 2 : 1.
(Standard proof as covered in Notes). Assumed p/q form, squared, found common factor 2, contradiction.
LCM = (336 × 54) / 6
= 336 × 9 = 3024.
The number ends with 5, so it is divisible by 5.
Since it has a factor 5 other than 1 and itself, it is composite.
Other number = (LCM × HCF) / Given number
= (182 × 13) / 26
= 182 / 2 = 91.
