1.
NUMBER SYSTEM
*1. If |𝐱 − 𝟒| = −𝐱 , then the value of x is 1
(A) 3 (B) 2 (C) 1 (D) 0
Soln. (B) 2
**2. The field property for real number x, y, z: x (y + z) = xy + xz is called
1
(A) distributive property of addition over multiplication
(B) distributive property of multiplication over addition
(C) distributive property of addition over addition
(D) distributive property of multiplication over multiplication
Soln. (B) distributive property of multiplication over addition
***3. State Euclid’s division lemma/ Algorithm. 1
Statement: Let a and b any two integers and b>0. Then there exists
integers q and r such that a = bq + r and 0 ≤ r < b.
**4. Define the modulus of a real number. 1
Soln. The absolute or Modulus of a real number x denoted by |x| is
defined by
−𝐱, ∀ 𝒙 < 𝟎
|𝐱| = {
𝐱, ∀ 𝒙 ≥ 𝟎
5. Is there any x ∈ 𝐑 such that –x ∉ 𝐑? 1
Soln. No. i.e. 2 ∈ 𝐑 then –2 ∈ 𝐑
𝟏
**6. Write a real number x such that: ∉ 𝐑. 1
𝐱
𝟏
Soln. 0, i.e. 0 ∈ 𝐑 but ∉𝐑
𝟎
7. State Fundamental Theorem of Arithmetic or Unique factorization theorem.
1
Soln. Statement: Every composite number can be expressed as a product of
primes uniquely except for the order of the factors.
***8. Find the canonical decomposition of 1914 1
Soln. 1914 = 2 × 3 × 11 × 29
**9. Prove that |𝐚|𝟐 = 𝒂𝟐 , for any real number a. 2
Soln. Since |x y| = |x||y|
1
|a2| = |a||a|=|a|2.........................(i)
Also 𝐚𝟐 ≥ 𝟎 for any a ∈ 𝐑,
So that |a2| = a2 ................................(ii)
From (1) and (2), |𝐚|𝟐 = 𝒂𝟐
10. If |a| = |b| where a>0 and b<0, write the relation between a and b. 1
Soln. The relation between a and b for a>0 and b<0 is a = – b
11. Using the prime factorisation method, find the HCF and LCM of 420, 504
and 924. 2
Soln. 420 = 2 × 2 × 3 × 5 × 7
504 = 2 × 2 × 2 × 3 × 3 × 7
924 = 2 × 2 × 3 × 7 × 11
HCF = 2 × 2 × 3 × 7 = 84
LCM = 2 × 2 × 2 × 3 × 3 × 5 × 7 × 11 = 27720
*12. By what number may 408 be divided so that the remainder is 23.3
Soln. The required no will be greater than 23 and it will be a factor of
408 – 23 = 385
We have,
385 = 5 × 7 × 11
hence the factors of 385 are 1, 5,7,11, 5 × 7, 5 × 11,7 × 11 and 5 × 7 × 11.
i.e. 1,5,7,11,35,55,77 and 385
The required no. will be a factor of 385 and greater than 23 i.e. 35, 55,
77 and 385.
**13. State any four properties of real numbers. 4
(i) Closure under addition: The sum of two real numbers is a real number.
i.e. x+ y ∈ R when x, y ∈ 𝐑
(ii) Commutativity of addition: x + y = y + x for every x, y ∈ R
(iii) Commutativity of multiplication: x y = y x for every x, y ∈ R
(iv) Associativity of addition: For any x, y , 𝐳 ∈ R, (x + y) + z = x + (y + z)
14. For any x ∈ 𝑹, prove that x.0=0 2
Soln we have,
⇒ 0+ 0 =0 [ by property of additive identity]
⇒ x. (0+0) = 0
2
⇒ x.0 + x.0 = x.0 [ by distributive law]
⇒ x.0 + x.0 = x.0 + 0 [by property of additive identity]
⇒ x.0 = x0 [ by cancellation law]
***15. If x, y, z∈ 𝑹 and x + y = x + z, then prove that y = z. 2
Soln. We have,
x + y = x+ z ..............................(1)
Since x ∈ R, then – x ∈ R
Now adding (– x) on both sides of eqn. (1)
We get,
⇒ (– x) + (x + y) = (– x) + (x + z)
⇒ (– x + x) + y = (– x + x) + z [ associativity of addition]
⇒ 0+y = 0 + z [ additive inverse]
⇒ y =z [ additive identity]
**16. Prove that: |-x| = |x| 2
Soln. |-x| = |x|
The equality holds for x = 0 and if x≠ 𝟎
|-x| = the greater of – x and – (– x)
= the greater of (– x) and x
= the greater of x and (– x)
=|x|
Thus |-x| = |x| for x ∈ R
***17. Show that every square integer is of the form 4k or 4k +1
Soln. Let a be any integer and a is of the form 2q or 2q + 1
Then, a = 2q
a2 = (2q)2
= 4q2
= 4k [∵ k =q2]
And, a = 2q+ 1
a2= (2q +1)2
or, a2= (2q)2+2.2q.1+1
or, a2= 4q2 + 4q + 1
or, a2= 4(q2+q) + 1
or, a2= 4k+1 [∵ k = q2+1]
3
Thus, any square of an odd integer is of the form of 4k or 4k+1
**18. Show that the square of an odd integer is of the form 8k+1. 2
Soln. Let a be any odd integer and a is of the form 4q + 1 or 4q – 1
Then, a = 4q + 1
𝒂𝟐 = ( 𝟒𝐪 + 𝟏)𝟐
𝒂𝟐 = ( 𝟒𝐪 )𝟐 + 𝟐. 𝟒𝒒. 𝟏 + 𝟏
𝒂𝟐 = 𝟏𝟔𝐪𝟐 + 𝟖𝒒 + 𝟏
𝒂𝟐 = 𝟖(𝟐𝐪𝟐 + 𝒒) + 𝟏
𝒂𝟐 = 𝟖𝒌 + 𝟏 [ ∵ k = 𝟐𝐪𝟐 + 𝒒 ]
And, a = 4q – 1
𝒂𝟐 = ( 𝟒𝐪 − 𝟏)𝟐
𝒂𝟐 = ( 𝟒𝐪 )𝟐 − 𝟐. 𝟒𝒒. 𝟏 + 𝟏
𝒂𝟐 = 𝟏𝟔𝐪𝟐 − 𝟖𝒒 + 𝟏
𝒂𝟐 = 𝟖(𝟐𝐪𝟐 − 𝒒) + 𝟏
𝒂𝟐 = 𝟖𝒌 + 𝟏 [ ∵ k = 𝟐𝐪𝟐 − 𝒒 ]
Thus, any square of an odd integer is of the form of 8k+1
***19. If a is divisible by neither 2 nor 3, show that a 2 – 1 is divisible by 24
3
Soln. Let a = 6q + 1, for any integer q, which is divisible by neither 2
nor 3.
Then, a2 – 1 = (6q + 1)2 – 1
= (6q)2 +2.6q.1 + 12 – 1
= 36q2 + 12q
For even integers q = 2k,
a2 – 1= 36q2 + 12q
= 36. (2k)2 + 12. (2k)
= 144k2 + 24k
a2 – 1 = 24. (6k + k), which is divisible by 24
For odd integers q = 2k+1,
a2 – 1= 36q2 + 12q
= 36. (2k + 1)2 + 12. (2k+1)
= 36. {(2k)2 +2. 2k.1+ 12} + 24k + 12
= 36. {4k2 + 4k + 1} + 24k + 12
= 144k2 +144k + 36 + 24k + 12
= 144k2 +168k + 48
4
a2 – 1 = 24(6k2 +7k + 2), which is divisible by 24
**20. For x, y ∈ 𝑹, prove that: |x+y| ≤ |x| + |y|, and hence deduce that:
|x – y| ≥ |x| – |y|. 4
Soln. We have,
(𝐱 + 𝐲) ∀ (𝐱 + 𝐲) ≥ 𝟎
|𝒙 + 𝒚|={
−(𝐱 + 𝐲) ∀ (𝐱 + 𝐲) < 𝟎
Case-I: (x+y) ≥ 0 is true only when x and y are non-negative.
|x| = x ∀ x is non-negative.
|y| = y ∀ y is non-negative.
So, |x| + |y| = (x+y) = |x+y| ∀ (x+y) ≥ 0
Case- II: (x+y) < 0 is true when x and y are negative
|x| = -(-x) = x ∀ x is negative.
|y| = -(-y) = y ∀ y is negative.
So, |x| + |y| = (x+y) >-(x+y) = |x+y| ∀ (x+y) < 0
Thus, in both the cases |x+y| ≤ |x| + |y|
And we have |𝒙|=| (𝒙 − 𝒚) + 𝒚 | ≤ |𝒙 − 𝒚| + |𝒚|
|x| – |y| ≤ |𝒙 − 𝒚| i.e. |x – y| ≥ |x | – |y|.
**21. For any real numbers x, y, 𝜹 where 𝜹 > 0,
prove that: |x-y| < 𝛿 ⟺ 𝑦 − 𝛿 < 𝑥 < 𝑦 + 𝛿. 4
Soln. Suppose |𝒙 − 𝒚| < 𝜹
Then x– y ≤ |𝒙 − 𝒚| < 𝛅
⇒ x–y < 𝛅
⇒ x< y +𝜹 ...............................(1)
And – (x – y) ≤ |𝒙 − 𝒚| < 𝜹
⇒ – x+ y <𝜹
⇒ y < 𝒙+𝜹
⇒ 𝒚− 𝜹<𝒙 ......................(2)
Combining (1) and (2)
⇒ 𝒚− 𝜹<𝒙 < y + 𝜹
Conversely suppose 𝒚− 𝜹<𝒙 < y + 𝜹
⇒ 𝒚− 𝜹<𝒙 ⇒ y – x <𝜹
⇒ – (x – y) < 𝜹
And, 𝒙 < y + 𝜹
⇒ 𝒙 − y< 𝜹
5
𝒙−𝒚
Hence |𝒙 − 𝒚| = {−(𝒙 − 𝒚) <𝜹
**22. Find the least multiple of 13 which when divided by 5, 8 and 12 leaves
the same remainder 2 in each case. 4
Soln. LCM of 5,8 and 12 is 120
By Euclid’s division lemma, 120 = 13×9+3
The required no will be of the form
120k + 2 = (13×9 + 3) k + 2
= (13×9k) + (3k + 2)
To find the least positive integer k which makes 120k 2 i.e. (13×9k) + (3k + 2)
is divisible
by 9, By inspection, the value of k is found to be 8.
Hence the required no = 120×8 + 2
= 960 + 2 = 962