मराठी

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

Advertisements
Advertisements

प्रश्न

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

पर्याय

  • reflexive but not symmetric

  • transitive but not symmetric

  • equivalence

  • none of these

MCQ
Advertisements

उत्तर

Hence, R is equivalence.

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

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 1 Relations
Exercise 1.4 | Q 32 | पृष्ठ ३३

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

Determine whether the following relation is reflexive, symmetric and transitive:

Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.


Given an example of a relation. Which is transitive but neither reflexive nor symmetric.


Given an example of a relation. Which is reflexive and symmetric but not transitive.


Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have 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?


The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4


Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows:
R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}.

Find whether or not each of the relations R1, R2, R3, R4 on A is (i) reflexive (ii) symmetric and (iii) transitive.


The following relation is defined on the set of real numbers.
aRb if a – b > 0

Find whether relation is reflexive, symmetric or transitive.


Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.


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


Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?


Give an example of a relation which is reflexive and symmetric but not transitive?


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


Let O be the origin. We define a relation between two points P and Q in a plane if OP = OQ. Show that the relation, so defined is an equivalence relation.


Let C be the set of all complex numbers and Cbe the set of all no-zero complex numbers. Let a relation R on Cbe defined as

`z_1 R  z_2  ⇔ (z_1 -z_2)/(z_1 + z_2)` is real for all z1, z2 ∈ C0.

Show that R is an equivalence relation.


A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(xy) : y is one half of xxy ∈ A} is a relation on A, then write R as a set of ordered pairs.


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 R be the equivalence relation on the set Z of the integers given by R = { (ab) : 2 divides }.

Write the equivalence class [0].


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.


Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,


The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .


Let A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .


Mark the correct alternative in the following question:

The relation S defined on the set R of all real number by the rule aSb if a  b is _______________ .


For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.


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


Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).


Write the relation in the Roster form and hence find its domain and range:

R2 = `{("a", 1/"a")  "/"  0 < "a" ≤ 5, "a" ∈ "N"}`


Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets


Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive


Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation


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


Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.


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


Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Let R ∶ B → B be defined by R = {(x, y): y is divisible by x} is ____________.

Given a non-empty set X, define the relation R in P(X) as follows:

For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.


Let A = {3, 5}. Then number of reflexive relations on A is ______.


Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].


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?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×