Advertisements
Advertisements
Question
Represent the given relation by
(a) an arrow diagram
(b) a graph and
(c) a set in roster form, wherever possible
{(x, y) | x = 2y, x ∈ {2, 3, 4, 5}, y ∈ {1, 2, 3, 4}
Advertisements
Solution
x = {2, 3, 4, 5} y = {1, 2, 3, 4}
x = 2y
2y = x
y = `x/2`
If `x = 2 ⇒ y = x/2 = 2/2 = 1`
if `x = 3 ⇒ y = x/2 = 3/2`
If `x = 4 ⇒ y = x/2 = 4/2 = 2`
If `x = 5 ⇒ y = x/2 = 5/2`
(a) Arrow diagram
(b) Graph
(c) Roster form R = {(2, 1) (4, 2)}
APPEARS IN
RELATED QUESTIONS
Let A = {1, 2, 3, …, 14}. Define a relation R from A to A by R = {(x, y): 3x – y = 0, where x, y ∈ A}. Write down its domain, codomain and range.
Define a relation R on the set N of natural numbers by R = {(x, y): y = x + 5, x is a natural number less than 4; x, y ∈ N}. Depict this relationship using roster form. Write down the domain and the range.
If A = {1, 2, 4}, B = {2, 4, 5} and C = {2, 5}, write (A − C) × (B − C).
If n(A) = 3, n(B) = 4, then write n(A × A × B).
If A = {a, b, c}, B = {x, y}, find A × B, B × A, A × A, B × B
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 X = {a, b, c, d} 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
Prove that the relation “friendship” is not an equivalence relation on the set of all people in Chennai
Let A = {a, b, c}. What is the equivalence relation of smallest cardinality on A? What is the equivalence relation of largest cardinality on A?
Choose the correct alternative:
Let f : R → R be defined by f(x) = 1 − |x|. Then the range of f is
