English

Prove that the Relation R on Z Defined by (A, B) ∈ R ⇔ a − B is Divisible by 5 is an Equivalence Relation on Z.

Advertisements
Advertisements

Question

Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.

Sum
Advertisements

Solution

We observe the following properties of relation R.

Reflexivity :

Let a be an arbitrary element of R. Then,

⇒ aa = 0 = 0 × 5

⇒ aa is divisible by 5

⇒ (a, a∈ R for all ∈ Z

So, R is reflexive on Z.

Symmetry :

Let (a, b∈ R

⇒ ab is divisible by 5

⇒ ab = 5p for some ∈ Z

⇒ ba = 5 (p)

Here, ∈ Z                      [ Since ∈ Z]

⇒ ba is divisible by 5

⇒ (b, a∈ R for all a, ∈ Z

So, R is symmetric on Z.

Transitivity :

Let (a, b) and (b, c∈ R

⇒ ab is divisible by 5

⇒ ab = 5p for some Z

Also, bc is divisible by 5

⇒ bc = 5q for some Z

Adding the above two, we get

bc = 55q

⇒ ac = 5 )

⇒ ac is divisible by 5

Here,  ∈ Z

⇒ (a, c∈ R for all a, ∈ Z

So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations - Exercise 1.2 [Page 26]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 1 Relations
Exercise 1.2 | Q 3 | Page 26

RELATED QUESTIONS

Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].


Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.


Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : |a – b| is a multiple of 4} is an equivalence relation. Find the set of all elements related to 1.


Let L be the set of all lines in the XY plane and R be the relation in L defined as R = {(L1, L2) : L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4.


The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4


Test whether the following relation R1 is  (i) reflexive (ii) symmetric and (iii) transitive :

R1 on Q0 defined by (a, b) ∈ R1 ⇔ = 1/b.


If = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?


Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.


Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b},  is an equivalence relation.


Define a reflexive relation ?


A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(xy) : y is one half of xxy ∈ A} is a relation on A, then write R as a set of ordered pairs.


The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .


 If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .


Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c   on the A x A  , where A =  {1, 2,3,...,10}  is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.


Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).


Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if and only if l is perpendicular to m ∀ l, m ∈ L. Then R is ______.


For real numbers x and y, define xRy if and only if x – y + `sqrt(2)` is an irrational number. Then the relation R is ______.


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


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


Give an example of a map which is one-one but not onto


Let A = {1, 2, 3, ... 9} and R be the relation in A × A defined by (a, b) R(c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)]


Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?


Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?


Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) is ____________.


If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.


Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ____________.


Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is ____________.


Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.


Find: `int (x + 1)/((x^2 + 1)x) dx`


The value of k for which the system of equations x + ky + 3z = 0, 4x + 3y + kz = 0, 2x + y + 2z = 0 has nontrivial solution is


If A is a finite set consisting of n elements, then the number of reflexive relations on A is


Let f(x)= ax2 + bx + c be such that f(1) = 3, f(–2) = λ and f(3) = 4. If f(0) + f(1) + f(–2) + f(3) = 14, then λ is equal to ______.


lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A is ______.


Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Which relation satisfies the transitive condition for the pairs \((1,2)\) and \((2,3)\)?


What should be checked to determine whether a relation is reflexive?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×