Advertisements
Advertisements
प्रश्न
An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.
पर्याय
True
False
Advertisements
उत्तर
This statement is False.
Explanation:
The given relation is reflexive and transitive but not symmetric.
APPEARS IN
संबंधित प्रश्न
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Given an example of a relation. Which is symmetric and transitive but not reflexive.
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?
Given a non-empty set X, consider P(X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
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.
Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.
Defines a relation on N:
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Defines a relation on N:
x + 4y = 10, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b}, is an equivalence relation.
Let C be the set of all complex numbers and C0 be the set of all no-zero complex numbers. Let a relation R on C0 be 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.
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 A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?
Let R be the relation over the set of all straight lines in a plane such that l1 R l2 ⇔ l 1⊥ l2. Then, R is _____________ .
If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .
Show that the relation R on the set Z of integers, given by R = {(a,b):2divides (a - b)} is an equivalence relation.
Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
Let A = {6, 8} and B = {1, 3, 5}.
Let R = {(a, b)/a∈ A, b∈ B, a – b is an even number}. Show that R is an empty relation from A to B.
Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
The following defines a relation on N:
x + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.
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 ______.
Every relation which is symmetric and transitive is also reflexive.
Total number of equivalence relations defined in the set S = {a, b, c} is ____________.
Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R inset of triangles defined as R = `{(Delta_1, Delta_2) : Delta_1 "is similar to" Delta_2}`. Which triangles belong to the same equivalence class?
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 ____________.
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Let R: B → B be defined by R = {(x, y): x and y are students of same sex}, Then this relation R is ____________.
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
Read the following passage:
|
An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. |
Based on the above information, answer the following questions:
- How many relations are possible from B to G? (1)
- Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
- Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
OR
A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)
