हिंदी

Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets

Advertisements
Advertisements

प्रश्न

Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets

रिक्त स्थान भरें
Advertisements

उत्तर

Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into three pairwise disjoint subsets

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 1: Relations And Functions - Solved Examples [पृष्ठ १०]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 12
अध्याय 1 Relations And Functions
Solved Examples | Q 28 | पृष्ठ १०

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

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

Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


The following relation is defined on the set of real numbers.  aRb if |a| ≤ b

Find whether relation is reflexive, symmetric or transitive.


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


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


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive 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.


If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.


Let C be the set of all complex numbers and Cbe the set of all no-zero complex numbers. Let a relation R on Cbe defined as

`z_1 R  z_2  ⇔ (z_1 -z_2)/(z_1 + z_2)` is real for all z1, z2 ∈ C0.

Show that R is an equivalence relation.


State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?


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


R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .


Let R be the relation on the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then, _____________________ .


The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .


S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S 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 _______________ .


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


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


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


Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}


Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______


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


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B


The following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.


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


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


Every relation which is symmetric and transitive is also reflexive.


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


Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.


R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.


Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.


A relation R on a non – empty set A is an equivalence relation if it is ____________.


Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.


A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever


Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:

R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}

  • The above-defined relation R is ____________.

Define the relation R in the set N × N as follows:

For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.


Let R1 and R2 be two relations defined as follows :

R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and

R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______


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


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?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×