Advertisements
Advertisements
प्रश्न
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is given by ______.
Advertisements
उत्तर
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is given by {(1, 1), (1, 2), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3), (3, 4), (4, 3), (4, 4),( 5, 5)}.
Explanation:
Given, A = {1, 2, 3, 4, 5}
R = {(a, b) : |a2 – b2| < 8}
∴ R = {(1, 1), (1, 2), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3), (3, 4), (4, 3), (4, 4),( 5, 5)}
APPEARS IN
संबंधित प्रश्न
If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.
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}.
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A of human beings in a town at a particular time given by R = {(x, y) : x is exactly 7 cm taller than y}.
Given an example of a relation. Which is Transitive but neither reflexive nor symmetric.
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]
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x is father of and y}
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is 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
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
Define a transitive relation ?
Define an equivalence relation ?
If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set 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 = { (a, b) : 2 divides a - b }.
Write the equivalence class [0].
For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} 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.
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.
For real numbers x and y, define xRy if and only if x – y + `sqrt(2)` is an irrational number. Then the relation R is ______.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive
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 ______.
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 ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
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.
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?
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?
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 ____________.
The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} is
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)
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
