Advertisements
Advertisements
प्रश्न
On the set of natural numbers let R be the relation defined by aRb if a + b ≤ 6. Write down the relation by listing all the pairs. Check whether it is equivalence
Advertisements
उत्तर
N = the set of natural numbers.
R is the relation defined on N by
a R b if a + b ≤ 6
R = {(a, b), a, b ∈ N / a + b ≤ 6}
a + b ≤ 6 ⇒ b ≤ 6 – a
a = 1,
b ≤ 6 – 1 = 5
b is 1, 2, 3, 4, 5
∴ (1, 1), (1, 2), (1, 3), (1, 4), (1, 5) ∈ R
a = 2,
b ≤ 6 – 2 = 4
b is 1, 2, 3, 4
∴ (2, 1), (2, 2), (2, 3), (2, 4) ∈ R
a = 3,
b < 6 – 3 = 3
b is 1, 2, 3
∴ (3, 1), (3, 2), (3, 3) ∈ R
a = 4 ,
b < 6 – 4 = 2
b is 1, 2
∴ (4, 1), (4, 2) ∈ R
a = 5,
b < 6 – 5 = 1
b is 1
∴ (5, 1) ∈ R
∴ R = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (4, 1), (4, 2), (5, 1)}
R is not an equivalence relation.
APPEARS IN
संबंधित प्रश्न
A = {1, 2, 3, 5} and B = {4, 6, 9}. Define a relation R from A to B by R = {(x, y): the difference between x and y is odd; x ∈ A, y ∈ B}. Write R in roster form.
Let A = [1, 2] and B = [3, 4]. Find the total number of relation from A into B.
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
Show that:
(ii) (a, b) R (c, d) ⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ N × N
If n(A) = 3, n(B) = 4, then write n(A × A × B).
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 R is a relation on a finite set having n elements, then the number of relations on A is
Let A = {1, 2, 3, 4), B = {4, 5, 6}, C = {5, 6}. Verify, A × (B ∪ C) = (A × B) ∪ (A × C)
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)}
Multiple Choice Question :
If there are 1024 relation from a set A = {1, 2, 3, 4, 5} to a set B, then the number of elements in B is
Let A = {9, 10, 11, 12, 13, 14, 15, 16, 17} and let f : A → N be defined by f(n) = the highest prime factor of n ∈ A. Write f as a set of ordered pairs and find the range of f
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 equivalence
On the set of natural numbers let R be the relation defined by aRb if a + b ≤ 6. Write down the relation by listing all the pairs. Check whether it is reflexive
Is the given relation a function? Give reasons for your answer.
f = {(x, x) | x is a real number}
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 ______.
Which statement defines a relation from set \(A\) to set \(B\)?
For two non-empty sets \(A\) and \(B\), which expression gives their Cartesian product?
For a relation \(R\), the domain is the set of all:
For \(R=\{(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)\}\) from \(A\) to \(B=\{1,4,5\}\), which statement is correct?
Let \(A=\{1,2,3\}\), \(B=\{3,4\}\), and \(C=\{4,5,6\}\). What is \((A\times B)\cap(A\times C)\)?
