Advertisements
Advertisements
Question
Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.
Solution
R is the set of ordered pairs satisfying the above relation. Also, no two different elements can satisfy the relation; only the same elements can satisfy the given relation.
So, R = {(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)}
APPEARS IN
RELATED QUESTIONS
determination of whether the following relations are reflexive, symmetric, and transitive:
Relation R in the set A = {1, 2, 3...13, 14} defined as R = {(x,y):3x - y = 0}
determination of whether the following relations are 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}
determination of whether the following relations are reflexive, symmetric, and transitive:
Relation R in the set A of human beings in a town at a particular time given by (c) 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.
The following relation is defined on the set of real numbers. aRb if |a| ≤ b
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ N, 2x + y = 41}
Find the domain and range of R. Also, verify whether R is (i) reflexive, (ii) symmetric (iii) transitive.
Let Z be the set of integers. Show that the relation
R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.
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 S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.
Write the identity relation on set A = {a, b, c}.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
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 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 _______________ .
A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : x R y ⇔ x is relatively prime to y. Then, domain of R is ______________ .
A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?
If R is a relation on the set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
If A = {a, b, c}, B = (x , y} find B × 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 R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.
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
The following defines a relation on N:
x + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.
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.
Which of the following is not an equivalence relation on I, the set of integers: x, y
R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
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 ____________.
The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = {(L1, L2 ): L1 is parallel to L2 and L1: y = x – 4} then which of the following can be taken as L2?
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} is
A relation 'R' in a set 'A' is called reflexive, if
Define the relation R in the set N × N as follows:
For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.
Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then 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)
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?
