Class 12 Maths Chapter 1 Solutions

CHAPTER-1 - Relations
Exercise - 1A
Q1
The set of all first elements or x-coordinates of the ordered pairs is
called Domain.
The set of all second elements or y-coordinates of the ordered pairs
is called Range.
So, here:
Domain of R = {-1, 1, -2, 2}
Range of R = {1, 4}
Q2
R = {(2, 8), (3, 27)
So, Range of R = {8 27}
Q3
(a) Here a = 2, 3, 5 and 7
So, R = {(2, 8), (3, 27), (5, 125), (7, 343)}
(b) Domain(R) = {2, 3, 5, 7}
(c)Range(R) = {8, 27, 125, 343}
Class XII www.vedantu.com RS Aggarwal Solutions

Q4
x + 2y = 8 (given)
x = 8 – 2y
Put y = 1
x = 8 – 2(1) = 6
Put y = 2
x = 8 – 2(2) = 4
Put y = 3
x = 8 – 2(3) = 2
Put y = 4
x = 8 – 2(4) = 0; which is not a natural number.
So, R = {(2, 3), (4, 2), (6, 1)
Hence, Range(R) = {3, 2, 1}
Q5
a + 3b = 12 (given)
a = 12 – 3b
Put b = 1
a = 12 – 3(1) = 9
Put b = 2
a = 12 – 3(2) = 6

Put b = 3
a = 12 – 3(3) = 3
Put b = 4
a = 12 – 3(4) = 0; which is not a natural number.
So, R = {(3, 3), (6, 2), (9, 1)
Hence, Domain(R) = {3, 6, 9}
and Range(R) = {3, 2, 1}
Q6
Since |a| < 3,
a = −2, −1, 0, 1, 2
So, R = {(−2, 3), (−1, 2), (0, 1), (1, 0), (2, 1)}
Hence, Domain(R) = {-2, -1, 0, 1, 2}
and Range(R) = {3, 2, 1, 0}
Q7
Since 1<a< 5,
a = 2, 3, 4
1 1 1
So, R = {(2, 2), (3, 3), (4, 4)}

1 1 1
and Range(R) = {2, 3, 4}
Q8
Since a< 4,
a = 1, 2, 3
So, R = {(1, 6), (2, 7), (3, 8)}
and Range(R) = {6, 7, 8}
Q9
(a) Let A, B,C ∈ S such that (A,B) ∈ R and (B,C) ∈ R
⇒ A is a proper subset of B and B is a proper subset of C
So, A is a proper subset of C
⇒ (A,C) ∈ R
Thus, R is transitive.
(b) Let R = {(A, B) : A ⊂ B)}, i.e., A is a proper subset of B
Now,
Any set is a subset of itself, but not a proper subset.
⇒ (A,A) ∉ R
Thus, R is not reflexive.
(c) A ⊂ B and (A,B) ∈ R (Given)
i.e. A is a proper subset of B

But, B cannot be a proper subset of A
As, B can contain atleast one element that is not in A.
⇒ (B,A) ∉ R
Thus, R is not symmetric.
Q10
Let A be the set of all points in a plane and O be the origin. (Given)
Then, R = {(P, Q) : P, Q ∈ A and OP = OQ)}
If R is Reflexive, Symmetric and Transitive, then R is an
equivalence relation.
Now,
Reflexivity:
For any point P, we have
OP=OP
⇒ (P, P) ∈ R
Thus, (P, P) ∈ R for all P ∈ A
Hence, R is reflexive.
Symmetric:
Let P and Q inset A such that,
(P, Q) ∈ R
⇒ OP = OQ

⇒ OQ = OP
⇒ (Q, P) ∈ R
Thus, (P, Q) ∈ R ⇒ (Q,P) ∈ R and (P, Q) ∈ A
Hence, R is symmetric.
Transitivity:
Let P, Q and S are three points in set A, such that (P, Q) ∈ R and
(Q, S) ∈ R
⇒ OP = OQ and OQ = OS
⇒ OP = OS
⇒ (P, S) ∈ R
Hence, R is an equivalence relation.
Q11
(a) Reflexivity:
Let p is an arbitrary element of S.
Now, p ≤ p
⇒ (p, p) ∈ R
Thus, R is reflexive.
(b) Transitivity:
Let p, q and r ∈ S, such that (p, q) ∈ R and (q, r) ∈ R
⇒ p ≤ q and q ≤ r
⇒p≤r
⇒ (p, r) ∈ R
(b) Non – Symmetric:
Let p and q ∈ S, such that (p, q) ∈ R
⇒ p≤q
⇒ q cannot be less than or equal to p
⇒ (q, p) ∉ R
Q12
A = {1, 2, 3, 4, 5, 6) and R = {(a, b): a, b ∈ A and b = a + 1}
(Given)
So, R = {(1,2), (2,3), (3,4), (4,5), (5,6)}
Non−reflexive:
If x ∈ A and (x, x) ∈ R, then R is reflexive.
Since, (1,1),(2,2),(3,3),(4,4),(5,5),(6,6) ∉ R
Non−symmetric:
If x, y ∈ A such that (x, y) ∈ R ⇒ (y, x) ∈ R, then R is symmetric.
But here, (1, 2) ∈ R but (2, 1) ∉ R
Non−transitive:
If p, q and r ∈ A such that (p, q) ∈ R and (q, r) ∈ R ⇒ (p, r) ∈ R,
then R is transitive.
Now here, (1,2) ∈ R and (2,3) ∈ R but (1,3) ∉ R
Thus, R is not transitive.
Exercise - 1B
Q1
Relation:
Let P and Q are two sets. Then, a relation R from P to Q is a
subset of P x Q.
Thus, R is a relation to P to Q ⇔ R ⊆ P x Q, if (p, q) ∈ R, we can
say that ‘p is related to q’ and can write as ‘p R q’. And if (p,
q) ∉ R, we can say that ‘p is not related to q’ and can write as ‘p R
q’.
Domain:
The set of all first elements or x-coordinates of the ordered pairs is
called Domain.

Range:
The set of all second elements or y-coordinates of the ordered pairs
is called Range.
Q2
Let R = {(∆1, ∆2): ∆1 ~ ∆2} be a relation defined on A. (Given)
Now,
Reflexivity:
Let Δ be an arbitrary element of A
we have,
Δ ~ Δ since, every triangle is similar to itself.
⇒ (Δ, Δ) ∈ R and Δ ∈ A
Symmetric:
Let ∆1 and ∆2 ∈ A, such that (∆1, ∆2) ∈ R
⇒ ∆1 ~ ∆2
⇒ ∆2 ~ ∆1
⇒ (∆2, ∆1) ∈ R
Thus, R is symmetric

Transitivity:
Let ∆1, ∆2, ∆3 ∈ A such that (∆1, ∆2) ∈ R and (∆2, ∆3) ∈ R
⇒ ∆1 ~ ∆2 and ∆2 ~ ∆3
⇒ ∆1 ~ ∆3
⇒ (∆1, ∆3) ∈ R
Q3
R = {(a, b): a, b ∈ Z and (a + b) is even} (Given)
Reflexivity:
Let a be an arbitrary element of Z
a + a = 2a
Since 2a is even
⇒ (a, a) ∈ R
Symmetric:
Let a and b ∈ Z, such that (a, b) ∈ R
⇒ a + b = even.

⇒ b + a = even.
⇒ (b, a) ∈ R
Thus, R is symmetric.
Transitivity:
Let a, b and c ∈ Z, such that (a, b) ∈ R and (b, c) ∈ R
⇒ a + b = 2k (which is an even)
and b + c = 2l (which is an even)
Adding both the above equations, we get
⇒ a +c + 2b = 2(k + l)
⇒ a + c = 2(k + l) - 2b
⇒ a + c is an even number
⇒ (a, c) ∈ R
Q4
R = {(a, b) : a, b ∈ Z and (a - b) is divisible by 5} (Given)
Reflexivity:
Let a be an arbitrary element of Z

a−a=0
Since 0 is divisible by 5
⇒ (a, a) ∈ R
Symmetric:
Let a and b ∈ Z, such that (a, b) ∈ R
⇒ a − b is divisible by 5.
⇒ a – b = 5m
⇒ b – a = −5m
⇒ b − a is also divisible by 5.
⇒ (b, a) ∈ R
Transitivity:
Let a, b and c ∈ Z, such that (a, b) ∈ R and (b, c) ∈ R
⇒ a – b = 5p
And b − c is divisible by 5
⇒ b – c = 5q
⇒ a – c = 5(p +q)
⇒ a − c is also divisible by 5.
⇒ (a, c) ∈ R
Q5
R = {(a, b) : a, b ∈ A and |a – b| is even} where A = {1, 2, 3, 4, 5}
(Given)
Reflexivity:
Let a be an arbitrary element of A
|a-a| = 0
Since 0 is even
⇒ (a, a) ∈ R
Symmetric:
Let a and b ∈ A, such that (a, b) ∈ R
⇒ |a-b| = even.
⇒ |b-a| = even.
⇒ (b, a) ∈ R

Transitivity:
Let a, b and c ∈ A, such that (a, b) ∈ R and (b, c) ∈ R
⇒ |a – b| is even and |b – c| is even
This is possible only when a and b both are even or odd and b and c
both are even or odd.
Now two cases arise:
Case I: If b is an even
Let (a, b) ∈ R and (b, c) ∈ R
Since b is even
⇒ a is even and c is even
⇒ |a – c| is even
⇒ (a, c) ∈ R
Case II: If b is an odd
Let (a, b) ∈ R and (b, c) ∈ R
⇒ Since b is odd
⇒ a is odd and c is odd
Since difference of two odd numbers is even
⇒ |a – c| is even
⇒ (a, c) ∈ R
Q6
Reflexivity:
Let a and b be an arbitrary element of N × N
⇒ (a, b) ∈ N × N
⇒ (a, b) ∈ N
⇒a+b=b+a
⇒ (a, b) R (b, a)
Symmetric:
Let (a, b) and (c, d) ∈ N × N such that (a, b) R (c, d)
⇒a+d=b+c
⇒b+c=a+d
⇒c+b=d+a
⇒ (c, d) R (a, b)
Transitivity:

Let (a, b), (c, d), (e, f) ∈ N × N such that (a, b) R (c, d) and (c, d) R
(e, f)
⇒ a + d = b + c and c + f = d + e
Adding both the equations we get
⇒a+d+c+f=b+c+d+e
⇒a+f=b+e
⇒ (a, b) R (e, f)
⇒ R is transitive.
Q7
R = {(a, b) : a, b ∈ S and a = ± b}. (Given)
Reflexivity:
Let a be an arbitrary element of S
a = ±a
⇒ (a, a) ∈ R
Symmetric:
Let a and b ∈ S, such that (a, b) ∈ R

⇒ a = ±b
⇒ b = ±a
⇒ (b, a) ∈ R
Transitivity:
Let a, b and c ∈ S, such that (a, b) ∈ R and (b, c) ∈ R
⇒ a = ±b and b = ±c
⇒ a = ±c
⇒ (a, c) ∈ R
Q8
R = {(A, B) : d(A, B) < 2 units}, where d(A, B) is the distance
between the points A and B. (Given)
Reflexivity:
Let A be an arbitrary element of S
⇒ d(A,A) < 2
⇒ (A, A) ∈ R
Symmetric:

Let A and B ∈ S, such that (A, B) ∈ R
⇒ d(A, B) < 2
⇒ d(B, A) < 2
⇒ (B, A) ∈ R
Non−Transitivity:
Let A, B and C ∈ S, such that (A, B) ∈ R and (B, C) ∈ R
Let the points A(0, 0), B(1.5, 0) and C(3, 0).
⇒d(A, B) = 1.5 units < 2 units
⇒d(B, C) = 1.7 units < 2 units
⇒d(A,C) = 3 which is not less than 2
⇒ (A, B) ∈ R and (B,C) ∈ R ⇒ (A,C) ∉ R
Hence, R is reflexive, symmetric but not transitive.
Q9
R = {(a, b): a2 + b2 = 1} and a, b ∈ S (Given)
Non−Reflexivity:
Let a be an arbitrary element of S
a2 + a2 = 2a2, which is not equal to 1
⇒ (a, a) ∉ R
Symmetric:
Let a and b ∈ S, such that (a, b) ∈ R
⇒ a2 + b 2 = 1
⇒ b2 + a2 = 1 (As addition is commutative)
⇒ (b, a) ∈ R
Non−Transitivity:
⇒ a2 + b2 = 1 and b2 + c2 = 1
Adding both the equation, we get
⇒ a2 + b 2 + b 2 + c 2 = 1 + 1
⇒ a2 + 2b2 + c2 = 2
⇒ a2 + c2 = 2 − 2b2 , which is not equal to 1
⇒ (a, c) ∉ R
Hence, R is symmetric but neither transitive nor reflexive.
Q10
R = {(a, b): a = b2} for all a, b ∈ N (Given)
Non−Reflexivity:
Let a be an arbitrary element of N
Here, a should be equal to a2 but it can’t be possible
⇒ (a, a) ∉ R
Non−Symmetric:
Let a and b ∈ N, such that (a, b) ∈ R
⇒ a = b2
But it not possible that b = a2
⇒ (b, a) ∉ R
Non−Transitivity:
⇒ a = b2 and b = c2
So, we can say that a ≠ c2
⇒ (a, c) ∉ R
Hence, R is neither transitive nor reflexive nor symmetric.
Q11
R = {(a, b): a > b} on N (given)
Non−Reflexivity:

Let a be an arbitrary element of N
a cannot be greater than a
⇒ (a, a) ∉ R
(ii) Symmetric:
Let a and b ∈ N, such that (a, b) ∈ R
⇒a>b
⇒ b cannot be greater than a
⇒ (b, a) ∉ R
(iii) Transitivity:
Let a, b and c ∈ N, such that (a, b) ∈ R and (b, c) ∈ R
⇒ a > b and b > c
⇒a>c
⇒ (a, c) ∈ R
Hence, R is transitive but neither symmetric nor reflexive.
Q12
A = {1, 2, 3} and R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} (Given)
R is reflexive if a ∈ A and (a, a) ∈ R
Here, (1, 1), (2, 2), (3, 3) ∈ R
R is symmetric if (a, b) ∈ R then (b, a) ∈ R
Here, (1, 2) ∈ R but (2, 1) ∉ R
R is transitive if (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R
Here, (1, 2) ∈ R and (2, 3) ∈ R but (1, 3) ∉ R
Q13
A = {1, 2, 3, 4} and R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (1, 3),
(3, 2)} (Given)
Here, (1, 1), (2, 2), (3, 3), (4, 4) ∈ R
Here, (1, 2) ∈ R but (2, 1) ∉ R
Here, (1, 3) ∈ R and (3, 2) ∈ R but (1, 2) ∈ R
Objective Questions
Q1
A = {1, 2, 3} and R = {(1, 1), (2, 2), (3, 3), (1, 3), (3, 2), (1, 2)}
(Given)
Here, (1, 1), (2, 2), (3, 3) ∈ R
Here, (1, 3) ∈ R but (3, 1) ∉ R
Here, (1, 3) ∈ R and (3, 2) ∈ R and so, (1, 2) ∈ R
Hence, R is reflexive and transitive but not symmetric.
Therefore, Option B is correct.
Q2
A = {a, b, c}and R = {(a, a), (a, b), (b, a)} (Given)
Here, (b, b) and (c, c) ∉ R

Here, (a, b) ∈ R but (b, a) ∈ R
Here, (a, b) ∈ R and (b, a) ∈ R and so, (a, a) ∈ R
Hence, R is transitive and symmetric but not reflexive.
Therefore, Option C is correct.
Q3
A = {1, 2, 3} and R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3,
2)} (Given)
Here, (1, 1), (2, 2), (3, 3) ∈ R
Here, (1, 2) ∈ R but (2, 1) ∈ R
Here, (1, 2) ∈ R and (2, 3) ∈ R but (1, 3) ∉ R
Hence, R is reflexive and symmetric but not transitive.
Therefore, Option A is correct.
Q4
S be the set of all straight lines in a plane. Let R be a relation on S
defined by a R b ⇔ a ⊥ b. (Given)
⇒ S = {x, y, z}and R = {(x, y), (y, z), (x, z) , (y, x), (z, y), (z, x)}
Here, (x, x), (y, y), (z, z) ∉ R
Here, (x, y) ∈ R and (y, x) ∈ R
Here, (x, y) ∈ R and (y, x) ∈ R but (x, x) ∉ R
Hence, R is symmetric but neither reflexive nor transitive.

Q5
S be the set of all straight lines in a plane. Let R be a relation on S
defined by a R b ⇔ a || b.
⇒ S = {x, y, z} and R = {(x, x), (y, y), (z, z)}
Here, (x, x), (y, y), (z, z) ∈ R
Here, (x, x) ∈ R and (x, x) ∈ R
Here, (x, x) ∈ R and (x, x) ∈ R but (x, x) ∈ R
Therefore, Option D is correct.
Q6
Z be the set of all integers and let R be a relation on Z defined by a
R b ⇔ (a - b) is divisible by 3 (Given)
Here,
a−a=0
Since 0 is divisible by 3
⇒ (a, a) ∈ R
Here,
⇒ a – b = 3m
⇒ b – a = −3m
⇒ b − a is also divisible by 3.
⇒ (b, a) ∈ R
Here,
⇒ a − b is divisible by 3
⇒ a – b = 3p
And b − c is divisible by 3
⇒ b – c = 3q
⇒ a – c = 3(p +q)
⇒ a − c is also divisible by 3.
⇒ (a, c) ∈ R
Q7
R be a relation on the set N of all natural numbers, defined by a R
b ⇔ a is a factor of b (given)
Here,
a is factor of a
⇒ (a, a) ∈ R
Here,
⇒ a is factor of b
But it is not possible that b is factor of a
⇒ (b, a) ∉ R
Here,

⇒ a is factor of b and b is factor of c
⇒ a is factor of c
⇒ (a, c) ∈ R
Q8
Let Z be the set of all integers and let R be a relation on Z defined
by a R b ⇔ a≥ b (Given)
⇒ Z = {1, 2, 3, 4 …..}and R = {(a, b) : a, b ∈ Z and a ≥ b}
Here,
a≥a
b≥b
Here,
a≥b
⇒ b cannot be greater than a
⇒ (b, a) ∉ R

Here,
a≥b
b≥c
⇒a≥c
⇒ (a, c) ∈ R
Q9
Let S be the set of all real numbers and let R be a relation on S
defined by a R b ⇔ |a| ≤ b. (Given)
Here,
|a| ≤ a
But it is not possible in every case, like :
|−2| cannot be smaller than −2.

Here,
|a| ≤ b
⇒|b| cannot be smaller than a
⇒ (b, a) ∉ R
Here,
|a| ≤ b
|b| ≤ c
⇒ |a| ≤ c
⇒ (a, c) ∈ R
Hence, R is transitive but neither reflexive nor symmetric.
Q10
Let S be the set of all real numbers and let R be a relation on S,
defined by a R b ⇔ |a – b| ≤ 1 (Given)
Here,
|a − a| ≤ 1

Since it is always true
Here,
|a − b| ≤ 1
⇒|b − a| ≤ 1
⇒ (b, a) ∈ R
Here,
|a − b| ≤ 1
|b − c| ≤ 1
But |a − c| ≤ 1 cannot be always true.
⇒ (a, c) ∉ R
Q11
Let S be the set of all real numbers and let R be a relation on S,
defined by a R b ⇔ (1 + ab) > 0 (Given)

Here,
1 + a×a > 0
Since it is always true
Here,
(1 + ab) > 0
⇒ (1 + ba) > 0
⇒ (b, a) ∈ R
Here,
(1 + ab) > 0
(1 + bc) > 0
But (1 + ac) > 0 will not be always true
⇒ (a, c) ∉ R

Q12
Let S be the set of all triangles in a plane and let R be a relation on
S defined by ∆1 S ∆2⇔ ∆1 ≡ A2 (Given)
Reflexivity:
Let Δ be an arbitrary element of S
we have,
since every triangle is congruent to itself.
⇒ (Δ, Δ) ∈ R and Δ ∈ S
Symmetric:
Let ∆1 and ∆2 ∈ S, such that (∆1, ∆2) ∈ R
Since ∆1 is congruent to ∆2
⇒ ∆2 is also congruent to ∆1
⇒ (∆2, ∆1) ∈ R
Thus, R is symmetric
Transitivity:
Let ∆1, ∆2, ∆3 ∈ S such that (∆1, ∆2) ∈ R and (∆2, ∆3) ∈ R
⇒ ∆1 is congruent to ∆2 and ∆2 is congruent to ∆3
⇒ ∆1 is congruent to ∆3
⇒ (∆1, ∆3) ∈ R

Q13
Let S be the set of all real numbers and let R be a relation on S
defined by a R b ⇔ a2 + b2 = 1 (Given)
Here,
a2 + a 2 = 1
But it cannot be always true.
Here,
a2 + b 2 = 1
⇒ b2 + a2 = 1
⇒ (b, a) ∈ R
Here,
a2 + b 2 = 1
b2 + c2 = 1

But a2 + c2 = 1 will not be always true
⇒ (a, c) ∉ R
Hence, R is symmetric but neither reflexive nor transitive.
Q14
Let R be a relation on N × N, defined by
(a, b) R (c, d) ⇔ a + d = b + c
Reflexivity:
Let a and b be an arbitrary element of N × N
⇒ (a, b) ∈ N × N
⇒ (a, b) ∈ N
⇒a+b=b+a
⇒ (a, b) R (b, a)
Symmetric:
Let (a, b) and (c, d) ∈ N × N such that (a, b) R (c, d)
⇒a+d=b+c
⇒b+c=a+d
⇒c+b=d+a
⇒ (c, d) R (a, b)
Transitivity:
Let (a, b), (c, d), (e, f) ∈ N × N such that (a, b) R (c, d) and (c, d) R
(e, f)
⇒ a + d = b + c and c + f = d + e
Adding both the equations we get
⇒a+d+c+f=b+c+d+e
⇒a+f=b+e
⇒ (a, b) R (e, f)
⇒ R is transitive.
Q15
Let A be the set of all points in a plane and O be the origin. (Given)
Then, R = {(P, Q) : P, Q ∈ A and OP = OQ)}
Now,
Reflexivity:

For any point P, we have
OP=OP
⇒ (P, P) ∈ R
Thus, (P, P) ∈ R for all P ∈ A
Hence, R is reflexive.
Symmetric:
Let P and Q inset A such that,
(P, Q) ∈ R
⇒ OP = OQ
⇒ OQ = OP
⇒ (Q, P) ∈ R
Thus, (P, Q) ∈ R ⇒ (Q,P) ∈ R and (P, Q) ∈ A
Hence, R is symmetric.
Transitivity:
Let P, Q and S are three points in set A, such that (P, Q) ∈ R and
(Q, S) ∈ R
⇒ OP = OQ and OQ = OS
⇒ OP = OS
⇒ (P, S) ∈ R
Q16
Let Q be the set of all rational numbers, and * be the binary
operation, defined by a * b = a + 2b (Given)
For Commutative:
If a * b = a + 2b is true,
Then, b * a = b + 2a cannot be true.
Thus, * is not commutative.
For Associative:
(a * b) * c
= (a + 2b) * c
= a + 2b + 2c
Now,
a * (b * c)
= a * (b + 2c)
= a + 2(b + 2c)
= a + 2b + 4c
⇒ (a * b) * c ≠ a * (b * c)
Thus, * is not associative.

Q17
Let a * b = a + ab for all a, b ∈ Q (Given)
For Commutative:
If a * b = a + ab is true,
Then, b * a = b + ba cannot be true.
For Associative:
(a * b) * c
= (a + ab) * c
= a + ab + (a + ab)c
= a + ab + ac + abc
Now,
a * (b * c)
= a * (b + bc)
= a + a(b + bc)
= a + ab + abc
⇒ (a * b) * c ≠ a * (b * c)

Q18
Let Q+ be the set of all positive rationals. Then, the operation * on
Q+ defined by for all a, b ∈ Q+ (Given)

For Commutative:
𝑎𝑏
If a * b = is true,
2
𝑏𝑎
Then, b * a = will always be true.
2
Thus, * is commutative.
For Associative:
(a * b) * c
𝑎𝑏
=(2)*c
𝑎𝑏𝑐
= 4
Now,
a * (b * c)
𝑏𝑐
=a*(2)
𝑎𝑏𝑐
= 4
⇒ (a * b) * c = a * (b * c)
Thus, * is associative.

Q19
Let Z be the set of all integers and let a * b = a – b + ab (Given)
For Commutative:
If a * b = a – b + ab is true,
Then, b * a = b – a + ba cannot be true.
For Associative:
(a * b) * c
= (a – b + ab) * c
= a – b + ab – c + (a – b + ab)c
= a – b + ab − c + ac – bc + abc
Now,
a * (b * c)
= a * (b – c + bc)
= a − (b – c + bc) + a(b – c + bc)
= a − b + c – bc + ab – ac + abc
⇒ (a * b) * c ≠ a * (b * c)

Q20
Let Z be the set of all integers. Then, the operation * on Z defined
by a * b = a + b – ab (Given)
For Commutative:
If a * b = a + b − ab is true,
Then, b * a = b + a − ba will always be true.
For Associative:
(a * b) * c
= (a + b − ab) * c
= a + b – ab + c − (a + b − ab)c
= a + b − ab + c – ac − bc + abc
Now,
a * (b * c)
= a * (b + c − bc)
= a + (b + c − bc) − a(b + c − bc)
= a + b + c – bc − ab – ac + abc
⇒ (a * b) * c = a * (b * c)

Q21
Let Z+ be the set of all positive integers. Then, the operation * on
Z+ defined by a * b = ab (Given)
For Commutative:
If a * b = ab is true,
Then, b * a = ba cannot be true.
For Associative:
(a * b) * c
= (ab) * c
= (ab)c
Now,
a * (b * c)
= a * (bc)
=
⇒ (a * b) * c ≠ a * (b * c)
Q22
Define * on Q - {-1} by a * b= a + b + ab (Given)

For Commutative:
If a * b = a + b + ab is true,
Then, b * a = b + a + ba will always be true.
For Associative:
(a * b) * c
= (a + b + ab) * c
= a + b + ab + c + (a + b + ab)c
= a + b + ab + c + ac + bc + abc
Now,
a * (b * c)
= a * (b + c + bc)
= a + (b + c + bc) + a(b + c + bc)
= a + b + c + bc + ab + ac + abc
⇒ (a * b) * c = a * (b * c)

Class 12 Maths Chapter 1 Solutions

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Class 12 Maths Chapter 1 Solutions

Uploaded by

Copyright:

Available Formats

CHAPTER-1 - Relations

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Hence, Domain(R) = {2, 3, 4}

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Q+ defined by for all a, b ∈ Q+ (Given)

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

Class XII www.vedantu.com RS Aggarwal Solutions

You might also like