Advertisements
Advertisements
Question
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”
Advertisements
Solution
S = {set of all positive integers}
(a) mRm ⇒ ‘m’ divides’m’ ⇒ reflexive
(b) mRn ⇒ m divides n but
nRm ⇒ n does not divide m
(i.e.,) mRn ≠ nRm
It is not symmetric
(c) mRn ⇒ nRr as n divides r
It is transitive
APPEARS IN
RELATED QUESTIONS
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 relation from A to B
Justify your answer in case.
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 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.
Define a relation R on the set N of natural number by R = {(x, y) : y = x + 5, x is a natural number less than 4, x, y ∈ N}. Depict this relationship using (i) roster form (ii) an arrow diagram. Write down the domain and range or 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 n(A) = 3, n(B) = 4, then write n(A × A × B).
Let A and B be two sets such that n(A) = 3 and n(B) = 2. If (x, 1), (y, 2), (z, 1) are in A × B, write A and B
Write the relation in the Roster Form. State its domain and range
R1 = {(a, a2)/a is prime number less than 15}
Select the correct answer from given alternative.
Let R be a relation on the set N be defined by {(x, y)/x, y ∈ N, 2x + y = 41} Then R is ______.
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 symmentric
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 ________.
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 symmetric
Is the following relation a function? Justify your answer
R1 = `{(2, 3), (1/2, 0), (2, 7), (-4, 6)}`
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 ______.
A relation on the set A = {x : |x| < 3, x ∈ Z}, where Z is the set of integers is defined by R = {(x, y) : y = |x| ≠ –1}. Then the number of elements in the power set of R is ______.
When are two ordered pairs \((a,b)\) and \((c,d)\) equal?
