Advertisements
Advertisements
Question
Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation
Solution
Given ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n.
Now, for
aRa ⇒ (a – a) is divisible by n, which is true for any integer a as ‘0’ is divisible by n.
Thus, R is reflective.
Now, aRb
So, (a – b) is divisible by n.
⇒ – (b – a) is divisible by n.
⇒ (b – a) is divisible by n
⇒ bRa
Thus, R is symmetric.
Let aRb and bRc
Then, (a – b) is divisible by n and (b – c) is divisible by n.
So, (a – b) + (b – c) is divisible by n.
⇒ (a – c) is divisible by n.
⇒ aRc
Thus, R is transitive.
So, R is an equivalence relation.
APPEARS IN
RELATED QUESTIONS
determination of whether the following relations are reflexive, symmetric, and transitive:
Relation R in the set N of natural numbers defined as
R = {(x, y): y = x + 5 and x < 4}
Show that the relation R in the set R of real numbers, defined as R = {(a, b): a ≤ b2} is neither reflexive nor symmetric nor transitive.
Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
Given a non-empty set X, consider P (X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
The following relation is defined on the set of real numbers.
aRb if 1 + ab > 0
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?
Defines a relation on N :
x + y = 10, x, y∈ N
Determine the above relation is reflexive, symmetric and transitive.
Define a symmetric relation ?
If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.
R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .
Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).
Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from A to B which is not injective
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is given by ______.
Which of the following is not an equivalence relation on I, the set of integers: x, y
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?
Total number of equivalence relations defined in the set S = {a, b, c} is ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} is
If f(x + 2a) = f(x – 2a), then f(x) is:
Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R is ______.
