Advertisements
Advertisements
Question
Let A = {a, b, c} and R = {(a, a), (b, b), (a, c)}. Write down the minimum number of ordered pairs to be included to R to make it reflexive
Advertisements
Solution
Given A = {a, b, c}
R = {(a, a), (b, b), (a, c)}
The minimum ordered pair to be included to R in order to make it reflexive is (c, c).
APPEARS IN
RELATED QUESTIONS
The given figure shows a relationship between the sets P and Q. Write this relation
- in set-builder form.
- in roster form.
What is its domain and range?

Let A = {x, y, z} and B = {1, 2}. Find the number of relations from A to B.
Let R be a relation from N to N defined by R = {(a, b) : a, b ∈ N and a = b2}. Is the statement true?
(a, b) ∈ R and (b, c) ∈ R implies (a, c) ∈ R
Justify your answer in case.
If R = {(x, y) : x, y ∈ Z, x2 + y2 ≤ 4} is a relation on Z, then the domain of R is ______.
Let R be a relation on N defined by x + 2y = 8. The domain of R is
R is a relation from [11, 12, 13] to [8, 10, 12] defined by y = x − 3. Then, R−1 is
If `(x + 1/3, y/3 - 1) = (1/2, 3/2)`, find x and y
Express {(x, y) / x2 + y2 = 100, where x, y ∈ W} as a set of ordered pairs
Write the relation in the Roster Form. State its domain and range
R5 = {(x, y)/x + y = 3, x, y∈ {0, 1, 2, 3}
Answer the following:
Determine the domain and range of the following relation.
R = {(a, b)/b = |a – 1|, a ∈ Z, IaI < 3}
Answer the following:
Show that the following is an equivalence relation
R in A is set of all books. given by R = {(x, y)/x and y have same number of pages}
Let A = {1, 2, 3, 7} and B = {3, 0, –1, 7}, the following is relation from A to B?
R1 = {(2, 1), (7, 1)}
Let A = {1, 2, 3, 7} and B = {3, 0, –1, 7}, the following is relation from A to B?
R2 = {(–1, 1)}
Let A = {1, 2, 3, 7} and B = {3, 0, –1, 7}, the following is relation from A to B?
R3 = {(2, –1), (7, 7), (1, 3)}
Multiple Choice Question :
Let n(A) = m and n(B) = n then the total number of non-empty relation that can be defined from A to B is ________.
Discuss the following relation for reflexivity, symmetricity and transitivity:
The relation R defined on the set of all positive integers by “mRn if m divides n”
Let A = {a, b, c} and R = {(a, a), (b, b), (a, c)}. Write down the minimum number of ordered pairs to be included to R to make it transitive
Is the following relation a function? Justify your answer
R1 = `{(2, 3), (1/2, 0), (2, 7), (-4, 6)}`
Is the given relation a function? Give reasons for your answer.
h = {(4, 6), (3, 9), (– 11, 6), (3, 11)}
Let n(A) = m, and n(B) = n. Then the total number of non-empty relations that can be defined from A to B is ______.
