101.
If $$A = \left\{ {a,\,b,\,c,\,d} \right\},\,B = \left\{ {1,\,2,\,3} \right\},$$ which of the following sets of ordered pairs are not relations from $$A$$ to $$B\,?$$
A
$$\left\{ {\left( {a,\,1} \right),\,\left( {a,\,3} \right)} \right\}$$
B
$$\left\{ {\left( {b,\,1} \right),\,\left( {c,\,2} \right),\,\left( {d,\,1} \right)} \right\}$$
C
$$\left\{ {\left( {a,\,2} \right),\,\left( {b,\,3} \right),\,\left( {3,\,b} \right)} \right\}$$
D
$$\left\{ {\left( {a,\,1} \right),\,\left( {b,\,2} \right),\,\left( {c,\,3} \right)} \right\}$$
Let $$x \in A\,\,{\text{and }}x \in B$$
$$\eqalign{
& \Leftrightarrow \,x \in A \cup B \cr
& \Leftrightarrow \,\,x \in A \cup C\,\,\,\left( {\because A \cup B = A \cup C} \right) \cr
& \Leftrightarrow x \in C \cr
& \therefore \,\,B = C. \cr} $$
Let $$x \in A\,\,{\text{and }}x \in B$$
$$\eqalign{
& \Leftrightarrow \,x \in A \cap B \cr
& \Leftrightarrow \,\,x \in A \cap C\,\,\,\left( {\because A \cap B = A \cap C} \right) \cr
& \Leftrightarrow x \in C \cr
& \therefore \,\,B = C. \cr} $$
103.
The range of the function $$f\left( x \right) = {}^{7 - x}{P_{x - 3}}$$ is :
106.
Let $$W$$ denote the words in the English dictionary. Define the relation $$R$$ by $$R = \left\{ {\left( {x,y} \right)} \right. \in W \times W$$ the words $$x$$ and $$y$$ have at least one letter in common.} Then $$R$$ is
Clearly $$(x, x)$$ $$ \in R\,\forall x \in W.$$ So $$R$$ is relexive.
Let $$(x, y)$$ $$ \in R,$$ then $$(y, x)$$ $$ \in R$$ as $$x$$ and $$y$$ have at least one letter in common. So, $$R$$ is symmetric.
But $$R$$ is not transitive for example
Let $$x$$ = INDIA, $$y$$ = BOMBAY and $$z$$ = JOKER
then $$(x, y)$$ $$ \in R$$ ($$A$$ is common) and $$(y, z)$$ $$ \in R$$ ($$O$$ is common) but $$(x, z)$$ $$ \notin R.$$ (as no letter is common)
107.
A dinner party is to be fixed for group of 100 persons. in this party, 50 persons do not prefer fish, 60 prefer chicken and 10 do not prefer either chicken or fish. The number of persons who prefer both fish and chicken is :
Total number of persons $$ = a + b + c + n = 100$$
Do not prefer fish $$b + n = 50$$
$$60$$ prefer chicken hence $$b + c = 60$$
Do not like fish and chicken is $$n = 10$$
On solving these equations we will get $$a = 30,\,b = 40,\,c = 20$$
The number of persons who prefer both fish and chicken is $$ = c = 20$$
108.
Let $$R = \left\{ {\left( {x,\,y} \right):x,\,y\, \in \,N{\text{ and }}{x^2} - 4xy + 3{y^2} = 0} \right\},$$ where $$N$$ is the set of all natural numbers. Then the relation $$R$$ is :
$$\eqalign{
& R = \left\{ {\left( {x,\,y} \right):x,\,y\, \in \,N{\text{ and }}{x^2} - 4xy + 3{y^2} = 0} \right\}, \cr
& {\text{Now, }}{x^2} - 4xy + 3{y^2} = 0\,\,\, \Rightarrow \left( {x - y} \right)\left( {x - 3y} \right) = 0 \cr
& \therefore \,x = y{\text{ or }}x = 3y \cr
& \therefore \,R = \left\{ {\left( {1,\,1} \right),\,\left( {3,\,1} \right),\,\left( {2,\,2} \right),\,\left( {6,\,2} \right),\,\left( {3,\,3} \right),\,\left( {9,\,3} \right),.....} \right\} \cr} $$
Since $$\left( {1,\,1} \right),\,\left( {2,\,2} \right),\,\left( {3,\,3} \right),.....$$ are present in the relation, therefore $$R$$ is reflexive.
Since $$\left( {3,\,1} \right)$$ is an element of $$R$$ but $$\left( {1,\,3} \right)$$ is not the element of $$R$$ is not symmetric.
$$\eqalign{
& {\text{Here }}\left( {3,\,1} \right)\, \in \,R{\text{ and }}\left( {1,\,1} \right)\, \in \,R\, \Rightarrow \left( {3,\,1} \right)\, \in \,R \cr
& \left( {6,\,2} \right)\, \in \,R{\text{ and }}\left( {2,\,2} \right)\, \in \,R\, \Rightarrow \left( {6,\,2} \right)\, \in \,R \cr
& {\text{For all such }}\left( {a,\,b} \right)\, \in \,R{\text{ and }}\left( {b,\,c} \right)\, \in \,R \Rightarrow \left( {a,\,c} \right)\, \in \,R \cr
& {\text{Hence }}R{\text{ is transitive}}{\text{.}} \cr} $$
109.
Let $$A = \left\{ {1,\,2,\,3} \right\}$$ and $$B = \left\{ {a,\,b,\,c} \right\}.$$ If $$f$$ is a function from $$A$$ to $$B$$ and $$g$$ is a one-one function from $$A$$ to $$B,$$ then the maximum number of definitions of :