April 2026

Give an example of a function (i) Which is one โ€“ one but not onto.

Example of a One-One but Not Onto Function ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Give an example of a function which is: (i) one-one but not onto. โœ… Solution Consider the function: \[ f:\mathbb{N}\to\mathbb{N} \] defined by: \[ f(x)=x+1 \] ๐Ÿ”น Check One-One (Injective) Assume: \[ f(x_1)=f(x_2) \] Then: \[ x_1+1=x_2+1 \] So: \[ x_1=x_2 \] […]

Give an example of a function (i) Which is one โ€“ one but not onto. Read More ยป

For real numbers x and y, define x R y iff x – y+ โˆš2 is an irrational number. Then the relation R is A. reflexive B. symmetric C. transitive D. none of these

Relation \( x-y+\sqrt{2} \) Irrational on Real Numbers ๐Ÿ“บ Video Explanation ๐Ÿ“ Question For real numbers \(x\) and \(y\), relation \(R\) is defined by: \[ xRy \iff x-y+\sqrt{2} \text{ is irrational} \] Then, \(R\) is: A. reflexive B. symmetric C. transitive D. none of these โœ… Solution ๐Ÿ”น Reflexive Check Put: \[ x=y \] Then:

For real numbers x and y, define x R y iff x – y+ โˆš2 is an irrational number. Then the relation R is A. reflexive B. symmetric C. transitive D. none of these Read More ยป

Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R is A. symmetric but not transitive B. transitive but not symmetric C. Neither symmetric nor transitive D. both symmetric and transitive

Brother Relation in a Family ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let a non-empty set consist of children in a family. A relation \(R\) is defined by: \[ aRb \iff a \text{ is brother of } b \] Then, \(R\) is: A. symmetric but not transitive B. transitive but not symmetric C. neither symmetric nor transitive

Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R is A. symmetric but not transitive B. transitive but not symmetric C. Neither symmetric nor transitive D. both symmetric and transitive Read More ยป

Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as a R b if a is congruent to b for all a, bย ฯตย T. Then, R is A. reflexive but not symmetric B. transitive but not symmetric C. equivalence D. none of these

Congruence Relation on Set of Triangles ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let \(T\) be the set of all triangles in the Euclidean plane. A relation \(R\) on \(T\) is defined by: \[ aRb \iff a \text{ is congruent to } b \] Then, \(R\) is: A. reflexive but not symmetric B. transitive but not symmetric

Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as a R b if a is congruent to b for all a, bย ฯตย T. Then, R is A. reflexive but not symmetric B. transitive but not symmetric C. equivalence D. none of these Read More ยป

Let L denote the set of all straight lines in a plane. Let a relation R be defined by l R m iff l is perpendicular to m for all l, mย ฯตย L. Then, R is A. reflexive B. symmetric C. transitive D. none of these

Relation of Perpendicular Lines in a Plane ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let \(L\) denote the set of all straight lines in a plane. A relation \(R\) is defined by: \[ lRm \iff l \perp m \] Then, \(R\) is: A. reflexive B. symmetric C. transitive D. none of these โœ… Solution ๐Ÿ”น Reflexive Check

Let L denote the set of all straight lines in a plane. Let a relation R be defined by l R m iff l is perpendicular to m for all l, mย ฯตย L. Then, R is A. reflexive B. symmetric C. transitive D. none of these Read More ยป

Let R be a relation on the set N of natural numbers defined by n R m if n divides m. Then, R is A. Reflexive and symmetric B. Transitive and symmetric C. Equivalence D. Reflexive, transitive but Not symmetric

Divisibility Relation on \( \mathbb{N} \) ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let relation \(R\) on natural numbers \( \mathbb{N} \) be defined by: \[ nRm \iff n \text{ divides } m \] Then, \(R\) is: A. Reflexive and symmetric B. Transitive and symmetric C. Equivalence relation D. Reflexive, transitive but not symmetric โœ… Solution ๐Ÿ”น

Let R be a relation on the set N of natural numbers defined by n R m if n divides m. Then, R is A. Reflexive and symmetric B. Transitive and symmetric C. Equivalence D. Reflexive, transitive but Not symmetric Read More ยป

The maximum number of equivalence relations on the set A = {1, 2, 3} is A. 1 B. 2 C. 3 D. 5

Maximum Number of Equivalence Relations on Set \( A=\{1,2,3\} \) ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Find the maximum number of equivalence relations on the set: \[ A=\{1,2,3\} \] A. 1 B. 2 C. 3 D. 5 โœ… Solution Number of equivalence relations on a finite set = number of partitions of that set. For set

The maximum number of equivalence relations on the set A = {1, 2, 3} is A. 1 B. 2 C. 3 D. 5 Read More ยป

The relation S defined on the set R of all real number by the rule a Sb iff a โ‰ฅ b is A. an equivalence relation B. reflexive, transitive but not symmetric C. symmetric, transitive but not reflexive D. neither transitive nor reflexive but symmetric

Relation \( a\geq b \) on \( \mathbb{R} \) ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let relation \(S\) on the set of real numbers \(\mathbb{R}\) be defined by: \[ aSb \iff a\geq b \] Then, \(S\) is: A. an equivalence relation B. reflexive, transitive but not symmetric C. symmetric, transitive but not reflexive D. neither transitive

The relation S defined on the set R of all real number by the rule a Sb iff a โ‰ฅ b is A. an equivalence relation B. reflexive, transitive but not symmetric C. symmetric, transitive but not reflexive D. neither transitive nor reflexive but symmetric Read More ยป

Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then, R is A. reflexive but not symmetric B. reflexive but not transitive C. symmetric and transitive D. neither symmetric nor transitive.

Relation on Set \( A=\{1,2,3\} \) ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let: \[ A=\{1,2,3\} \] and: \[ R=\{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \] Then, \(R\) is: A. reflexive but not symmetric B. reflexive but not transitive C. symmetric and transitive D. neither symmetric nor transitive โœ… Solution ๐Ÿ”น Reflexive Check A relation is reflexive if: \[ (1,1),(2,2),(3,3) \] are

Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then, R is A. reflexive but not symmetric B. reflexive but not transitive C. symmetric and transitive D. neither symmetric nor transitive. Read More ยป

If the set Z of all integers, which of the following relation R is not an equivalence relation? A. x R y : if x โ‰ค y B. x R y : if x = y C. x R y : if x – y is an even integer D. x R y : if x โ‰ก y (mod 3)

Which Relation on \( \mathbb{Z} \) is Not an Equivalence Relation? ๐Ÿ“บ Video Explanation ๐Ÿ“ Question Let \( \mathbb{Z} \) be the set of all integers. Which of the following relations is not an equivalence relation? A. \(xRy \iff x\leq y\) B. \(xRy \iff x=y\) C. \(xRy \iff x-y \text{ is even}\) D. \(xRy \iff

If the set Z of all integers, which of the following relation R is not an equivalence relation? A. x R y : if x โ‰ค y B. x R y : if x = y C. x R y : if x – y is an even integer D. x R y : if x โ‰ก y (mod 3) Read More ยป