Advertisements
Advertisements
Question
Let A = {1, 2, 3, 4, 6}. Let R be the relation on A defined by {(a, b): a, b ∈ A, b is exactly divisible by a}.
- Write R in roster form
- Find the domain of R
- Find the range of R.
Advertisements
Solution
A = {1, 2, 3, 4, 6},
R = {(a, b): a, b ∈ A, b is exactly divisible by a}
- R = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 6), (2, 2), (2, 4), (2, 6), (3, 3), (3, 6), (4, 4), (6, 6)}
- Domain of R = {1, 2, 3, 4, 6}
- Range of R = {1, 2, 3, 4, 6}
APPEARS IN
RELATED QUESTIONS
Determine the domain and range of the relation R defined by R = {(x, x + 5): x ∈ {0, 1, 2, 3, 4, 5}}.
Let R be the relation on Z defined by R = {(a, b): a, b ∈ Z, a – b is an integer}. Find the domain and range of R.
Find the inverse relation R−1 in each of the cases:
(i) R = {(1, 2), (1, 3), (2, 3), (3, 2), (5, 6)}
Determine the domain and range of the relation R defined by
(i) R = [(x, x + 5): x ∈ (0, 1, 2, 3, 4, 5)]
Let A = [1, 2, 3, 4, 5, 6]. Let R be a relation on A defined by {(a, b) : a, b ∈ A, b is exactly divisible by a}
(i) Writer R in roster form
(ii) Find the domain of R
(ii) Find the range of R.
For the relation R1 defined on R by the rule (a, b) ∈ R1 ⇔ 1 + ab > 0. Prove that: (a, b) ∈ R1 and (b , c) ∈ R1 ⇒ (a, c) ∈ R1 is not true for all a, b, c ∈ R.
Let R be a relation on N × N defined by
(a, b) R (c, d) ⇔ a + d = b + c for all (a, b), (c, d) ∈ N × N
(iii) (a, b) R (c, d) and (c, d) R (e, f) ⇒ (a, b) R (e, f) for all (a, b), (c, d), (e, f) ∈ N × N
If A = {1, 2, 4}, B = {2, 4, 5} and C = {2, 5}, write (A − C) × (B − C).
If R is a relation defined on the set Z of integers by the rule (x, y) ∈ R ⇔ x2 + y2 = 9, then write domain of R.
If R is a relation from set A = (11, 12, 13) to set B = (8, 10, 12) defined by y = x − 3, then write R−1.
Let R = [(x, y) : x, y ∈ Z, y = 2x − 4]. If (a, -2) and (4, b2) ∈ R, then write the values of a and b.
Let A = [1, 2, 3, 5], B = [4, 6, 9] and R be a relation from A to B defined by R = {(x, y) : x − yis odd}. Write R in roster form.
If A = {1, 2, 4}, B = {2, 4, 5}, C = {2, 5}, then (A − B) × (B − C) is
A relation ϕ from C to R is defined by x ϕ y ⇔ |x| = y. Which one is correct?
If the set A has p elements, B has q elements, then the number of elements in A × B is
If R is a relation from a finite set A having m elements of a finite set B having n elements, then the number of relations from A to B is
If P = {1, 2, 3) and Q = {1, 4}, find sets P × Q and Q × P
Let A = {1, 2, 3, 4), B = {4, 5, 6}, C = {5, 6}. Verify, A × (B ∪ C) = (A × B) ∪ (A × C)
Let A = {6, 8} and B = {1, 3, 5}
Show that R1 = {(a, b)/a ∈ A, b ∈ B, a − b is an even number} is a null relation. R2 = {(a, b)/a ∈ A, b ∈ B, a + b is odd number} is an universal relation
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:
If A = {1, 2, 3}, B = {4, 5, 6} check if the following are relations from A to B. Also write its domain and range
R4 = {(4, 2), (2, 6), (5, 1), (2, 4)}
Answer the following:
Determine the domain and range of the following relation.
R = {(a, b)/a ∈ N, a < 5, b = 4}
Answer the following:
Find R : A → A when A = {1, 2, 3, 4} such that R = {(a, b)/|a − b| ≥ 0}
Answer the following:
R = {1, 2, 3} → {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} Check if R is reflexive
Answer the following:
Show that the following is an equivalence relation
R in A = {x ∈ N/x ≤ 10} given by R = {(a, b)/a = b}
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)}
Represent the given relation by
(a) an arrow diagram
(b) a graph and
(c) a set in roster form, wherever possible
{(x, y) | y = x + 3, x, y are natural numbers < 10}
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 reflexive
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 symmetric
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
On the set of natural numbers let R be the relation defined by aRb if 2a + 3b = 30. Write down the relation by listing all the pairs. Check whether it is symmetric
Choose the correct alternative:
The relation R defined on a set A = {0, −1, 1, 2} by xRy if |x2 + y2| ≤ 2, then which one of the following is true?
Choose the correct alternative:
The rule f(x) = x2 is a bijection if the domain and the co-domain are given by
If R2 = {(x, y) | x and y are integers and x2 + y2 = 64} is a relation. Then find R2.
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 ______.
Let f: R `rightarrow` R be defined by f(x) = `x/(1 + x^2), x ∈ R`. Then the range of f is ______.
Let A = {1, 2, 3, 4}, B = {1, 5, 9, 11, 15, 16} and f = {(1, 5), (2, 9), (3, 1), (4, 5), (2, 11)}. Is the following true?
f is a function from A to B
Justify your answer in case.
