मराठी

Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer. - Mathematics

Advertisements
Advertisements

प्रश्न

Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.

पर्याय

  • R is reflexive and symmetric but not transitive.

  • R is reflexive and transitive but not symmetric.

  • R is symmetric and transitive but not reflexive.

  • R is an equivalence relation.

MCQ
बेरीज

उत्तर

R is reflexive and transitive but not symmetric.

Explanation:

⇒ R is reflexive because (1, 1), (2, 2), (3, 3), (4, 4) ∈ R for all 1, 2, 3, 4 ∈ {1, 2, 3, 4}

⇒ R is transitive because (1, 3) ∈ R and (3, 2) ∈ R

(1, 2) ∈ R for all 1, 2, 3 ∈ {1, 2, 3, 4}

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations and Functions - Exercise 1.1 [पृष्ठ ७]

APPEARS IN

एनसीईआरटी Mathematics [English] Class 12
पाठ 1 Relations and Functions
Exercise 1.1 | Q 15 | पृष्ठ ७

संबंधित प्रश्‍न

Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.


Show that each of the relation R in the set A= {x  ∈ Z : 0 ≤ x  ≤ = 12} given by R = {(a, b) : |a - b| is a multiple of 4} is an equivalence relation. Find the set of all elements related to 1 in each case.


Show that the relation R defined in the set A of all polygons as R = {(P1P2): P1 and P2have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?


Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is

(A) 1 (B) 2 (C) 3 (D) 4


Test whether the following relation R3 is (i) reflexive (ii) symmetric and (iii) transitive:

R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.


Give an example of a relation which is symmetric but neither reflexive nor transitive?


m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence relation?


Write the domain of the relation R defined on the set Z of integers as follows:-
(a, b) ∈ R ⇔ a2 + b2 = 25


Define an equivalence relation ?


Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.


Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(ab) : | a2b| < 8}. Write as a set of ordered pairs.


R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .


R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .


If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .


Mark the correct alternative in the following question:

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 _______________ .


Mark the correct alternative in the following question:

Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m  L. Then, R is ______________ .


Mark the correct alternative in the following question:

Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b for all a, b  T. Then, R is ____________ .


Mark the correct alternative in the following question:

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 _____________ .


If A = {a, b, c}, B = (x , y} find B × B.


If A = {1, 2, 3, 4 }, define relations on A which have properties of being: 
reflexive, symmetric and transitive


Give an example of a map which is not one-one but onto


Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ______.


Consider the 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 ______.


The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.


Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.


Which of the following is not an equivalence relation on I, the set of integers: x, y


Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?


Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?


Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B is ____________.


Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is ____________.


Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.


Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.


Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:


The relation > (greater than) on the set of real numbers is


Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×