मराठी

Let N Be a Fixed Positive Integer. Define a Relation R on Z as Follows: (A, B) ∈ R ⇔ a − B is Divisible by N. Show that R is an Equivalence Relation on Z. - Mathematics

Advertisements
Advertisements

प्रश्न

Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.

बेरीज

उत्तर

We observe the following properties of R. Then,
Reflexivity :

Let  ∈ N

Here,

− 0 × n

⇒ aa is divisible by n

⇒ (a, a∈ R

⇒ (a, a∈ R for all ∈ Z

So, R is reflexive on Z.

Symmetry :

Let (a, b∈ R

Here,

ab is divisible by n

⇒ anp for some ∈ Z

⇒ bn (p)

⇒ ba is divisible by n                     ∈ Z⇒ − ∈ Z]

⇒ (b, a∈ R 

So, R is symmetric on Z.

Transitivity :

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

Here, ab is divisible by n and bc is divisible by n.

⇒ abnp for some ∈ Z

and bnq for some ∈ Z

abbnnq

⇒ an (p+q)

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

So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations - Exercise 1.2 [पृष्ठ २६]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 12
पाठ 1 Relations
Exercise 1.2 | Q 4 | पृष्ठ २६

संबंधित प्रश्‍न

determination of whether the following relations are 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 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 A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a - b| is even}, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.


Given an example of a relation. Which is Transitive but neither reflexive nor symmetric.


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

(A) 1

(B) 2

(C) 3

(D) 4


Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(ab) : a∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]


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

R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5


Defines a relation on :
  x > y, x, y ∈  N

Determine the above relation is reflexive, symmetric and transitive.


Defines a relation on :

x + y = 10, xy∈ N

Determine the above relation is reflexive, symmetric and transitive.


Let R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = yu. Show that R is an equivalence relation.


Show that the relation R, defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have same number of sides},
is an equivalence relation. What is the set of all elements in A related to the right-angled triangle T with sides 3, 4 and 5?


Define a reflexive relation ?


Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.


Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(ab) : | a2b| < 8}. Write as a set of ordered pairs.


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


Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .


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


Mark the correct alternative in the following question:

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


Mark the correct alternative in the following question:

The relation S defined on the set R of all real number by the rule aSb if a  b is _______________ .


Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive


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


If A = {1, 2, 3, 4 }, define relations on A which have properties of being: 
symmetric but neither reflexive nor 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


Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then R is ______.


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


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


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 = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?


Let us define a relation R in R as aRb if a ≥ b. Then R 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:

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}

  • Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?

An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. 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} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Ravi wishes to form all the relations possible from B to G. How many such relations are possible?

Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.

Answer the following using the above information.

  • Let R = `{ ("L"_1, "L"_2) ∶ "L"_1 bot "L"_2  "where"  "L"_1, "L"_2 in "L" }` which of the following is true?

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


The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} is


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


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)

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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×