Set Theory and Relations 13

14. (b) n(A) = 40% of 10,000 = 4,000 29. (a) The number of non- empty subsets = 2 n  1
n(B) = 20% of 10,000 = 2,000 2 4  1  16  1  15 .
n(C) = 10% of 10,000 = 1,000 30. (b) Given A  {1, 2}  {1, 2, 3, 5, 9} . Hence, A  {3, 5,9} .
n (A  B) = 5% of 10,000 = 500 31. (b) Since A  B  B,  B  A .
n (B  C) = 3% of 10,000 = 300
32. (c) Let x  A  x  A  B , [ A  A  B]
n(C  A) = 4% of 10,000 = 400
 x  A  B , [ A  B  A  B]
n(A  B  C) = 2% of 10,000 = 200
 x  A and x  B  x  B ,  A  B
We want to find n(A  Bc  Cc) = n[A  (B  C)c]
Similarly, x  B  x  A ,  B  A
= n(A) – n[A  (B  C)] = n(A) – n[(A  B)  (A  C)]
Now A  B, B  A  A  B .
= n(A) – [n(A  B) + n(A  C) – n(A  B  C)]
= 4000 – [500 + 400 – 200] = 4000 – 700 = 3300. 33. (b) A  B  A  A  B ,  A  B  A  B .
15. (c) n(C) = 20, n(B) = 50, n(C  B) = 10 34. (b)  y  e x , y  e  x will meet, when e x  e  x
Now n(C  B) = n(C) + n(B) – n(C  B)  e 2 x  1,  x  0, y  1
= 20 + 50 – 10 = 60.
 A and B meet on (0, 1),  A  B   .
Hence, required number of persons = 60%.
35. (a) A  B  {2, 3, 4 , 8 , 10 }  {3, 4 , 5, 10 , 12}
16. (d) n(M) = 23, n(P) = 24, n(C)= 19
n(M  P) = 12, n(M  C)= 9, n(P  C)= 7  {3, 4 , 10 } , A  C  {4 } .
n(M  P  C) = 4  ( A  B)  ( A  C )  {3, 4 , 10 } .
We have to find n(M  P  C), n(P  M   C ), 36. (a) A  ( A  B)  A , [ A  B  A] .
n ( C  M   P ) 37. (b) It is obvious.
Now n (M  P  C) = n[M  (P  C)] 38. (a) B  C  {a, b, c, d , e }
= n(M)– n(M  (P  C))  A  (B  C )  {a, b, c}  {a, b, c, d , e }  {a, b, c} .
= n(M )  n[(M  P )  (M  C )] 39. (a) A  (B  A)   , [ x  B  A  x  A] .
= n(M) – n(M  P)– n(M  C) + n(M  P  C) 40. (c) A  ( A  B)  A  ( A   B ) , ( ( A  B)  A   B  )
= 23 –12 – 9 + 4 = 27 –21 = 6  ( A  A )  B  , (by associative law)
n(P  M  C) = n[P  (M  C)]
   B , ( A  A    )
= n(P)– n[P  (M  C)] = n(P )  n[(P  M )  (P  C)]
 .
= n(P) – n(P  M) – n(P  C) + n(P  M  C)
41. (b) B   {1, 2, 3, 4 , 5, 8 ,9, 10 }
= 24 – 12 – 7 + 4 = 9
n(C  M   P )  n(C)  n(C  P)  n(C  M )  n(C  P  M )
 A  B   {1, 2, 5}  {1, 2, 3, 4 , 5, 8 , 9, 10 }  {1, 2, 5}  A
= 19 – 7 – 9 + 4 = 23 – 16 = 7. 42. (b) It is obvious.
43. (c) N 5  N 7  N 35 ,
17. (a) It is distributive law.
18. (b) It is De' Morgan law. [5 and 7 are relatively prime numbers].
19. (c) (A – B)  (B – A) = (A  B) – (A  B). 44. (a) 3 N  { x  N : x is a multiple of 3}
20. (b) A × B = {(2, 7), (2, 8), (2, 9), (4, 7), (4, 8), (4, 9), (5, 7), 7 N  { x  N : x is a multiple of 7}
(5, 8), (5, 9)}  3 N  7 N  {x  is a multiple of 3 and 7}
n(A × B) = n(A) . n(B) = 3 × 3 = 9.  { x  N : x is a multiple of 3 and 7}
21. (c) n( A  B)  pq .  { x  N : x is a multiple of 21}=21N.
22. (c) B  C = {c, d}  (d, e} = {c, d, e} 45. (d) It is obvious.
 A × (B  C) = {a, b} × {c, d, e} 46. (a) From Venn-Euler's diagram,
= {(a, c), (a, d), (a, e), (b, c), (b, d), (b, e)}.
U
23. (a,b) R  (P c  Q c )c  R  [(P c )c  (Q c )c ]
AB

= R  (P  Q )  ( R  P )  ( R  Q ) = ( R  Q )  ( R  P ) . A–B B–A
24. (d) It is fundamental concept.
25. (b) It is fundamental concept.
1 1 1 2  ( A  B)  (B  A)  ( A  B)  A  B .
26. (b) Since  0,  2,  , [ y  N ]
y y y 3 47. (a) From Venn-Euler's Diagram,
1
 can be 1, [ y can be 1]. (AB)' U
y
27. (d) Null set is the subset of all given sets.
(A'B)
28. (b) S  {0, 1, 5, 4 , 7} ,
A B
then, total number of subsets of S is 2 n .
Hence, 2 5  32 .  ( A  B)  ( A   B)  A  .
 14 Set Theory and Relations
48. (c) From Venn-Euler's Diagram, 57. (a) Let B, H, F denote the sets of members who are on the
basketball team, hockey team and football team
C U
C–A respectively.
ABC
Then we are given n (B)  21, n (H )  26 , n (F)  29
n (H  B)  14 , n (H  F)  15 , n (F  B)  12
A–B B–C
and n (B  H  F)  8 .
A B
Clearly, {( A  B)  (B  C )  (C  A)}  A  B  C . We have to find n (B  H  F) .

49. (c) Since A  B,  A  B  B . To find this, we use the formula

n ( B  H  F )  n ( B )  n ( H )  n (F )
So, n( A  B)  n(B)  6 .
n (B  H )  n ( H  F )  n ( F  B )  n ( B  H  F )
50. (c) n( A  B)  n( A)  n(B)  n( A  B)
Hence, n (B  H  F )  (21  26  29 )  (14  15  12 )  8  43
0 . 25  0 . 16  0 . 14  n( A  B)
Thus these are 43 members in all.
 n( A  B)  0 . 30  0 . 25  0 . 05 .
58. (d) n (M )  55 , n (P )  67 , n (M  P )  100
51. (c) Since A and B are disjoint,  A  B  
Now, n (M  P )  n (M )  n (P )  n (M  P )
n( A  B)  0
Now n ( A  B)  n( A)  n(B)  n( A  B) 100  55  67  n (M  P )

 n( A)  n(B)  0  n( A)  n(B) .  n (M  P )  122  100  22

52. (b) n( A  B)  n( A)  n (B)  n( A  B) . Now n (P only) = n (P )  n(M  P )  67  22  45 .

53. (a) Minimum value of n  100  (30  20  25  15 )) 59. (c) In general, A  B  B  A

A  B  B  A is true, if A = B.
 100  90  10 .
60. (b) From De’ morgan’s law, ( A  B)  A   B  .
54. (d) n (C )  224 , n (H )  240 , n (B)  336
61. (d) A  B  { x : x  A and x  B}
n (H  B)  64 , n(B  C )  80
 {x : x  A and x  B c }  A  B c .
n(H  C )  40 , n(C  H  B)  24
62. (a) It is obvious.
n (C c  H c  B C )  n [(C  H  B)c ]
63. (a) From De’ morgan’s law, A  (B  C )  ( A  B)  ( A  C ) .
 n()  n(C  H  B) 64. (b) From Distributive law, A  (B  C )  ( A  B)  ( A  C ) .
 800  [n(C )  n(H )  n(B)  n(H  C ) 65. (b) A  B  {1} and B  C  {4 }
n(H  B)  n(C  B)  n(C  H  B)] ( A  B)  (B  C )  {(1, 4 )} .
 800  [224  240  336  64  80  40  24 ] 66. (a) It is obvious.
 800  640  160 . 67. (b) A  B  {1, 2, 3, 8 } ; A  B  {3}
55. (c) Let A denote the set of Americans who like cheese and ( A  B)  ( A  B)  {(1, 3), (2,3), (3,3), (8 ,3)} .
let B denote the set of Americans who like apples.
Let Population of American be 100. 68. (c) A  B  {3}, A  B  {2,5}
Then n ( A)  63 , n (B)  76 ( A  B)  ( A  B)  {(3, 2); (3, 5)} .
Now, n ( A  B)  n( A)  n(B)  n( A  B) 69. (a) Given n( N )  12 , n(P )  16 , n(H )  18 ,
 63  76  n( A  B) n( N  P  H )  30
 n ( A  B)  n( A  B)  139 From, n( N  P  H )  n( N )  n(P )  n(H )  n( N  P )
 n ( A  B)  139  n( A  B) n(P  H )  n( N  H )  n( N  P  H )
But n ( A  B)  100  n( N  P )  n(P  H )  n( N  H )  16
Now, number of pupils taking two subjects
 n ( A  B)  100
 n( N  P )  n(P  H )  n( N  H )  3 n( N  P  H )
 139  n ( A  B)  139  100  39
 16  0  16 .
 n( A  B)  39 i.e., 39  n( A  B) .....(i) 70. (e) n( A)  4 , n(B)  3
Again, A  B  A, A  B  B n( A)  n(B)  n(C )  n( A  B  C)
 n ( A  B)  n ( A)  63 and n ( A  B)  n (B)  76 24
4  3  n(C)  24  n(C )  2.
 n( A  B)  63 …..(ii) 12
Then, 39  n ( A  B)  63  39  x  63 . 71. (c) Given set is {(a, b ) : 2 a 2  3 b 2  35 , a, b  Z}
56. (a) Let n (P ) = Number of teachers in Physics.
We can see that, 2(2)2  3(3)2  35
n (M ) = Number of teachers in Maths
and 2(4 )2  3(1)2  35
n (P  M )  n(P )  n (M )  n (P  M )
 (2, 3), (2, –3), (–2, –3), (–2, 3), (4, 1), (4, –1),
20  n (P )  12  4  n (P )  12 . (–4, –1), (–4, 1) are 8 elements of the set.  n  8 .
 Set Theory and Relations 15
72. (c) It is obvious. 4. (b) R  {(a, b ) : a, b  N , a  b  3}  {((n  3), n) : n  N }
73. (a) A  B  {1, 2, 3, 4 , 5, 6}  {(4 , 1), (5, 2), (6, 3), .....} .
 ( A  B )  C  {3 , 4 , 6 } . 5. (b) R = {(2, 1), (4, 2), (6, 3),......}.
74. (d) It is obvious. So, R 1 = {(1, 2), (2, 4), (3, 6),.....}.
75. (d) Let the original set contains (2n  1) elements, then 6. (a) Since (1, 1); (2, 2); (3, 3)  R therefore R is reflexive. (1,
subsets of this set containing more than n elements, i.e., 2)  R but (2, 1)  R, therefore R is not symmetric. It
subsets containing (n  1) elements, (n  2) elements, can be easily seen that R is transitive.
……. (2n  1) elements. 7. (b) Since x  y, y  z  x  z  x , y, z  N
 Required number of subsets  x R y, yR z  x R z ,  Relation is transitive,
2n 1 2n 1 2n 1 2n 1
 Cn 1  C n  2  ....  C 2n  C 2n 1  x  y does not give y  x ,
 2 n 1
Cn  2 n 1
Cn 1  ...  2 n 1
C1  2 n 1
C0  Relation is not symmetric.
Since x  x does not hold, hence relation is not
 2 n 1 C 0  2 n 1
C1  2 n 1
C 2  ...  2 n 1
Cn 1  2 n 1
Cn reflexive.


1
2
 1

(1  1)2n  1  [2 2 n 1 ]  2 2 n .
2
8. (b) Obviously, the relation is not reflexive and transitive
but it is symmetric, because x 2  y 2  1  y 2  x 2  1 .
76. (a) It is obvious. 9. (b) Since R is an equivalence relation on set A,
77. (b) A  {4 , 8 , 12 , 16 , 20 , 24 , .....} therefore (a, a)  R for all a  A . Hence, R has at least n
B  {6, 12, 18 , 24 , 30 , ....} ordered pairs.

 A  B  {12, 24 , ....} = {x : x is a multiple of 12}. 10. (a) For any x  R, we have x  x  2  2 an irrational
number.
78. (c) n(M alone)  n(M )  n(M  C )  n(M  P )  n(M  P  C )
 xRx for all x. So, R is reflexive.
M P R is not symmetric, because 2R1 but 1 R 2 , R is not
transitive also because 2 R1 and 1R 2 2
but 2 R 2 2 .
C
11. (b) Clearly, the relation is symmetric but it is neither
 100  28  30  18  60 . reflexive nor transitive.
79. (d) A  B  A  ( A  B) is correct. 12. (a) It is obvious.
A  ( A  B)  ( A  B) is correct. 13. (b) It is obvious.
A B 14. (c) We have, R = {(1, 3); (1, 5); (2, 3); (2, 5); (3, 5); (4, 5)}
R 1  {(3, 1), (5, 1), (3, 2), (5, 2); (5, 3); (5, 4)}
Hence RoR 1 = {(3, 3); (3, 5); (5, 3); (5, 5)}.
15. (d) A relation from P to Q is a subset of P  Q .
A–B A – (A  B)
(3) is false. 16. (c) R  A  B .
 (1) and (2) are true. 17. (c) Number of relations on the set A  Number of subsets
80. (b) n(( A  B)  (B  A)) 2
of A  A  2 n , [ n( A  A)  n 2 ] .
 n(( A  B)  (B  A))  n( A  B).n(B  A) 18. (a) It is obvious.
 n( A  B).n( A  B)  (99 )(99 )  99 . 2
19. (a) Since R is reflexive relation on A, therefore (a, a)  R for
81. (d) n( A  B)  n( A)  n(B)  n( A  B)  12  9  4  17 all a  A .
The minimum number of ordered pairs in R is n.
Now, n(( A  B)C )  n(U)  n( A  B)  20  17  3 .
Hence, m  n .
Relations 20. (d) Here R  {( x , y ) :| x 2  y 2 |  16 }

1. (a) n( A  A)  n( A).n( A)  3 2  9 and given A  {1, 2, 3, 4 , 5}

 R  {(1, 2)(1, 3) (1, 4 ); (2, 1)(2, 2)(2, 3)(2, 4 );(3, 1)(3, 2)
So, the total number of subsets of A  A is 2 9 and a
subset of A  A is a relation over the set A. (3, 3)(3, 4 );(4 , 1)(4 , 2) (4 , 3);(4 , 4 )(4 , 5 ), (5, 4 )(5, 5 )} .
2. (a,b,c) R4 is not a relation from X to Y, because (7, 9)  R 4 21. (d) Given, xRy  x is relatively prime to y.
but (7, 9)  X  Y .  Domain of R  {2, 3, 4 , 5} .
3. (c) Here n( A  B) = 2 × 3 = 6
22. (c) R be a relation on N defined by x  2 y  8 .
Since every subset of A × B defines a relation from A to
 R{(2, 3); (4 , 2); (6, 1)}
B, number of relation from A to B is equal to number of
subsets of A  B  2 6  64 . Hence, Domain of R  {2, 4 , 6} .
 16 Set Theory and Relations
23. (c)  R  {( x , y ) | x , y  Z, x 2  y 2  4 } 41. (d) It is obvious.
42. (d) It is obvious.
 R  {(2, 0 ), (1, 0 ), (1, 1), (0,  1)(0, 1), (0, 2), (0,2) 43. (d) It is obvious.
(1, 0 ), (1, 1), (2, 0 )} 44. (c) x  3 (mod 7 )  x  3  7 p, ( p  z )
Hence, Domain of R  {2,  1, 0, 1, 2 } .  x  7 p  3, p  z i.e., {7 p  3 : p  z ) .
24. (a) R is a relation from {11, 12, 13}to {8, 10, 12} defined by 45. (b) Given, R and S are relations on set A.
y  x 3  x y  3  R  A  A and S  A  A  R  C  A  A
 R = {11, 8},{13, 10}.  R  S is also a relation on A.
Hence, R 1  {8 , 11}; {10 , 13 } . Reflexivity : Let a be an arbitrary element of A. Then,
a  A  (a, a)  R and (a, a)  S ,
25. (a) It is obvious.
[R and S are reflexive]
26. (b) It is obvious.
 (a, a)  R  S
27. (a,b) (1, 1)(2, 2)(3, 3)(4, 4)  R ;  R is reflexive.
 (1, 2) (3, 1)  R and also (2, 1)(1, 3)  R . Thus, (a, a)  R  S for all a  A .
Hence, R is symmetric. But clearly R is not transitive. So, R  S is a reflexive relation on A.
28. (b) For any integer n, we have n | n  n R n Symmetry : Let a, b  A such that (a, b )  R  S .
So, n R n for all n  Z  R is reflexive Then, (a, b )  R  S  (a, b )  R and (a, b )  S
 (b, a)  R and (b, a)  S ,
Now 2|6 but 6+2, (2,6)  R but (6, 2)  R
[R and S are symmetric]
So, R is not symmetric.
 (b, a)  R  S
Let (m , n)  R and (n, p )  R .
Thus, (a, b )  R  S
(m , n)  R  m | n   (b, a)  R  S for all (a, b )  R  S .
Then   m | p  (m , p )  R
(n, p )  R  n | p  So, R  S is symmetric on A.
So, R is transitive. Transitivity : Let a, b, c  A such that (a, b )  R  S
Hence, R is reflexive and transitive but it is not and (b, c)  R  S . Then, (a, b )  R  S and
symmetric. (b, c)  R  S
29. (a) For any a  N , we find that a|a, therefore R is reflexive
 {((a, b )  R and (a, b )  S )}
but R is not transitive, because aRb does not imply
that bRa . and {((b, c)  R and (b,c )  S }
30. (b) Let (a, b )  R  {(a, b )  R, (b, c)  R} and {(a, b )  S , (b, c)  S }
Then, (a, b )  R  (b, a)  R 1
, [By def. of R 1
]  (a, c)  R and (a, c)  S
 (b, a)  R , [ R  R ] 1  R and S are transitive So

So, R is symmetric. (a,b )  R and (b,c )  R  (a, c)  R
31. (c) It is obvious. (a,b )  S and (b, c)  S  (a, c)  S
32. (b) The relation is not symmetric, because A  B does not  (a, c)  R  S
imply that B  A . But it is anti-symmetric because Thus, (a, b )  R  S and (b, c)  R  S  (a, c)  R  S .
A  B and B  A  A=B.
So, R  S is transitive on A.
33. (c) It is obvious.
Hence, R is an equivalence relation on A.
34. (c) Since x  x , therefore R is not reflexive. Also x  y
46. (b, c, d) These are fundamental concepts.
does not imply that y  x , So R is not symmetric. Let 47. (c) Here R  {(1, 3), (2, 2);(3, 2)} , S  {(2, 1); (3, 2);(2, 3)}
x R y and y R z . Then, x  y and y  z  x  z i.e., Then RoS  {(2, 3); (3, 2);(2, 2)} .
x R z . Hence R is transitive. 48. (b) Here R           
35. (b,c) x is a brother of y, y is also brother of x. Hence, R is symmetric.
So, it is symmetric. Clearly it is transitive. 49. (d) We have (a, b )R(a, b ) for all (a, b )  N  N
36. (c) Since (1, 1)  R so, is not reflexive.
Since a  b  b  a . Hence, R is reflexive.
Now (1, 2)  R but (2,1)  R , therefore R is not R is symmetric for we have (a, b )R (c, d )  a  d  b  c
symmetric Clearly R is transitive.  d  a  c  b  c  b  d  a  (c, d )R(e , f ).
37. (b) The void relation R on A is not reflexive as (a, a)  R for Then by definition of R, we have
any a  A . The void relation is symmetric and a  d  b  c and c  f  d  e ,
transitive. whence by addition, we get
38. (b) For any a  R , we have a  a, Therefore the relation R a  d  c  f  b  c  d  e or a  f  b  e
is reflexive but it is not symmetric as (2, 1)  R but Hence, (a, b ) R (e , f )
(1, 2)  R . The relation R is transitive also, because
Thus, (a, b) R(c, d ) and (c, d )R(e , f )  (a, b )R (e , f ) .
(a, b )  R, (b, c)  R imply that a  b and b  c which is
turn imply that a  c . 50. (a,b,c,d) It is obvious.
39. (a) It is obvious. 51. (c) Here (3, 3), (6, 6), (9, 9), (12, 12), [Reflexive];
40. (c) It is obvious. (3, 6), (6, 12), (3, 12), [Transitive].
 Set Theory and Relations 17
Hence, reflexive and transitive only. Clearly, A  B consists of four points.
52. (b) It is obvious. 5. (b) A – B = A  Bc = A  B .
53. (c) Given A = {1, 2, 3, 4} 6. (a) Clearly, A = {2, 3}, B = {2, 4}, C = {4, 5}
R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} B  C = {4}
(2, 3)  R but (3, 2)  R. Hence R is not symmetric.  A × (B  C) = {(2, 4); (3, 4)}.
R is not reflexive as (1, 1)  R. 7. (c) Let number of newspapers be x. If every students reads
R is not a function as (2, 4)  R and (2, 3)  R. one newspaper, the number of students would be
R is not transitive as (1, 3)  R and (3, 1)  R but (1, 1) x (60 )  60 x
 R. Since, every students reads 5 newspapers
54. (d) Total number of reflexive relations in a set with n x  60
 Numbers of students   300 , x  25 .
elements  2 n . 5
Therefore, total number of reflexive relation set with 4 8. (c) Here A and B sets having 2 elements in common, so
elements  2 4 . A  B and B  A have 2 2 i.e., 4 elements in common.
55. (a) Since 1  a.a  1  a 2  0 , a  S ,  (a, a)  R Hence, n [( A  B)  (B  A)]  4 .
 R is reflexive. 9. (c) (x , y )  R  (y , x )  R 1 ,  R 1  {(3, 1), (5, 1), (1, 2)} .
Also (a, b )  R  1  ab  0  1  ba  0  (b, a)  R , 10. (a) | a  a |  0  1 a R a  a  R
 R is symmetric.  R is reflexive.
 (a, b )  R and (b, c)  R need not imply (a, c)  R . Again a R b  | a  b |  1 | b  a |  1  bRa
Hence, R is not transitive. 1 1 1
 R is symmetric, Again 1R and R1 but  1
56. (a) A  {2, 4 , 6} ; B  {2, 3, 5} 2 2 2
 A  B contains 3  3  9 elements.  R is not anti-symmetric.
Further, 1 R 2 and 2 R 3 but 1 R 3 , [ | 1  3 |  2  1 ]
Hence, number of relations from A to B  2 9 .
 R is not transitive.
11. (d) Since A  A .  Relation ' ' is reflexive.
Critical Thinking Questions Since A  B, B  C  A  C
 Relation ' ' is transitive.
1. (a) Since 8 n  7 n  1  (7  1)n  7 n  1
But A  B,  B  A ,  Relation is not symmetric.
 7 n  n C1 7 n  1  n C 2 7 n  2  .....  n Cn  1 7  n C n  7 n  1 12. (d) Since n | n for all n  N , therefore R is reflexive. Since 2
 n C 2 7 2  n C 3 7 3  ..  n Cn 7 n , (n C 0  n C n , n C1  n C n 1 etc.) | 6 but 6 | 2 , therefore R is not symmetric.
Let n R m and m R p  n|m and m|p  n|p  nRp. So, R
 49 [n C 2  n C 3 (7 )  ......  n Cn 7 n  2 ]
is transitive.
 8 n  7 n  1 is a multiple of 49 for n  2 13. (a) Let A  {1, 2, 3} and R = {(1, 1), (1, 2)}, S = {(2, 2) (2, 3)}
n
For n  1 , 8  7 n  1  8  7  1  0 ; be transitive relations on A.
n
For n  2, 8  7 n  1  64  14  1  49 Then R  S = {(1, 1); (1, 2); (2, 2); (2, 3)}
Obviously, R  S is not transitive. Since (1, 2)  R  S
 8 n  7 n  1 is a multiple of 49 for all n  N . and (2, 3)  R  S but (1, 3)  R  S .
 X contains elements which are multiples of 49 and
14. (a) We first find R 1 , we have
clearly Y contains all multiplies of 49.  X  Y .
2. (b) N 3  N 4  {3, 6, 9, 12,15 ......}  {4 , 8 , 12, 16 , 20 ,.....} R 1  {(5, 4 ); (4 , 1); (6, 4 ); (6, 7 ); (7, 3)} . We now obtain

= {12, 24, 36......} = N 12 . the elements of R 1 oR we first pick the element of R

Trick : N 3  N 4  N 12 and then of R 1 . Since (4 , 5 )  R and (5, 4 )  R 1 , we

[ 3, 4 are relatively prime numbers]. have (4 , 4 )  R 1 oR

3. (b) n(A  B) = n(A) + n(B) – n(A  B) = 3  6  n( A  B) Similarly, (1, 4 )  R, (4 , 1)  R 1  (1, 1)  R 1 oR
Since, maximum number of elements in A  B  3 (4 , 6 )  R, (6, 4 )  R 1  (4 , 4 )  R 1 oR ,
 Minimum number of elements in A  B  9  3  6 .
(4 , 6 )  R, (6, 7)  R 1  (4 , 7 )  R 1 oR
4. (d) A = Set of all values (x, y) : x 2  y 2  25  5 2
(7, 6 )  R, (6, 4 )  R 1  (7, 4 )  R 1 oR ,
2 2
x y
 1 (7, 6 )  R, (6, 7 )  R 1  (7, 7 )  R 1 oR
(12 )2 (4 )2
(3, 7 )  R , (7, 3)  R 1  (3, 3)  R 1 oR ,
Hence, R 1 oR  {(1, 1); (4, 4); (4, 7); (7, 4), (7, 7); (3, 3)}.
15. (d) On the set N of natural numbers,
x2 + y2 = 52
R  {( x , y ) : x , y  N , 2 x  y  41} .
x2 y2 x2 y2 Since (1,1)  R as 2 .1  1  3  41 . So, R is not reflexive.
B=   1 i.e., 2
+ 1.
144 16 (12) (4 )2 (1, 39 )  R but (39 , 1)  R . So R is not symmetric (20, 1)
18 Set Theory and Relations
(1, 39  R . But (20 , 39 )  R , So R is not transitive.