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. - Mathematics

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

RD Sharma Mathematics [English] Class 12
Chapter 1 Relations
Exercise 1.2 | Q 3 | Page 26

RELATED QUESTIONS

Determine whether the following relation is reflexive, symmetric and transitive:

Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x, y) : 3x − y = 0}.


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.


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.


Show that the relation R in the set A of points in a plane given by R = {(P, Q) : distance of the point P from the origin is the same as the distance of the point Q from the origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with the origin as its centre.


Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is

(A) 1 (B) 2 (C) 3 (D) 4


Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is

(A) 1

(B) 2

(C) 3

(D) 4


Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.


Defines a relation on N:

xy is square of an integer, x, y ∈ N

Determine the above relation is reflexive, symmetric and transitive.


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


If R and S are relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?


For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.


Let A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?


Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs


Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,


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


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


For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.


If A = {a, b, c}, B = (x , y} find A × B.


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


Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.


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


The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.


An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.


Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?


Which of the following is not an equivalence relation on I, the set of integers: x, y


Let us define a relation R in R as aRb if a ≥ b. 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 R be the relation “is congruent to” on the set of all triangles in a plane is ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Let R be a relation on B defined by R = {(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5)}. Then R is:

There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:


Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.


Read the following passage:

An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B = {b1, b2, b3} and G = {g1, g2}, where B represents the set of Boys selected and G the set of Girls selected for the final race.

Based on the above information, answer the following questions:

  1. How many relations are possible from B to G? (1)
  2. Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
  3. Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
    OR
    A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)

Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].


A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation R is ______.


Let L be a set of all straight lines in a plane. The relation R on L defined as 'perpendicular to' is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×