Let W denote the words in the English...

MathematicsTypes of RelationsJEE Main 2006Easy

View in:English Hindi

Let W denote the words in the English dictionary. Define the relation R by $R = {(x, y) \in W \times W ∣ the words x and y have at least one letter in common.}$ Then R is

(A)

not reflexive, symmetric and transitive

(B)

reflexive, symmetric and not transitive

(C)

reflexive, symmetric and transitive

(D)

reflexive, not symmetric and transitive

Answer:B

Visualized Solution (Hindi)

Understanding the Relation .math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } R

Let $W$ be the set of all words in the English dictionary.
Relation $R$ is defined as: $R = {(x, y) \in W \times W ∣ x \cap y \neq = \emptyset}$ , where $x$ and $y$ represent the set of letters in the words.

Checking for Reflexivity

For reflexivity, we check if $(x, x) \in R$ for all $x \in W$ .
Since every word $x$ has at least one letter, $x \cap x = x \neq = \emptyset$ .
Thus, $(x, x) \in R$ , so $R$ is reflexive.

Checking for Symmetry

For symmetry, if $(x, y) \in R$ , then $(y, x)$ must be in $R$ .
$(x, y) \in R ⟹ x \cap y \neq = \emptyset$ .
Since $x \cap y = y \cap x$ , then $y \cap x \neq = \emptyset ⟹ (y, x) \in R$ .
Thus, $R$ is symmetric.

Checking for Transitivity

For transitivity, if $(x, y) \in R$ and $(y, z) \in R$ , then $(x, z)$ must be in $R$ .
Counter-example: Let $x = cat$ , $y = apple$ , $z = pen$ .
$(x, y) \in R$ because they share 'a'.
$(y, z) \in R$ because they share 'p' and 'e'.
But $x \cap z = \emptyset$ , so $(x, z) \in / R$ .
Thus, $R$ is not transitive.

Final Conclusion

The relation $R$ is reflexive and symmetric.
The relation $R$ is not transitive.
Final Answer: Reflexive, symmetric and not transitive.

00:00 / 00:00

Conceptually Similar Problems

MathematicsTypes of RelationsJEE Main 2004Easy

View in:English Hindi

Let $R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)}$ be a relation on the set $A = {1, 2, 3, 4}$ . The relation R is

(A)

reflexive

(B)

transitive

(C)

not symmetric

(D)

a function

Answer:C

MathematicsTypes of RelationsJEE Main 2005Easy

View in:English Hindi

Let $R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)}$ be a relation on the set $A = {3, 6, 9, 12}$ . The relation is

(A)

reflexive and transitive only

(B)

reflexive only

(C)

an equivalence relation

(D)

reflexive and symmetric only

Answer:A

MathematicsTypes of RelationsJEE Main 2010Easy

View in:English Hindi

Consider the following relations: R = {(x, y) | x, y are real numbers and x = wy for some rational number w}; S = {( $\frac{m}{n}, \frac{p}{q}$ ) | m, n, p and q are integers such that $n, q \neq = 0$ and qm = pn}. Then

(A)

Neither R nor S is an equivalence relation

(B)

S is an equivalence relation but R is not an equivalence relation

(C)

R and S both are equivalence relations

(D)

R is an equivalence relation but S is not an equivalence relation

Answer:B

MathematicsTypes of RelationsJEE Main 2011Easy

View in:English Hindi

Let R be the set of real numbers. Statement-1: $A = {(x, y) \in R \times R : y - x is an integer}$ is an equivalence relation on R. Statement-2: $B = {(x, y) \in R \times R : x = α y for some rational number α}$ is an equivalence relation on R.

(A)

Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1.

(B)

Statement-1 is true, Statement-2 is false.

(C)

Statement-1 is false, Statement-2 is true.

(D)

Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1.

Answer:B

MathematicsTypes of RelationsJEE Main 2008Easy

View in:English Hindi

Let $R$ be the real line. Consider the following subsets of the plane $R \times R$ : $S = {(x, y) : y = x + 1 and 0 < x < 2}$ , $T = {(x, y) : x - y is an integer}$ . Which one of the following is true?

(A)

Neither S nor T is an equivalence relation on R

(B)

Both S and T are equivalence relation on R

(C)

S is an equivalence relation on R but T is not

(D)

T is an equivalence relation on R but S is not

Answer:D

MathematicsFundamental Principle of CountingJEE Advanced 1982Easy

View in:English Hindi

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are

(A)

69760

(B)

30240

(C)

99748

(D)

none of these

Answer:A

MathematicsClassification of FunctionsJEE Advanced 1979Easy

View in:English Hindi

Let $R$ be the set of real numbers. If $f : R \to R$ is a function defined by $f (x) = x^{2}$ , then $f$ is :

(A)

Injective but not surjective

(B)

Surjective but not injective

(C)

Bijective

(D)

None of these

Answer:D

MathematicsClassification of FunctionsJEE Advanced 1981Easy

View in:English Hindi

Let $A$ and $B$ be two sets each with a finite number of elements. Assume that there is an injective mapping from $A$ to $B$ and that there is an injective mapping from $B$ to $A$ . Prove that there is a bijective mapping from $A$ to $B$ .

MathematicsClassification of FunctionsJEE Advanced 2005Moderate

View in:English Hindi

If the functions $f (x)$ and $g (x)$ are defined on $R \to R$ such that $f (x) = {0, x, x \in rational x \in irrational$ ; $g (x) = {0, x, x \in irrational x \in rational$ then $(f - g) (x)$ is

(A)

one-one & onto

(B)

neither one-one nor onto

(C)

one-one but not onto

(D)

onto but not one-one

Answer:A

MathematicsFundamental Principle of CountingJEE Main 2012Easy

View in:English Hindi

Let $X = {1, 2, 3, 4, 5}$ . The number of different ordered pairs (Y,Z) that can formed such that $Y \subseteq X, Z \subseteq X$ and $Y \cap Z$ is empty is:

(A)

5²

(B)

3⁵

(C)

2⁵

(D)

5³

Answer:B

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let W denote the words in the English dictionary. Define the relation R by R={(x,y)∈W×W∣the words x and y have at least one letter in common.} Then R is

Visualized Solution (Hindi)

Understanding the Relation .math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } R

Checking for Reflexivity

Checking for Symmetry

Checking for Transitivity

Final Conclusion

Conceptually Similar Problems

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R={(1,3),(4,2),(2,4),(2,3),(3,1)} be a relation on the set A={1,2,3,4}. The relation R is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R={(3,3),(6,6),(9,9),(12,12),(6,12),(3,9),(3,12),(3,6)} be a relation on the set A={3,6,9,12}. The relation is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R be the real line. Consider the following subsets of the plane R×R: S={(x,y):y=x+1 and 0<x<2}, T={(x,y):x−y is an integer}. Which one of the following is true?

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R be the set of real numbers. If f:R→R is a function defined by f(x)=x2, then f is :

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } If the functions f(x) and g(x) are defined on R→R such that f(x)={0,x,​x∈rationalx∈irrational​; g(x)={0,x,​x∈irrationalx∈rational​ then (f−g)(x) is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let X={1,2,3,4,5}. The number of different ordered pairs (Y,Z) that can formed such that Y⊆X,Z⊆X and Y∩Z is empty is:

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let W denote the words in the English dictionary. Define the relation R by R={(x,y)∈W×W∣the words x and y have at least one letter in common.} Then R is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R={(1,3),(4,2),(2,4),(2,3),(3,1)} be a relation on the set A={1,2,3,4}. The relation R is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R={(3,3),(6,6),(9,9),(12,12),(6,12),(3,9),(3,12),(3,6)} be a relation on the set A={3,6,9,12}. The relation is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R be the real line. Consider the following subsets of the plane R×R: S={(x,y):y=x+1 and 0<x<2}, T={(x,y):x−y is an integer}. Which one of the following is true?

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let R be the set of real numbers. If f:R→R is a function defined by f(x)=x2, then f is :

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } If the functions f(x) and g(x) are defined on R→R such that f(x)={0,x,​x∈rationalx∈irrational​; g(x)={0,x,​x∈irrationalx∈rational​ then (f−g)(x) is

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let X={1,2,3,4,5}. The number of different ordered pairs (Y,Z) that can formed such that Y⊆X,Z⊆X and Y∩Z is empty is: