Two friends Ramesh and Divya have started playing Ludo at their house. While rolling the die, they observed each time, that the possible outcomes are {1, 2, 3, 4, 5, 6}. Let A be the set of players and B be the set of all possible outcomes, so A = {Ramesh, Divya} and B = {1, 2, 3, 4, 5, 6}. Based on the above information, answer the following questions : Let relation R : B → B be defined as R = {(x, y) : y is divisible by x}.

Papers Sign In Request access

Free previous-year papers & practice for JEE, NEET and CBSE Boards.

Papers Privacy Terms Contact

Papers Sign In Request access

Free previous-year papers & practice for JEE, NEET and CBSE Boards.

Papers Privacy Terms Contact

Definition of Relation in Mathematics, Reflexive Relation, Symmetric Relation, Transitive Relation, Equivalence Relation | PadhAiPro

Question

CASE_STUDIESDefinition of Relation in MathematicsReflexive RelationSymmetric RelationTransitive RelationEquivalence Relation4 sub-questions

Similar Questions

A relation R on set A = {1, 2, 3, 4, 5} is defined as R = {(x, y) : |x² – y²| < 8}. Check whether the relation R is reflexive, symmetric and transitive.

TextReflexive RelationSymmetric RelationTransitive RelationEquivalence Relation

One-to-One (Injective) Function

Onto (Surjective) Function

A function f is defined from R → R as f(x) = ax + b, such that f(1) = 1 and f(2) = 3. Find function f(x). Hence, check whether function f(x) is one-one and onto or not.

TextReflexive RelationSymmetric RelationTransitive RelationEquivalence RelationOne-to-One (Injective) FunctionOnto (Surjective) Function

Show that a function f : R → R defined by f(x) = 2x/(1 + x²) is neither one-one nor onto. Further, find set A so that the given function f : R → A becomes an onto function.

TextReflexive RelationSymmetric RelationTransitive RelationEquivalence RelationOne-to-One (Injective) FunctionOnto (Surjective) Function

A relation R is defined on N × N (where N is the set of natural numbers) as : (a, b) R (c, d) ⇔ a – c = b – d. Show that R is an equivalence relation.

TextReflexive RelationSymmetric RelationTransitive RelationEquivalence RelationOne-to-One (Injective) FunctionOnto (Surjective) Function

A relation R on set A = {– 4, – 3, – 2, – 1, 0, 1, 2, 3, 4} be defined as R = {(x, y) : x + y is an integer divisible by 2}. Show that R is an equivalence relation. Also, write the equivalence class [2].

TextEquivalence Relation

Assertion (A): The relation R = {(x, y) : (x + y) is a prime number and x, y ∈ N} is not a reflexive relation. Reason (R): The number '2n' is composite for all natural numbers n.

Assertion-ReasonReflexive Relation