Advertisements
Advertisements
प्रश्न
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
पर्याय
1
2
3
5
Advertisements
उत्तर
The maximum number of equivalence relations on the set A = {1, 2, 3} are 5.
Explanation:
Given, set A = {1, 2, 3}
Now, the number of equivalence relations as follows
R1 = {(1, 1), (2, 2), (3, 3)}
R2 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
R3 = {(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)}
R4 = {(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)}
R5 = {(1, 2, 3) ⇔ A x A = A2}
Thus, maximum number of equivalence relation is ‘5’.
APPEARS IN
संबंधित प्रश्न
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a + 1} is reflexive, symmetric, or transitive.
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 in the set A of points in a plane given by R = {(P, Q) : distance of the point P from the origin is the same as the distance of the point Q from the origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with the origin as its centre.
Show that the relation R defined in the set A of all polygons as R = {(P1, P2): 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 R be the relation in the set N given by R = {(a, b) : a = b − 2, b > 6}. Choose the correct answer.
Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(a, b) : a, b ∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]
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
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.
Give an example of a relation which is reflexive and transitive but not symmetric?
Give an example of a relation which is symmetric and transitive but not reflexive?
Give an example of a relation which is transitive but neither reflexive nor symmetric?
Defines a relation on N:
x + 4y = 10, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?
Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : | a2- b2 | < 8}. Write R as a set of ordered pairs.
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 _______________ .
If `f(x) = (4x + 3)/(6x - 4), x ≠ 2/3`, show that fof (x) = x for all `x ≠ 2/3`. Also, find the inverse of f.
Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c on the A x A , where A = {1, 2,3,...,10} is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.
If A = {a, b, c}, B = (x , y} find B × B.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B
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 ______.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
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.
The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.
Let us define a relation R in R as aRb if a ≥ b. 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:
A relation S in the set of real numbers is defined as `"xSy" => "x" - "y" + sqrt3` is an irrational number, then relation S is ____________.
There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:
A market research group conducted a survey of 2000 consumers and reported that 1720 consumers like product P1 and 1450 consumers like product P2. What is the least number that must have liked both the products?
Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R 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)
